思路

代码:

/**
 * 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) {
        ListNode * a = headA;
        ListNode * b = headB;
        while(a!=b)
        {
            if(a!=NULL)
            {
                a = a->next;
            }
            else
            {
                a = headB;
            }
            if(b!=NULL)
            {
                b=b->next;
            }
            else{
                b=headA;
            }
        }
        return b;

    }
};

标签：ListNode,int,next,链表,headB,headA,NULL,160,leetcode
来源： https://www.cnblogs.com/gcter/p/15338710.html