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.

感想：搞不清楚！！

基本思想：将这个问题转换为求链表中有没有出现环的问题。

/**
 * 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 *h1=headA,*h2=headB;
           while(h1!=h2){
               h1=h1?h1->next:headB;
               h2=h2?h2->next:headA;
           }
           return h1;
    }
};