leetcode刷题 21. 合并两个有序链表

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 
示例 1：
输入：l1 = [1,2,4], l2 = [1,3,4]
输出：[1,1,2,3,4,4]
示例 2：
输入：l1 = [], l2 = []
输出：[]
示例 3：
输入：l1 = [], l2 = [0]
输出：[0]
 

提示：
```python
Definition for singly-linked list.
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next
class Solution:
    def mergeTwoLists(self, list1, list2):
        n1=[]
        n2=[]
        l1=list1
        l2=list2
        while True:
            if (not l1):
                break
            n1.append(l1.val)
            l1=l1.next
        while True:
            if (not l2):
                break
            n2.append(l2.val)
            l2=l2.next
        n=n1+n2
        n=list(sorted(n,reverse=True))
        result=ListNode()
        for i in n:
            result.val=i
            result=ListNode(next=result)
        result=result.next
        return result

Definition for singly-linked list.
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next
class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        if l1 is None:
            return l2
        elif l2 is None:
            return l1
        elif l1.val<l2.val:
            l1.next=self.mergeTwoLists(l1.next,l2)
            return l1
        else:
            l2.next=self.mergeTwoLists(l1,l2.next)
            return l2

class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        pre=ListNode(-1)#随便设一个头
        p=pre
        while l1 and l2:
            if l1.val<l2.val:
                p.next=l1
                l1=l1.next
            else:
                p.next=l2
                l2=l2.next
            p=p.next
        # 合并后 l1 和 l2 最多只有一个还未被合并完
        #我们直接将链表末尾指向未合并完的链表即可
        p.next=l1 if l1 is not None else l2
        return pre.next