Add solution #160

Author: JoshCrozier

README.md

@@ -99,6 +99,7 @@
 149|[Max Points on a Line](./0149-max-points-on-a-line.js)|Hard|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
+160|[Intersection of Two Linked Lists](./0160-intersection-of-two-linked-lists.js)|Medium|
 167|[Two Sum II - Input Array Is Sorted](./0167-two-sum-ii-input-array-is-sorted.js)|Easy|
 169|[Majority Element](./0169-majority-element.js)|Easy|
 179|[Largest Number](./0179-largest-number.js)|Medium|

solutions/0160-intersection-of-two-linked-lists.js

@@ -0,0 +1,40 @@
+/**
+ * 160. Intersection of Two Linked Lists
+ * https://leetcode.com/problems/intersection-of-two-linked-lists/
+ * Difficulty: Medium
+ *
+ * Given the heads of two singly linked-lists headA and headB, return the
+ * node at which the two lists intersect. If the two linked lists have no
+ * intersection at all, return null.
+ *
+ * For example, the following two linked lists begin to intersect at node c1:
+ */
+
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+
+/**
+ * @param {ListNode} headA
+ * @param {ListNode} headB
+ * @return {ListNode}
+ */
+var getIntersectionNode = function(headA, headB) {
+  if (!headA || !headB) {
+    return null;
+  }
+
+  let a = headA;
+  let b = headB;
+
+  while (a !== b) {
+    a = a === null ? headB : a.next;
+    b = b === null ? headA : b.next;
+  }
+
+  return a;
+};