时间轴

2025-11-19

init

题目：

P21 合并两个有序链表

https://leetcode.cn/problems/merge-two-sorted-lists/description/?envType=study-plan-v2&envId=top-interview-150

可以先创建一个头节点方便进行尾插法，最后再释放。

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
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 *mergeTwoLists(ListNode *list1, ListNode *list2)
	{
		// 创建一个头节点
		ListNode *list3_head = new ListNode;
		ListNode *p = list3_head;

		while (list1 != nullptr || list2 != nullptr) {
			if (list1 == nullptr && list2 != nullptr) {
				p->next = list2;
				list2 = list2->next;
				p = p->next;
				p->next = nullptr;
			} else if (list1 != nullptr && list2 == nullptr) {
				p->next = list1;
				list1 = list1->next;
				p = p->next;
				p->next = nullptr;
			} else if (list1 != nullptr && list2 != nullptr) {
				if (list1->val <= list2->val) {
					p->next = list1;
					list1 = list1->next;
					p = p->next;
					p->next = nullptr;
				} else {
					p->next = list2;
					list2 = list2->next;
					p = p->next;
					p->next = nullptr;
				}
			}
		}
		p = list3_head;
		list3_head = list3_head->next;
		delete p;
		return list3_head;
	}
};

leetcode hot100 rewrite

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
/**
 * 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 *mergeTwoLists(ListNode *list1, ListNode *list2)
        {
                ListNode *virtual_head = new ListNode;
                ListNode *tail = virtual_head, *p;

                while (list1 != nullptr || list2 != nullptr) {
                        if (list1 && list2)
                                tail->next = list1->val < list2->val ? list1 : list2;
                        else
                                tail->next = (list1 == nullptr) ? list2 : list1;

                        if (tail->next == list1)
                                list1 = list1->next;
                        if (tail->next == list2)
                                list2 = list2->next;

                        tail = tail->next;
                }

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