Leetcode
2020.05.04 08:55

# 876. Middle of the Linked List

조회 수 676 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given a non-empty, singly linked list with head node `head`, return a middle node of linked list.

If there are two middle nodes, return the second middle node.

Example 1:

```Input: [1,2,3,4,5]
Output: Node 3 from this list (Serialization: [3,4,5])
The returned node has value 3.  (The judge's serialization of this node is [3,4,5]).
Note that we returned a ListNode object ans, such that:
ans.val = 3, ans.next.val = 4, ans.next.next.val = 5, and ans.next.next.next = NULL.
```

Example 2:

```Input: [1,2,3,4,5,6]
Output: Node 4 from this list (Serialization: [4,5,6])
Since the list has two middle nodes with values 3 and 4, we return the second one.
```

Note:

• The number of nodes in the given list will be between `1` and `100`.

```/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode() {}
*     ListNode(int val) { this.val = val; }
*     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
int count = 0;

while(node != null){
count++;
node = node.next;
}

for(int i=0; i<count/2; i++){
node = node.next;
}

return node;
}
}```

```/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode() {}
*     ListNode(int val) { this.val = val; }
*     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
List<ListNode> list = new ArrayList<>();
int count = 0;

while(node != null){
count++;
node = node.next;
}

return list.get(count/2);
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode [todo] 687. Longest Univalue Path 2020.05.01 211
76 Programmers team game 2020.04.30 0
75 Programmers hashmap 2020.04.30 0
74 Programmers fib 2020.04.30 0
73 Leetcode 997. Find the Town Judge 2020.05.02 716
72 Leetcode 994. Rotting Oranges 2020.04.14 173
71 Leetcode 993. Cousins in Binary Tree 2020.04.30 221
70 Leetcode 973. K Closest Points to Origin 2020.04.15 169
69 Leetcode 946. Validate Stack Sequences 2020.04.08 162
68 Leetcode 937. Reorder Data in Log Files 2020.04.25 165
67 Leetcode 897. Increasing Order Search Tree 2020.05.04 687
» Leetcode 876. Middle of the Linked List 2020.05.04 676
65 Leetcode 872. Leaf-Similar Trees 2020.05.04 678
64 Leetcode 852. Peak Index in a Mountain Array 2020.04.28 165
63 Leetcode 844. Backspace String Compare 2020.05.05 736
62 Leetcode 783. Minimum Distance Between BST Nodes 2020.05.01 725
61 Leetcode 763. Partition Labels 2020.04.17 216
60 Leetcode 75. Sort Colors 2020.04.14 152
59 Leetcode 731. My Calendar II 2020.04.15 155
58 Leetcode 729. My Calendar I 2020.04.15 151
Board Pagination Prev 1 2 3 4 Next
/ 4