Leecode 141. 环形链表 快慢指针

原题链接：Leecode 141. 环形链表


解法一：哈希

/**
 * 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) {
        map<ListNode*,int> m;
        while(head)
        {
            if(m[head]) return true;
            m[head]=1;
            head=head->next;
        }
        return false;
    }
};

解法二：快慢指针

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