Leetcode 141. Linked List Cycle (Easy) (cpp)

Leetcode 141. Linked List Cycle (Easy) (cpp) 

Tag: Linked List, Two Pointers

Difficulty: Easy

/*

141. Linked List Cycle (Easy)

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) {
        if (head == NULL) {
            return false;
        }
        ListNode *s = head, *f = head;
        while (f -> next != NULL && f -> next -> next != NULL) {
            s = s -> next;
            f = f -> next -> next;
            if (s == f) {
                return true;
            }
        }
        return false;
        
    }
};