141. Linked List Cycle

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
// Linked List Cycle
class Solution{
public:
    bool hasCycle(ListNode *head) {
        if (!head||!head->next)
        {
            return false;
        }
        ListNode* slow=head;
        ListNode* fast = head->next;

        while (fast!=NULL&&fast->next!=NULL)
        {
            if (slow==fast)
            {
                return true;
            }

            slow = slow->next;
            fast = fast->next->next;
            
        }
        return false;
    }
};