160. Intersection of Two Linked Lists

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* pa=headA,*pb=headB;
        int la=0,lb=0;
        while(pa)
        {
            la++;
            pa=pa->next;
        }
        while (pb)
        {
            lb++;
            pb=pb->next;
        }

        pa=headA,pb=headB;
        while(la>lb)
        {
            pa=pa->next;
            la--;
        }
        while(lb>la)
        {
            pb=pb->next;
            lb--;
        }

        while(pa&&pb&&pa!=pb)
        {
            pa=pa->next;
            pb=pb->next;
        }
        if(pa==pb)
            return pa;
        return NULL;
    }
    
};