leetcode 141. Linked List Cycle(链表是否存在环)

Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

 

Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.

Example 2:

Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.

Example 3:

Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.

 

Follow up:

Can you solve it using O(1) (i.e. constant) memory?

思路：环问题一般使用快慢指针。

代码：

public class Solution {
    public boolean hasCycle(ListNode head) {
        ListNode fast=head,low=head;
        while(fast!=null&&fast.next!=null){
            fast=fast.next.next;    //1
            low=low.next;           //1
            if(fast==low)    //2
                return true;
        }
        return false;
    }
}

注意：本代码中，刚开始快慢指针都从头节点开始，所以，代码1在2前面。