基本思路:使用快慢指针,若发现两个指针指向同一个节点则说明链表有环
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
bool hasCycle(ListNode *head) {
if (head == NULL)
return false;
ListNode *slow = head, *fast = head;
while (slow != NULL){
if (fast == NULL || fast->next == NULL){
return false;
}
fast = fast->next->next;
if (slow == fast)
return true;
slow = slow->next;
}
return false;
}
};