时间轴

2026-03-13

init

题目：

P160 相交链表

https://leetcode.cn/problems/intersection-of-two-linked-lists/description/?envType=study-plan-v2&envId=top-100-liked

将自己的轨道和她的轨道对齐，总会相遇的~

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

#include <cstdlib>

struct ListNode {
        int val;
        ListNode *next;
        ListNode(int x)
                : val(x)
                , next(nullptr)
        {
        }
};

class Solution {
    public:
        ListNode *getIntersectionNode(ListNode *headA, ListNode *headB)
        {
                int linkA_len = 1, linkB_len = 1, offset;
                ListNode *p = headA, *q = headB;

                while (p->next != nullptr) {
                        p = p->next;
                        linkA_len++;
                }

                while (q->next != nullptr) {
                        q = q->next;
                        linkB_len++;
                }

                if (p != q) // 不是相交的两个链表
                        return nullptr;

                offset = std::abs(linkA_len - linkB_len);
                p = headA;
                q = headB;
                if (linkA_len > linkB_len) {
                        for (int i = 0; i < offset; i++)
                                p = p->next;

                } else {
                        for (int i = 0; i < offset; i++)
                                q = q->next;
                }

                while (p != q) {
                        p = p->next;
                        q = q->next;
                }
                return p;
        }
};