題目

https://leetcode-cn.com/problems/linked-list-cycle-ii/

代碼

使用java的方式解決

public class Solution {
    public ListNode detectCycle(ListNode head) {
        Set<ListNode>set = new HashSet<ListNode>();

        ListNode node = head;
        while(node!=null){
            if(set.contains(node)){
                return node;
            }else{
                set.add(node);
                node=node.next;
            }
        }
        return null;
    }
}

這種方式需要畫圖看看，轉(zhuǎn)換其實(shí)是一個(gè)數(shù)學(xué)問題。

/**
 * 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 fast=head;
        ListNode slow=head;
        boolean hasCycle=false;
        while(fast!=null&&fast.next!=null){
            fast=fast.next.next;
            slow=slow.next;
            if(fast==slow){
                hasCycle=true;
                break;
            }
        }
        
        if(hasCycle){
            ListNode pp = head;
            while(pp!=slow){
                pp=pp.next;
                slow=slow.next;
            }
            return pp;
        }else{
            return null;
        }
    }
}