1.题目描述
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
2.解法
解法一:前置节点
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
'''
1.链表的插入、删除
2.链表的遍历
3.返回链表的头指针
'''
head = ListNode(0)
pre = head
pre.next = l1
while l1 and l2:
if l1.val <= l2.val:
pre = pre.next
l1 = l1.next
else:
tmp = l2.next
pre.next = l2
l2.next = l1
l2 = tmp
pre = pre.next
if l2:
pre.next = l2
return head.next
解法二:递归解法
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
if not l1:
return l2
if not l2:
return l1
if l1.val < l2.val:
l1.next = self.mergeTwoLists(l1.next, l2)
return l1
else:
l2.next = self.mergeTwoLists(l1, l2.next)
return l2