Time: 1 ms (99.92%), Space: 48.6 MB (62.92%) - LeetHub

Author: chau-nm

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

@@ -0,0 +1,25 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) {
+ *         val = x;
+ *         next = null;
+ *     }
+ * }
+ */
+public class Solution {
+    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+        if(headA == null || headB == null) return null;
+        
+        ListNode a = headA;
+        ListNode b = headB;
+        
+        while( a != b){
+            a = a == null? headB : a.next;
+            b = b == null? headA : b.next;    
+        }
+        return a;
+    }
+}