时间轴

2026-03-14

init

题目：

P24 两两交换链表中的节点

https://leetcode.cn/problems/swap-nodes-in-pairs/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
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */

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

class Solution {
    public:
        ListNode *swapPairs(ListNode *head)
        {
                ListNode *virtual_head = new ListNode(0, head);
                ListNode *prev = virtual_head, *curr = prev->next, *next, *next_next;

                while (curr) {
                        next = curr->next;
                        if (next == nullptr) // 单节点,不用交换
                                break;
                        next_next = next->next;
                        prev->next = next;
                        next->next = curr;
                        curr->next = next_next;
                        prev = curr;
                        curr = next_next;
                }

                head = virtual_head->next;
                delete virtual_head;
                return head;
        }
};