141. 环形链表
题目链接
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/linked-list-cycle/submissions/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题目描述
题目分析
- 哈希
class Solution {
public:
bool hasCycle(ListNode *head) {
unordered_set<ListNode*> uset;
ListNode* cur = head;
while(cur != nullptr){
if(uset.count(cur)) return true; //已经存在
uset.insert(cur);
cur = cur->next;
}
return false;
}
};
- 快慢指针
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode *slow = head, *fast = head;
while(fast != nullptr && fast->next != nullptr){//注意这个条件
slow = slow->next;
fast = fast->next->next;
if(slow == fast){
fast = head;
while(fast != slow){
fast = fast->next;
slow = slow->next;
}
return true;
}
}
return false;
}
};