Intersection of Two Linked Lists

Intersection of Two Linked Lists

 

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.

Credits:
Special thanks to @stellari for adding this problem and creating all test cases.

C语言代码：

struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB) {
   struct ListNode *p;
   struct ListNode *q;
   int lenA=0,lenB=0;
   p=headA;
   q=headB;
if(p==NULL||q==NULL)
    return 0;
    while(p)
    {
        p=p->next;
       lenA++;
            }
    while(q)
    {
    q=q->next;
    lenB++;
    }
    if(p!=q)
    return NULL;
    if(lenA<=lenB)
    {
        int n=lenB-lenA;
        p=headA;
        q=headB;
       while(n)
       {
           q=q->next;
           n--;
       }
           }
           else
           {
             int  n=lenA-lenB;
               p=headA;
               q=headB;
       while(n)
       {
           p=p->next;
           n--;
       } 
           }
    while(p!=q)
    {
       p=p->next;
       q=q->next;
    }
    return p;    
}