leetcode 160. 相交链表

/**
 * 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* p=headA;
        ListNode* q=headB;
        ListNode* p1;
        ListNode* q1;
        while(p)
        {
            if(p->next == NULL) p1=p;
            p=p->next;
        }
        while(q)
        {
            if(q->next == NULL) q1=q;
            q=q->next;
        }
        p=headA;
        q=headB;
        while(p!=q1 || q!=p1)
        {
            if(p == q) return p;
            if(p == p1) p=headB;
            else p=p->next;
            if(q == q1) q=headA;
            else q=q->next;
        }
        return p == q ? p:NULL;
    }
};