合并两个有序链表
题目描述
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入: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:
if not l2: return l1
if not l1: return l2
listnode = ListNode(0)
head = listnode
while(l1 and l2):
if l1.val<l2.val:
listnode.next = l1
l1 = l1.next
listnode = listnode.next
else:
listnode.next = l2
l2 = l2.next
listnode = listnode.next
if not l1:
listnode.next = l2
else:
listnode.next = l1
return head.next
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/67e06321df58a9d7a0039300922e5848.png)
方法二:
# 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:
if not l2: return l1
if not l1: return l2
if l1.val<l2.val:
l1.next = self.mergeTwoLists(l1.next, l2)
return l1
else:
l2.next = self.mergeTwoLists(l1, l2.next)
return l2
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/f9efbdd45e5e39f9c5328f6f8f3f7dbe.png)