/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode* slow = head;
ListNode* fast = head;
while(fast != nullptr){
if(fast->next == nullptr){
return nullptr;
}
slow = slow->next;
fast = fast->next->next;
if(slow == fast){
ListNode *p = head;
while(p != slow){
p = p->next;
slow = slow->next;
}
return p;
}
}
return nullptr;
}
};
LeetCode 142. 环形链表 II
最新推荐文章于 2024-10-02 23:40:03 发布