Given a linked list, determine if it has a cycle in it.
分析:
判断一个链表是否存在环。设置快慢指针,慢指针一次走一步,快指针一次走两步,如果最后快指针能够追上慢指针,则该链表存在环。
/**
* 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;
ListNode *fast = head;
while(fast && fast->next)
{
slow = slow->next;
fast = fast->next->next;
if(slow == fast)
return true;
}
return false;
}
};