141. Linked List Cycle using slow and fast pointer technique

erickcm2k · Dec 4, 2020 · 1b380b1 · 1b380b1
1 parent ec485d2
commit 1b380b1
Show file tree

Hide file tree

Showing 2 changed files with 27 additions and 0 deletions.
diff --git a/leetcode/linked-list/141-Linked-List-Cycle.cpp b/leetcode/linked-list/141-Linked-List-Cycle.cpp
@@ -0,0 +1,27 @@
+/**
+ * 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) {
+
+    ListNode *slow = head;
+    ListNode *fast = head;
+
+    while (slow && fast && fast->next)
+    {
+        slow = slow->next;
+        fast = fast->next->next;
+        if (slow == fast)
+        {
+            return true;
+        }
+    }
+    return false;
+    }
+};
diff --git a/leetcode/linked-list/a.out b/leetcode/linked-list/a.out