160. Intersection of Two Linked List（unsolved）

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两个链表每次走一步，若A走完则A转到B头结点，B走完就走到A头结点。相当于走两轮，假如在第二轮走完后还没碰到，那么就是null了，因为两者走的路程将会是一样。假如是有交叉点的，那么将会在第一轮或者第二轮碰到。上面实例中的是第二轮碰到。

另一种方法，假如题目允许改变链表结构的话，那么B每走到一个节点都把上一个节点指向A的头，直到B走完。让A走，假如A走回到A链表的头的话，那么就是有交叉点，假如A走到了null的话那么就是无交叉点，因为A中本来是没有环的。

/**
 * 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 *headB_origin=headB;
        ListNode *headA_origin=headA;
        bool labelA=false,labelB=false;
        while(headA!=headB)
        {
            if(headA->next!=NULL)  
                headA=headA->next;
            else  
            {
                if(labelA==false)
                {
                    headA=headB_origin;
                    labelA=true;
                }
                else
                {
                    headA=headA->next;
                }
            }


            if(headB->next!=NULL)  
                headB=headB->next;
            else 
            {
                if(labelB==false)
                {
                    headB=headA_origin;
                    labelB=true;
                }
                else
                {
                    headB=headB->next;
                }
            }
            if(headA==headB) 
                return headB;
            if(headA==NULL||headB==NULL) 
                return NULL; 
        }


        return headA;

    }
};