【LeetCode】Linked List Cycle

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