@@ -0,0 +1,926 @@
+package leetcode.intersection_of_two_linked_lists;%0A%0Aimport common.ListNode;%0A%0Apublic class Solution %7B%0A    public ListNode getIntersectionNode(ListNode headA, ListNode headB) %7B%0A        if(headA == null %7C%7C headB == null)%7B%0A        %09return null;%0A        %7D%0A        if(headA == headB)%0A        %09return headA;%0A        ListNode endA = headA, endB = headB;%0A        while(endA.next != null)%0A        %09endA = endA.next;%0A        while(endB.next != null)%0A        %09endB = endB.next;%0A        if(endA != endB)%0A        %09return null;%0A        ListNode end = endA;%0A        end.next = headA;%0A        ListNode tortoise = headB.next, hare = headB.next.next;%0A        while(tortoise != hare)%7B%0A        %09tortoise = tortoise.next;%0A        %09hare = hare.next.next;%0A        %7D%0A        hare = headB;%0A        while(hare != tortoise)%7B%0A        %09hare = hare.next;%0A        %09tortoise = tortoise.next;%0A        %7D%0A        end.next = null;%0A        return tortoise;%0A    %7D%0A%7D

Add java solution for 160. Intersection of Two Linked Lists