[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) {
        ListNode* a=head;
        ListNode* b=head;
        if(a==NULL)
        return false;
        a=a->next;
        while(a!=NULL)
        {
            if(a==b)
            return true;
            else
            {
                if(a->next==NULL)
                return false;
                a=a->next->next;
                b=b->next;
            }
        }
        return false;
    }
};