Intersection of Two Linked Lists

Catalogue：链表-双指针

Question

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.

Analysis

遍历两个链表，从而知道长度，从而知道比较两个链表的哪两个对应位置。

First try

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        int lenA = 0;
        int lenB = 0;
        int diff;
        ListNode* pA = headA;
        ListNode* pB = headB;
        
        while(pA!=NULL)
        {
            lenA++;
            pA = pA->next;
        }
        while(pB!=NULL)
        {
            lenB++;
            pB = pB->next;
        }
        pA = headA;
        pB = headB;
        
        if(lenA > lenB)
        {
            diff = lenA - lenB;
            while(diff)
            {
                pA = pA->next;
                diff--;
            }
        }
        else
        {
            diff = lenB - lenA;
            while(diff)
            {
                pB = pB->next;
                diff--;
            }
        }
        
        while(pA!=NULL && pA!=pB)
        {
            pA = pA->next;
            pB = pB->next;
        }
        return pA;
    }
};

Result: Accepted