# 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.


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

Code

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

class Solution(object):
"""
:rtype: bool
"""
return False
while fast and fast.next:
if fast == slow:
return True
else:
fast = fast.next.next
slow = slow.next
return False


C++ version

/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
return false;
}
while (fast && fast->next){
if (slow == fast){
return true;
}
else{
fast = fast->next->next;
slow = slow->next;
}
}
return false;
}
};


## Note

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