leetcode(142)

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        std::set<ListNode *>node_set;
        while(head){
            if(node_set.find(head)!=node_set.end()){
                return head;
            }
            node_set.insert(head);

        head=head->next;
        }
        return NULL;
    }
};

快慢指针的方法：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        ListNode *fast = head;
        ListNode *slow = head;
        ListNode *meet = NULL;
        while(fast){
            slow=slow->next;
            fast=fast->next;
            //if fast not NULL
            if(!fast){
                    return NULL;
            }
            fast=fast->next;
            //get meet
            if(fast==slow){
                meet=fast;
                break;
            }
        }

        if(meet==NULL){
            return NULL;
        }
        while(head&& meet){
            if(meet==head){
                return head;
            }
            head =head->next;
            meet =meet->next;

        }
        return NULL;
    }
};