https://leetcode-cn.com/problems/linked-list-cycle/description/
给定一个链表,判断链表中是否有环。
进阶:
你能否不使用额外空间解决此题?
/**
* 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 == NULL || head->next == NULL){
return false;
}
ListNode* cur1 = head;
ListNode* cur2 = head;
while(cur1 && cur1->next){
cur1 = cur1->next->next;
cur2 = cur2->next;
if(cur1 == cur2){
return true;
}
}
return false;
}
};