LeetCode --- 160. Intersection of Two Linked Lists

160. Intersection of Two Linked Lists

Difficulty: Easy

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

begin to intersect at node c1.

Example 1:

Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
Output: Reference of the node with value = 8
Input Explanation: The intersected node’s value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.```

Example 2:

Input: intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
Output: Reference of the node with value = 2
Input Explanation: The intersected node’s value is 2 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [0,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.

Example 3:

Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
Output: null
Input Explanation: From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values.
Explanation: The two lists do not intersect, so return null.

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.

Solution

思路1

简单的暴力方法，遍历headA将逐个节点的地址存入set中，然后遍历headB如果在set中找到headB中的地址，则返回该节点，找不到返回NULL。

Language: C++

/**
 * 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* la = headA, *lb = headB;
        set<ListNode*> s;
        while (la){
            s.insert(la);
            la = la->next;
        }
        while (lb){
            if (s.find(lb) != s.end())
                return lb;
            lb = lb->next;
        }
        return NULL;
    }
};

思路2

将两指针拼接成相同长度，然后进行判断。
相遇分两种情况:
原ListA与ListB无公共Node的情况下, 相遇于NewA与NewB的结尾, 是一个nullpointer;
原ListA与ListB有公共Node的情况下, 相遇于公共节点. 关于这一点, 需要回头看看NewA和NewB的尾部结构,
由于两个链表的拼接(分别成为NewA/NewB), NewA和NewB长度一致(lenA+lenB)且现在ListA和ListB已经是尾部对齐了, 两个指针同步向前移动, 一定会相遇与公共Node
Language：C++

/**
 * 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* la = headA, *lb = headB;
        while (la != NULL && lb != NULL && la != lb){
            la = la->next;
            lb = lb->next;
            if (la == lb) return la;
            if (la == NULL)  la = headB;
            if (lb == NULL)  lb = headA;
        }
        return la;		//结束循环la 和lb 地址相同，也可返回lb
    }
};

将上面代码使用三目运算改为5行：

ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
    ListNode *cur1 = headA, *cur2 = headB;
    while(cur1 != cur2){
        cur1 = cur1?cur1->next:headB;
        cur2 = cur2?cur2->next:headA;
    }
    return cur1;
}