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.
算法
- 方法1
最容易想的就是找个容器(Hash Table),把出现过的节点存起来,然后每次有新节点出现就看看这个节点是否之前出现过,需要另外开辟空间。 - 方法2
然而,比较有意思的是有人提出了一种双指针算法,模拟两个速度不同的人在跑道上跑,如果存在回路,这两个人必会遇到一次,因此设置一个指针每次只跳一个节点,另一个指针每次“隔着跳”,无需开辟另外的内存空间。
代码
bool hasCycle(struct ListNode *head) {
if(head==NULL||head->next == NULL){
return false;
}
struct ListNode *slow = head;
struct ListNode *fast = head->next;
while(slow!=fast){
if(slow->next==NULL||fast->next==NULL){
return false;
}
if(fast->next->next==NULL){
return false;
}
slow = slow->next;
fast = fast->next->next;
}
return true;
}