@牛客网刷题:利用空间复杂度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) {
ListNode *slow;
ListNode *fast;
slow = head;
fast = head;
int flag = 0;
while ( fast != nullptr)
{
if (fast->next != nullptr)
slow = slow->next;
else{
flag = 0;
break;
}
if(fast->next->next != nullptr )
fast = fast->next->next;
else{
flag = 0;
break;
}
if ( slow == fast )
{
flag = 1;
break;
}
}
if (flag == 0)
return false;
else
return true;
}
};