环形链表(力扣142)
/**
* 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&&fast->next!=nullptr)//不能写成slow!=fast&&fast!=nullptr&&fast->next!=nullptr,一开始两者就是相同的
{
slow=slow->next;
fast=fast->next->next;
if (fast == slow) {
break;
}
}
if(fast==nullptr||fast->next==nullptr) return nullptr;
ListNode *p2=head;
ListNode *p1=fast;
while(p1!=p2)
{
p1=p1->next;
p2=p2->next;
}
return p1;
}
};