Linked List Cycle

https://oj.leetcode.com/problems/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) {
                        ListNode *n1;
                        ListNode *n2;
                        if(head==NULL||head->next==NULL)
                                return false;
                        n1=head;
                        n2=head->next;
                        while(n1&&n2)
                        {
                                if(n1==n2)
                                        return true;
                                n1=n1->next;
                                n2=n2->next;
                                if(n2==NULL)
                                        break;
                                n2=n2->next;
                        }
                        return false;
                }
};