linked-list-cycle

題目描述
Given a linked list, determine if it has a cycle in it.
Follow up:

Can you solve it without using extra space?

IDEA

藉助 點擊打開鏈接

緩慢指針能相遇，說明有環

CODE

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