题目描述:
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
解题思路:
# 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:
if l1 is None:
return l2
if l2 is None:
return l1
l1, l2 = (l1, l2) if l1.val <= l2.val else (l2, l1)
output = l1
while(l1 and l2):
if l1.val <= l2.val:
p = l1
l1 = l1.next
else:
p.next = l2
l2 = l2.next
p.next.next = l1
p = p.next
if l1:
return output
else:
p.next = l2
return output
性能: