循环链表入口

Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.
Follow up:
Can you solve it without using extra space?

/**
 * 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)
    {
        if(!head)
            return NULL;
        vector<ListNode *> temp;
       ListNode *p = head;
        while(p&&count(temp.begin(),temp.end(),p) == 0)
        {
            temp.push_back(p);
            p = p->next;
        }
        return p;
    }
};