[Leetcode] (141 circular linked list)

bool hasCycle(struct ListNode *head) 
{
    
    
    struct ListNode *fast=head,*slow=head;
    while((fast)!=NULL && (fast->next)!=NULL)
    {
    
    
        fast=fast->next->next;
        slow=slow->next;
        if(fast==slow)
        {
    
    
            return true;
        }
    }
    return false;
}