链表经典面试题(六)

1.题目

2.思路分析(文字)

3.详细的注释和代码实现

public class Solution {
    public boolean hasCycle(ListNode head) {
        //定义两个快慢指针
        ListNode fast = head;
        ListNode slow = head;
        //让快指针走两步,慢指针走一步
        while(fast != null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
            if(fast == slow){
                return true;
            }
        }
        return false;
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16