题解 | #判断链表中是否有环#

/**
 * 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 *fast=head, *slow = head;
        while(slow&&fast->next&&fast->next->next){
            fast = fast->next->next;
            if(fast==slow) return true;
            slow = slow->next;
        }
        return false;
    }
};