leetcode---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?

/**
 * 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;

        set<ListNode*> s;
        ListNode *p = head;
        ListNode *n = p;
        s.insert(n);
        while(p != NULL)
        {
            p = p->next;
            n = p;
            if(s.count(n))
                return true;
            s.insert(n);
        }
        return false;
    }
};