Leetcode
2020.05.04 08:55

# 876. Middle of the Linked List

조회 수 456 추천 수 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 720. Longest Word in Dictionary 2020.05.07 599
76 Leetcode 697. Degree of an Array 2020.05.05 565
75 Leetcode 783. Minimum Distance Between BST Nodes 2020.05.01 529
74 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree 2020.05.01 516
73 Leetcode 532. K-diff Pairs in an Array 2020.05.04 512
72 Leetcode 997. Find the Town Judge 2020.05.02 510
71 Leetcode 225. Implement Stack using Queues 2020.05.05 509
70 Leetcode 687. Longest Univalue Path 2020.05.01 500
69 Leetcode 724. Find Pivot Index 2020.05.05 496
68 Leetcode 222. Count Complete Tree Nodes 2020.05.05 490
67 Leetcode 844. Backspace String Compare 2020.05.05 481
66 Leetcode 605. Can Place Flowers 2020.05.05 481
65 Leetcode 897. Increasing Order Search Tree 2020.05.04 478
64 Leetcode 872. Leaf-Similar Trees 2020.05.04 468
63 Leetcode 56. Merge Intervals 2020.05.05 465
62 Leetcode 628. Maximum Product of Three Numbers 2020.05.05 462
» Leetcode 876. Middle of the Linked List 2020.05.04 456
60 Leetcode 448. Find All Numbers Disappeared in an Array 2020.05.05 454
59 Leetcode 203. Remove Linked List Elements 2020.05.04 446
58 Leetcode 270. Closest Binary Search Tree Value 2020.05.01 423
Board Pagination Prev 1 2 3 4 Next
/ 4