Leetcode/leetcode160.cpp at main · Zhangjsandy/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
 ListNode* pA = headA;
        ListNode* pB = headB;
        while(pA != pB){
            //±éÀúÊ±AÓëBÊÇ·ñÏà½»
            pA = pA == nullptr ? headB : pA->next;
            pB = pB == nullptr ? headA : pB->next;
        }
        return pA;
    }
};