Time: 37 ms (68.92%), Space: 17.4 MB (36.58%) - LeetHub

Author: deepakkumar9546

0160-intersection-of-two-linked-lists/0160-intersection-of-two-linked-lists.cpp

@@ -0,0 +1,33 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode(int x) : val(x), next(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode* getIntersectionNode(ListNode* headA, ListNode* headB) {
+        if (headA == NULL || headB == NULL) {
+            return NULL;
+        }
+        ListNode* temp1 = headA;
+        ListNode* temp2 = headB;
+
+        while (temp1 != temp2) {
+            temp1 = temp1->next;
+            temp2 = temp2->next;
+            if (temp1 == temp2) {
+                return temp1;
+            }
+            if (temp1 == NULL) {
+                temp1 = headB;
+            }
+            if (temp2 == NULL) {
+                temp2 = headA;
+            }
+        }
+        return temp1;
+    }
+};