题目
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
分析
设置快慢指针
复杂度
O(n)
CODE
/**
* 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) {
if (!head || !head->next) {
return false;
}
ListNode *slow = head;
ListNode *fast = slow->next;
while(fast) {
if (slow == fast) {
return true;
}
slow = slow->next;
fast = fast->next;
if (fast) {
fast = fast->next;
}
}
return false;
}
};