-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
53 lines (48 loc) · 1.53 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
package middleoflinkedlist;
import datastructures.ListNode;
/**
* Given a non-empty, singly linked list with head node head, return a middle node of linked list.
* <p>
* If there are two middle nodes, return the second middle node.
* <p>
* <p>
* <p>
* Example 1:
* <p>
* 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:
* <p>
* 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.
* <p>
* <p>
* Note:
* <p>
* The number of nodes in the given list will be between 1 and 100.
*/
class Solution {
ListNode middleNode(ListNode head) {
ListNode slow = head, fast = head, temp = head;
int count = 0;
while (temp != null) {
count++;
temp = temp.next;
}
while (slow.next != null && fast.next != null && fast.next.next != null) {
slow = slow.next;
fast = fast.next.next;
}
return count % 2 != 0 ? slow : slow.next;
}
/*
Success
Details
Runtime: 0 ms, faster than 100.00% of Java online submissions for Middle of the Linked List.
Memory Usage: 36.6 MB, less than 7.84% of Java online submissions for Middle of the Linked List.
*/
}