查找两个单向链表的交汇点

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.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        if (headA == NULL || headB == NULL)
        {
            return NULL;
        }

        ListNode *result = NULL;
        int sizeA = 0;
        ListNode *p = headA;
        while (p != NULL)
        {
            sizeA++;
            p = p->next;
        }

        int sizeB = 0;
        p = headB;
        while (p != NULL)
        {
            sizeB++;
            p = p->next;
        }
        p = headA;
        ListNode *q = headB;
        if (sizeA > sizeB)
        {
            int steps = sizeA - sizeB;
            while (steps > 0)
            {
                p = p->next;
                steps--;
            }
        }
        else
        {
            int steps = sizeB - sizeA;
            while (steps > 0)
            {
                q = q->next;
                steps--;
            }
        }

        while (p != NULL)
        {
            if (p == q)
            {
                return p;
            }
            p = p->next;
            q = q->next;
        }

        return NULL;
    }
};