题目
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4 输出:1->1->2->3->4->4
方法一
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
res=ListNode(0)
ans=res
while(l1 != None and l2 != None):
if l1.val > l2.val:
ans.next=ListNode(l2.val)
l2 = l2.next
else:
ans.next=ListNode(l1.val)
l1=l1.next
ans=ans.next
while(l1 != None):
ans.next=ListNode(l1.val)
ans=ans.next
l1=l1.next
while(l2 != None):
ans.next=ListNode(l2.val)
ans=ans.next
l2=l2.next
return res.next