[Leetcode] 160. 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.

思路：

这道题目的思路也比较简单：我们首先计算出链表A和链表B的长度。如果两者长度不同，则将长的那个链表的节点往后移动，使得它们分别距离自己的尾部的长度相同。接着只需要判断两个节点是否相同，一旦相同，则说明找到了两者相结合的部分，直接返回；否则分别向后移动，直到它们同时到达尾部。如果到达尾部的时候还没有发现它们相交，则返回NULL即可。整个算法的时间复杂度是O(n)，空间复杂度是O(1)，符合题目要求。

代码：

/**
 * 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 lengthA = 0, lengthB = 0;
        ListNode *nodeA = headA, *nodeB = headB;
        while (nodeA != NULL) {
            ++lengthA;
            nodeA = nodeA->next;
        }
        while (nodeB != NULL) {
            ++lengthB;
            nodeB = nodeB->next;
        }
        nodeA = headA, nodeB = headB;
        if (lengthA > lengthB) {
            while (lengthA > lengthB) {
                nodeA = nodeA->next;
                --lengthA;
            }
        }
        else {
            while (lengthB > lengthA) {
                nodeB = nodeB->next;
                --lengthB;
            }
        }
        while (nodeA != NULL) {
            if (nodeA == nodeB) {
                return nodeA;
            }
            nodeA = nodeA->next;
            nodeB = nodeB->next;
        }
        return NULL;
    }
};