链接:
https://leetcode.com/problems/linked-list-cycle-ii/
大意:
给定一个单链表的头结点,该链表可能有环,找出该链表环的入口节点。如果没有环,则返回空。例子:
思路:
使用快慢指针法。具体证明方法参考:快慢指针法找到链表环入口代码及证明
代码:
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode detectCycle(ListNode head) {
if (head == null || head.next == null)
return null;
ListNode slow = head, fast = head;
while (fast.next != null && fast.next.next != null) {
fast = fast.next.next;
slow = slow.next;
if (fast == slow)
break;
}
// 没有环的情况
if (fast.next == null || fast.next.next == null)
return null;
fast = head;
while (fast != slow) {
fast = fast.next;
slow = slow.next;
}
return slow;
}
}
结果:
结论:
思路很巧妙,题目很经典