合并两个有序链表
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 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/leetbook/read/top-interview-questions-easy/xnnbp2/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
# 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, l1: ListNode, l2: ListNode) -> ListNode:
head = None
if l1==None:
return l2
if l2==None:
return l1
if l1.val>l2.val:
head = l2
l2 = l2.next
else:
head = l1
l1 = l1.next
t = head
while l1 and l2:
if l1.val>l2.val:
head.next = l2
l2 = l2.next
else:
head.next = l1
l1 = l1.next
head = head.next
while l1:
head.next = l1
l1 = l1.next
head = head.next
while l2:
head.next = l2
l2 = l2.next
head = head.next
return t
执行结果:
通过
显示详情
执行用时:40 ms, 在所有 Python3 提交中击败了85.94%的用户
内存消耗:14.8 MB, 在所有 Python3 提交中击败了80.08%的用户