题目描述:
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
输入:l1 = [1,2,4], l2 = [1,3,4] 输出:[1,1,2,3,4,4]
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def mergeTwoLists(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
l=ListNode(-1)
hair=l
while l1 and l2:
if l1.val<l2.val:
l.next=l1
l1=l1.next
else:
l.next=l2
l2=l2.next
l=l.next
if l1:
l.next=l1
if l2:
l.next=l2
return hair.next