LeetCode：Intersection of Two Linked Lists

LeetCode：Intersection of Two Linked Lists

---

1、题目：
Write a program to find the node at which the intersection of two singly linked lists begins.
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.

---

2、代码：
链表题，表示我怎么想不到，我想到的只有哈希表。

Reference：
http://blog.csdn.net/litoupu/article/details/41555557

/**
 * 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&&headB)) return nullptr;//为空退出
        ListNode *pa=headA,*pb=headB;
        int countA=1,countB=1;
        while(pa->next||pb->next)
        {
            if(pa->next)
            {
                ++countA;
                pa=pa->next;
            }
            if(pb->next)
            {
                ++countB;
                pb=pb->next;
            }
        }
        if(pa!=pb)  return nullptr;//没有共同尾结点，退出
        int sub=abs(countA-countB);
        pa=headA,pb=headB;
        if(countA>countB)//长链表先跑
        {
            for(;sub;pa=pa->next,--sub);
        }
        else if(countA<countB)
        {
            for(;sub;pb=pb->next,--sub);
        }
        while(pa!=pb)//剩余相同长度遍历，返回第一个相同结点
        {
            pa=pa->next;
            pb=pb->next;
        }
        return pa;
    }
};

---

3、总结：
A、在求长度后可以顺便判断有没有公共尾结点。
B、要在相同长度时候开始一起同步遍历，才能找到。这样就需要先遍历长链表多余的结点。