struct node* intersection( struct node *pL1, struct node* pL2)
{
if ((!pL1) || (!pl2)) return NULL;
struct node * pL3 = NULL;
struct node* pL3Tail = NULL;
while(pL1)(pL2) {
if (pL1-data pL2-data) pL1=pL1-next;
else if (pL1-data pL2-data) pL2=pL2-next;
else {
struct
@nishant, you wrote until both the distance becomes equal.Which distances
? Could you please elaborate ?
On Thu, Jul 5, 2012 at 12:52 PM, Ashish Goel ashg...@gmail.com wrote:
struct node* intersection( struct node *pL1, struct node* pL2)
{
if ((!pL1) || (!pl2)) return NULL;
struct node
Hope the following will be of help:
http://www.geeksforgeeks.org/archives/18615
regds.
On Thu, Jul 5, 2012 at 4:32 PM, Abhishek Sharma abhi120...@gmail.comwrote:
@nishant, you wrote until both the distance becomes equal.Which
distances ? Could you please elaborate ?
On Thu, Jul 5, 2012 at
both the distance means distance between the two linked list some thing
like this :
struct node *temp1,*temp2;
temp1 = head1;
temp2 = head2;
int l1 = get_dist(head1);
int l2 = get_dist(head2);
int ds = abs(l1-l2);
if( l1 l2 )
{
for(int i=0;ids;i++)
{
Any efficient algorithm to find intersection of two linked lists.Example:
Linked List 1) 1 - 2 - 3 - 4 - 5 - 6
Linked List 2) 3 - 4 - 5
Intersection 4 - 5 - 6
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the
it was 4 - 5, not 4 - 5 - 6
On Wed, Jul 4, 2012 at 10:41 PM, Abhi abhi120...@gmail.com wrote:
Any efficient algorithm to find intersection of two linked lists.Example:
Linked List 1) 1 - 2 - 3 - 4 - 5 - 6
Linked List 2) 3 - 4 - 5
Intersection 4 - 5 - 6
--
You received this message
3 - 4 - 5, sorry for that silly mistakes
On Wed, Jul 4, 2012 at 10:54 PM, Abhishek Sharma abhi120...@gmail.comwrote:
it was 4 - 5, not 4 - 5 - 6
On Wed, Jul 4, 2012 at 10:41 PM, Abhi abhi120...@gmail.com wrote:
Any efficient algorithm to find intersection of two linked lists.Example:
get the size of both the linked list say d1,d2 ;
get their diff like df=abs(d1-d2);
now take 2 pointers both poiting to the start of both the linked list .
go to bigger list now move this pointer until both the distance becomes
equal .
at this point we have one pointer from smaller list pointing
