题目:
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
来源:力扣(LeetCode)
链接:力扣
示例:
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例 2:输入:l1 = [], l2 = []
输出:[]
示例 3:输入:l1 = [], l2 = [0]
输出:[0]
解法:
遍历两个链表,把小的添加到结果链表中。
代码:
# 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]: if list1 is None and list2 is None: return None elif list1 is None: return list2 elif list2 is None: return list1 head = list3 = ListNode(-101) while list1 or list2: if list1 is None: list3.next = list2 break elif list2 is None: list3.next = list1 break else: if list1.val < list2.val: list3.next = list1 list1 = list1.next else: list3.next = list2 list2 = list2.next list3 = list3.next return head.next