题目连接:Leetcode 141 Linked List Cycle
解题思路:创建两个指针,从起始位置开始,一个走一步,一个走两步,如果存在环,两个指针会有相等的时候。
/**
* 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* one = head;
ListNode* two = head;
while (two != NULL) {
one = one->next;
two = two->next;
if (two == NULL) return false;
two = two->next;
if (one == two) return true;
}
return false;
}
};