In this post I will be solving LeetCode 160 Intersection of Two Linked Lists using the Java programming language.
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. Custom Judge: The inputs to the judge are given as follows (your program is not given these inputs): o intersectVal - The value of the node where the intersection occurs. This is 0 if there is no intersected node. o listA - The first linked list. o listB - The second linked list. o skipA - The number of nodes to skip ahead in listA (starting from the head) to get to the intersected node. o skipB - The number of nodes to skip ahead in listB (starting from the head) to get to the intersected node. The judge will then create the linked structure based on these inputs and pass the two heads, headA and headB to your program. If you correctly return the intersected node, then your solution will be accepted. Constraints: o The number of nodes of listA is in the m. o The number of nodes of listB is in the n. o 1 <= m, n <= 3 * 104 o 1 <= Node.val <= 105 o 0 <= skipA < m o 0 <= skipB < n o intersectVal is 0 if listA and listB do not intersect. o intersectVal == listA[skipA] == listB[skipB] if listA and listB intersect. Related Topics: * Hash Table o Linked List * Two Pointers Follow up: * Could you write a solution that runs in O(m + n) time and use only O(1) memory?
If interested I suggest you get the current description from LeetCode before you start coding. Continue reading “LeetCode 160 Intersection of Two Linked Lists in Java”