feat: 141_linked_list_cycle

136_single_number/main.cpp

@@ -0,0 +1,13 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+   public:
+    int singleNumber(vector<int>& nums) {
+        int result = 0;
+        for (auto num : nums) {
+            result ^= num;
+        }
+        return result;
+    }
+};

141_linked_list_cycle/main.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct ListNode {
+    int val;
+    ListNode *next;
+    ListNode(int x) : val(x), next(NULL) {}
+};
+
+class Solution {
+   public:
+    bool hasCycle(ListNode *head) {
+        if (!head) return false;
+
+        ListNode *slowNode = head;
+        ListNode *fastNode = head->next;
+
+        while (fastNode && fastNode->next) {
+            if (slowNode == fastNode && fastNode) {
+                return true;
+            }
+
+            slowNode = slowNode->next;
+            fastNode = fastNode->next->next;
+        }
+
+        return false;
+    }
+};
+
+int main() {
+    ListNode *head = new ListNode(1);
+    head->next = new ListNode(2);
+
+    Solution().hasCycle(head);
+
+    return 0;
+}