进阶题解：链表相交，吊打代码随想录

随想录解法：

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* curA = headA;
        ListNode* curB = headB;
        int lenA = 0, lenB = 0;
        while (curA != NULL) { // 求链表A的长度
            lenA++;
            curA = curA->next;
        }
        while (curB != NULL) { // 求链表B的长度
            lenB++;
            curB = curB->next;
        }
        curA = headA;
        curB = headB;
        // 让curA为最长链表的头，lenA为其长度
        if (lenB > lenA) {
            swap (lenA, lenB);
            swap (curA, curB);
        }
        // 求长度差
        int gap = lenA - lenB;
        // 让curA和curB在同一起点上（末尾位置对齐）
        while (gap--) {
            curA = curA->next;
        }
        // 遍历curA 和 curB，遇到相同则直接返回
        while (curA != NULL) {
            if (curA == curB) {
                return curA;
            }
            curA = curA->next;
            curB = curB->next;
        }
        return NULL;
    }
};

我的解法;结构清晰，易读性高

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        int la = getLen(headA);
        int lb = getLen(headB);
        if(la>lb) return getInterNode(la-lb,headA,headB);
        else return getInterNode(lb-la,headB,headA);
    }
    int getLen(ListNode* head){
        int len = 0;
        while(head){
            len++;
            head = head->next;
        }
        return len;
    }
    ListNode* getInterNode(int gap,ListNode *Llong, ListNode *Lshort){
        while(gap--){
            Llong = Llong->next;
        }
        while(Llong){
            if(Lshort == Llong)return Llong;
            Llong = Llong->next;
            Lshort = Lshort->next;
        }
        return nullptr;
    }

};