[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.

1、将两个链表合并遍历，相同的节点会在最后重合

2、分别遍历两个链表并记录长度，计算出长度差，然后再同时遍历两个链表，相同的节点在最后重合

我的代码是第一种

/**
 * 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;
        bool aFalg=true,bFalg=true;
        ListNode *aNode=headA,*bNode=headB;
        while(aNode&&bNode)
        {
            if(aNode==bNode)
                return aNode;
            else
            {
                aNode=aNode->next;
                bNode=bNode->next;
                if(aNode==NULL&aFalg)
                {
                    aFalg=false;
                    aNode=headB;
                }
                if(bNode==NULL&bFalg)
                {
                    bFalg=false;
                    bNode=headA;
                }
            }
        }
        return NULL;
    }
};