Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
为了不另开内存,可以用快慢指针来判别,如果有环那么快指针肯定会追上慢指针;
fast=fast->next->next;
slow=slow->next;
判断fast是否等于slow,是 true,否继续循环判别。代码入下:
/**
* 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 *fast=head;
ListNode *slow=head;
while(fast!=NULL && slow!=NULL && fast->next!=NULL){
fast=fast->next->next;
slow=slow->next;
if(fast==slow)
return true;
}
return false;
}
};