【LeetCode】141. Linked List Cycle

141. Linked List Cycle

Description：
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.
Difficulty：Easy
Example:

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.

方法1: 快慢指针

• Time complexity : $O\left(n\right)$
• Space complexity : $O\left(1\right)$
  思路：
  快慢指针起点一致，快指针每次走两次，慢指针每次走一次，如果没有环，快指针走到最后先停止，如果有环，快慢指针迟早会相遇。

class Solution {
public:
	bool hasCycle(ListNode *head) {
		ListNode* slow = head;
		ListNode* fast = head;
		while (fast && fast->next) {
			fast = fast->next->next;
			slow = slow->next;
			if (fast == slow) return true;
		}
		return false;
	}
};