Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
Follow up:
Can you solve it without using extra space?
分析:经典链表题,快慢指针法。
假设链表头到环开头有K个结点,则慢指针走到环头为K步,快指针为2K步,设环长度为size,则快指针在m*size-K步之后与慢指针相遇,此时慢指针在经过K步到达环头。K未知,则把快指针重新指向链表头,快慢指针每次向前移动一步,相遇点即为环头。
/**
* 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) {
ListNode fast = head;
ListNode slow = head;
while(fast != null && fast.next != null){
fast = fast.next.next;
slow = slow.next;
//find the meet point
if(fast == slow)
break;
}
//no circle
if(fast == null || fast.next == null)
return null;
fast = head;
while(fast != slow){
fast = fast.next;
slow = slow.next;
}
return slow;
}
}