一、题目
二、代码
/**
* 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 = fast.next;
if(fast!=null)
{
fast = fast.next;
slow = slow.next;
if(fast == slow)
{
ListNode before = head;
ListNode now = fast;
while(before!=now)
{
before = before.next;
now = now.next;
}
return now;
}
}
}
return null;
}
}