21. 合并两个有序链表

21. 合并两个有序链表

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。

示例 1：

输入：l1 = [1,2,4], l2 = [1,3,4]
输出：[1,1,2,3,4,4]

示例 2：

输入：l1 = [], l2 = []
输出：[]

示例 3：

输入：l1 = [], l2 = [0]
输出：[0]

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

# 递归
def mergeTwoLists(l1, l2):
	if not l1 or not l2:
		return l1 or l2
	if l1.val < l2.val:
		l1.next = mergeTwoLists(l1.next, l2)
		return l1
	else:
		l2.next = mergeTwoLists(l1, l2.next)
		return l2

def mergeTwoLists2(l1, l2):
	if not l1 or not l2:
		return l1 or l2

	l1_list = []
	while l1:
		l1_list.append(l1.val)
		l1 = l1.next

	l2_list = []
	while l2:
		l2_list.append(l2.val)
		l2 = l2.next

	total = l1_list + l2_list
	total.sort()

	head = ListNode(total[0])
	node = head
	for val in total[1:]:
		node.next =  ListNode(val)
		node = node.next
	return head