题目来源:合并两个有序链表
在bilibili上的视频讲解:更新中
题目描述
将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例 2:
输入:l1 = [], l2 = []
输出:[]
示例3:
输入:l1 = [], l2 = [0]
输出:[0]
提示:
- 两个链表的节点数目范围是 [0, 50]
- -100 <= Node.val <= 100
- l1 和 l2 均按 非递减顺序 排列
解题思路
思路步骤
step1:定义一个虚拟头节点empty和一个cur指针
- cur指向empty,cur表示合并后链表的尾节点
step2:合并操作
-
比较head1与head2的val值
-
cur的next指向val值小的节点,例如如果head1.val小于head2.val,cur.next指向head1
-
值小的那个链表的头节点向后移动一位,例如如果head1.val小于head2.val,head1向后移动一位(head1 = head1.next)
-
cur向后移动一位
step3:循环重复step2,直到某个链表为空,结束循环
step4:拼接上剩余的链表,cur的next指向还剩余的链表,返回empty.next
思路动画
代码
Python代码
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
empty = ListNode()
cur = empty
while list1 and list2:
if list1.val > list2.val:
cur.next = list2
list2 = list2.next
else:
cur.next = list1
list1 = list1.next
cur = cur.next
if list1:
cur.next = list1
else:
cur.next = list2
return empty.next
C++代码
/**
* 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) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
ListNode* empty = new ListNode(0); // 新建一个空节点作为头结点
ListNode* cur = empty;
while (list1 && list2) {
if (list1->val > list2->val) {
cur->next = list2;
list2 = list2->next;
} else {
cur->next = list1;
list1 = list1->next;
}
cur = cur->next;
}
if (list1) {
cur->next = list1;
} else {
cur->next = list2;
}
return empty->next;
}
};
Java代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
ListNode empty = new ListNode(); // 新建一个空节点作为头结点
ListNode cur = empty;
while (list1 != null && list2 != null) {
if (list1.val > list2.val) {
cur.next = list2;
list2 = list2.next;
} else {
cur.next = list1;
list1 = list1.next;
}
cur = cur.next;
}
if (list1 != null) {
cur.next = list1;
} else {
cur.next = list2;
}
return empty.next;
}
}