package p3.链式结构;
public class Solution142 {
public ListNode detectCycle(ListNode head) {
if (head == null || head.next == null) {
return null;
}
ListNode slow = head;
ListNode fast = head;
while (fast.next != null && fast.next.next != null) {
slow = slow.next;
fast = fast.next.next;
if (slow == fast) {
ListNode cur = head;
while (cur != slow){
cur = cur.next;
slow = slow.next;
}
return cur;
}
}
return null;
}
}
Leetcode142. 环形链表 II
最新推荐文章于 2024-10-11 19:43:29 发布