要求:找无头链表的环
思路:
法一:哈希一下遍历过的指针看有无相同的,O(n),O(n)
/**
* 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) {
unordered_map <ListNode *,int> m;
ListNode *p = head;
while(p){
if(m.count(p))return true;
m[p]=1;
p=p->next;
}
return false;
}
};
法二:快慢指针,若无环则快指针退出;若有环设共有s个节点,设慢指针进入环第一个节点时,快指针到慢指针距离为d,快指针每次走2距离,慢指针1,走x次后相遇,即2x-x=d,得x=d,必然有解。时间O(n),空间O(1)
/**
* 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==NULL)return false;
ListNode *fast=head,*slow=head;
while(fast&&fast->next){
fast=fast->next->next;
slow=slow->next;
if(fast==slow)return true;
}
return false;
}
};