intersection of two linked list

Author: fishercoder1534

EASY/src/easy/IntersectionofTwoLinkedLists.java

@@ -0,0 +1,37 @@
+package easy;
+
+import classes.ListNode;
+
+public class IntersectionofTwoLinkedLists {
+    /**Looked at this post: https://discuss.leetcode.com/topic/5492/concise-java-solution-o-1-memory-o-n-time*/
+
+    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+        int lenA = findLen(headA), lenB = findLen(headB);
+        while (lenA < lenB){
+            headB = headB.next;
+            lenB--;
+        }
+        
+        while (lenB < lenA){
+            headA = headA.next;
+            lenA--;
+        }
+        
+        while (headA != headB){
+            headA = headA.next;
+            headB = headB.next;
+        }
+        
+        return headA;
+    }
+    
+    private int findLen(ListNode head){
+        int len = 0;
+        while (head != null){
+            head = head.next;
+            len++;
+        }
+        return len;
+    }
+
+}

README.md

@@ -86,6 +86,7 @@
 |165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)|[Solution](../../blob/master/EASY/src/easy/CompareVersionNumbers.java)| O(n)|O(1) | Easy|
 |162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/)|[Solution](../../blob/master/MEDIUM/src/medium/FindPeakElement.java) | O(1) |O(logn)/O(n) | Binary Search|
 |161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)|[Solution](../../blob/master/MEDIUM/src/medium/OneEditDistance.java) | O(n) |O(1) | |
+|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)|[Solution](../../blob/master/EASY/src/easy/IntersectionofTwoLinkedLists.java)| O(m+n)|O(1) | Easy| Linked List
 |157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/)|[Solution](../../blob/master/EASY/src/easy/ReadNCharactersGivenRead4.java)| O(n)|O(1) | Easy| 
 |155|[Min Stack](https://leetcode.com/problems/min-stack/)|[Solution](../../blob/master/EASY/src/easy/MinStack.java)| O(1)|O(n) | Easy| Stack
 |151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)|[Solution](../../blob/master/MEDIUM/src/medium/ReverseWordsinaString.java)| O(n)|O(n) | Medium|