Leetcode
2020.05.04 08:55

# 876. Middle of the Linked List

조회 수 710 추천 수 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);
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
1. ### 720. Longest Word in Dictionary

Date2020.05.07 CategoryLeetcode Byhooni Views928
2. ### 225. Implement Stack using Queues

Date2020.05.05 CategoryLeetcode Byhooni Views781
3. ### 56. Merge Intervals

Date2020.05.05 CategoryLeetcode Byhooni Views729
4. ### 844. Backspace String Compare

Date2020.05.05 CategoryLeetcode Byhooni Views824
5. ### 222. Count Complete Tree Nodes

Date2020.05.05 CategoryLeetcode Byhooni Views756
6. ### 697. Degree of an Array

Date2020.05.05 CategoryLeetcode Byhooni Views818
7. ### 605. Can Place Flowers

Date2020.05.05 CategoryLeetcode Byhooni Views736
8. ### 724. Find Pivot Index

Date2020.05.05 CategoryLeetcode Byhooni Views751
9. ### 448. Find All Numbers Disappeared in an Array

Date2020.05.05 CategoryLeetcode Byhooni Views726
10. ### 628. Maximum Product of Three Numbers

Date2020.05.05 CategoryLeetcode Byhooni Views705
11. ### 532. K-diff Pairs in an Array

Date2020.05.04 CategoryLeetcode Byhooni Views764
12. ### 897. Increasing Order Search Tree

Date2020.05.04 CategoryLeetcode Byhooni Views725
13. ### 872. Leaf-Similar Trees

Date2020.05.04 CategoryLeetcode Byhooni Views719
14. ### 876. Middle of the Linked List

Date2020.05.04 CategoryLeetcode Byhooni Views710
15. ### 203. Remove Linked List Elements

Date2020.05.04 CategoryLeetcode Byhooni Views697
16. ### 997. Find the Town Judge

Date2020.05.02 CategoryLeetcode Byhooni Views761
17. ### 270. Closest Binary Search Tree Value

Date2020.05.01 CategoryLeetcode Byhooni Views694
18. ### 687. Longest Univalue Path

Date2020.05.01 CategoryLeetcode Byhooni Views756