Linked List Cycle

class Solution 
    {
public:
    bool hasCycle(ListNode *head) 
    {
        if (NULL == head) return false;
        ListNode* pSlow = head;
        ListNode* pFast = head;
        
        while(NULL != pFast)
        {
            pSlow = pSlow->next;
            pFast = pFast->next;
            if (NULL != pFast)
                pFast = pFast->next;
            else
                return false;
                
            if (pFast == pSlow)
                return true;
        }
    }
};

Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?