LeetCode OJ - Linked List Cycle

/**
 * 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;
        }
        
        ListNode *quicker = head->next;
        ListNode *slower = head;
        
        while ((quicker != NULL && quicker->next != NULL) && slower != NULL && quicker != slower) {
            quicker = quicker->next->next;
            slower = slower->next;
        }
        
        return quicker == slower;
    }
};