leetcode141 判断是否有环

/**
 * 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 *p = head, *q = head;
        while (q && q->next)//条件：两个指针都指向空
 {
            p = p->next;
            q = q->next->next;
            if (p == q) return true;
        }
        return false;
    }
        
    }
};