Last active
October 9, 2015 12:39
-
-
Save ssinganamalla/6923d35e11b194d4e4b6 to your computer and use it in GitHub Desktop.
Intersection of two linkedlists
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/*Write a program to find the node at which the intersection of two singly linked lists begins. | |
For example, the following two linked lists: | |
A: a1 → a2 | |
↘ | |
c1 → c2 → c3 | |
↗ | |
B: b1 → b2 → b3 | |
begin to intersect at node c1. | |
Notes: | |
If the two linked lists have no intersection at all, return null. | |
The linked lists must retain their original structure after the function returns. | |
You may assume there are no cycles anywhere in the entire linked structure. | |
Your code should preferably run in O(n) time and use only O(1) memory. | |
*/ | |
/** | |
* 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; | |
if (headA == headB) return headA; | |
int nA = countList(headA); | |
int nB = countList(headB); | |
if ((nA - nB) > 0) { | |
return findIntersectionNode(headA, headB, nA - nB); | |
} else { | |
return findIntersectionNode(headB, headA, nB - nA); | |
} | |
} | |
//returns the length of the linkedlist | |
private int countList(ListNode head) { | |
ListNode current = head; | |
int count = 0; | |
while(current != null) { | |
current = current.next; | |
count++; | |
} | |
return count; | |
} | |
private ListNode findIntersectionNode(ListNode xNode, ListNode yNode, int diff) { | |
ListNode currentY = yNode; | |
ListNode currentX = xNode; | |
//x has diff more nodes | |
if (diff > 0) { | |
for ( int i = 0; i < diff; i++ ) { | |
currentX = currentX.next; | |
} | |
} | |
if (currentX == currentY) { | |
return currentX; | |
} | |
ListNode intersectAt = null; | |
while (currentX != null || currentY != null) { | |
if (currentX.next == currentY.next) { | |
intersectAt = currentX.next; | |
break; | |
} | |
currentX = currentX.next; | |
currentY = currentY.next; | |
} | |
return intersectAt; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment