原题描述
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 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 均按 非递减顺序 排列
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解
class Solution:
def mergeTwoLists(self, list1: ListNode, list2: ListNode) -> ListNode:
tmp_head = ListNode(-1)
pre = tmp_head
while list1 or list2:
if not list1:
pre.next = list2
break
if not list2:
pre.next = list1
break
if list1.val <= list2.val:
next_list = list1.next
pre.next = list1
pre = pre.next
list1 = next_list
else:
next_list = list2.next
pre.next = list2
pre = pre.next
list2 = next_list
return tmp_head.next