160 Intersection of Two Linked Lists

160 Intersection of Two Linked Lists

链接：https://leetcode.com/problems/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.
Credits:
Special thanks to @stellari for adding this problem and creating all test cases.

Hide Tags Linked List

这个问题是求解两个链表中的交叉点。可以这样理解，当两个链表中有交叉点时，交叉点之后的长度是一样长的。所以可以将较长链表移动到和较短链表一样长度时开始比较，若指针地址相等那么这个点位交叉点，否则都指向下一个点。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB) {
    struct ListNode *ptra=headA,*ptrb=headB,*ptraa=headA,*ptrbb=headB;

    while(ptra||ptrb)
    {
        if(ptra==NULL)
        {
            ptrbb=ptrbb->next;
            ptrb=ptrb->next;
        }
        else if(ptrb==NULL)
        {
            ptraa=ptraa->next;
            ptra=ptra->next;
        }
        else
        {
         ptrb=ptrb->next;
         ptra=ptra->next;
        }  
    }
    while(ptraa&&ptrbb)
    {
        if(ptraa==ptrbb)
            return ptraa;
       ptraa=ptraa->next;
       ptrbb=ptrbb->next;
    }
    return NULL;
}