-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathSolution.java
76 lines (69 loc) · 2.08 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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
package ds.pointer.leetcode876;
/**
* 链表的中间节点
* LeetCode 876 https://leetcode-cn.com/problems/middle-of-the-linked-list/
*
* @author yangyi 2022年04月24日17:33:20
*/
public class Solution {
public class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
}
/**
* @return [1, 2, 3, 4, 5]
*/
private ListNode createLink() {
ListNode node_1 = new ListNode(1);
ListNode node_2 = new ListNode(2);
ListNode node_3 = new ListNode(3);
ListNode node_4 = new ListNode(4);
ListNode node_5 = new ListNode(5);
node_1.next = node_2;
node_2.next = node_3;
node_3.next = node_4;
node_4.next = node_5;
return node_1;
}
/**
* @return [1, 2, 3, 4, 5, 6]
*/
private ListNode createLink2() {
ListNode node_1 = new ListNode(1);
ListNode node_2 = new ListNode(2);
ListNode node_3 = new ListNode(3);
ListNode node_4 = new ListNode(4);
ListNode node_5 = new ListNode(5);
ListNode node_6 = new ListNode(6);
node_1.next = node_2;
node_2.next = node_3;
node_3.next = node_4;
node_4.next = node_5;
node_5.next = node_6;
return node_1;
}
public ListNode middleNode(ListNode head) {
ListNode fast = head;
ListNode slow = head;
while (true) {
if (fast == null || fast.next == null) {
break;
}
fast = fast.next.next;
slow = slow.next;
}
return slow;
}
public static void main(String[] args) {
Solution middleNodeLink = new Solution();
ListNode link = middleNodeLink.createLink();
ListNode link2 = middleNodeLink.createLink2();
ListNode middle = middleNodeLink.middleNode(link);
ListNode middle2 = middleNodeLink.middleNode(link2);
System.out.println("[1, 2, 3, 4, 5]的中点为: " + middle.val);
System.out.println("[1, 2, 3, 4, 5, 6]的中点为: " + middle2.val);
}
}