采用快慢指针,如果链表存在环,则快慢指针一定会相遇
/**
* 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) {
ListNode* slow = head, * fast = head;
while(fast != nullptr){
slow = slow->next;
if(fast->next == nullptr){
return false;
}
fast = fast->next->next;
if(slow == fast){
return true;
}
}
return false;
}
};