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?

Reference Answer

思路分析

这道题是快慢指针的经典应用。只需要设两个指针，一个每次走一步的慢指针和一个每次走两步的快指针，如果链表里有环的话，两个指针最终肯定会相遇。实在是太巧妙了，要是我肯定想不出来。

不用担心两者永远不能相遇，因为快指针每次都比慢指针快1，所以不管链表是否为偶数或奇数个节点，不影响两者相遇。

代码如下：

Code

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def hasCycle(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """
        if not head or not head.next:
            return False
        slow = head
        fast = head.next
        while fast and fast.next:
            if fast == slow:
                return True
            else:
                fast = fast.next.next
                slow = slow.next
        return False

C++ version

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        if(!head || !head->next){
           return false; 
        }
        ListNode *slow = head;
        ListNode *fast = head->next;
        while (fast && fast->next){
            if (slow == fast){
                return true;
            }
            else{
                fast = fast->next->next;
                slow = slow->next;
            }
        }
        return false;
    }
};

Note

• 快慢指针相遇，很巧妙啊~~！有木有~~。