合并两个有序链表 leetcode 21 Python

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

示例：

输入：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 l1:
            return l2
        if not l2:
            return l1
        if l1.val<=l2.val:
            l1.next=self.mergeTwoLists(l1.next,l2)
            return l1

        if l2.val<l1.val:
            l2.next=self.mergeTwoLists(l1,l2.next)
            return l2

普通解

class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        prehead=ListNode(-1)
        pred=prehead
        while l1 and l2:
            if l1.val<=l2.val:
                prehead.next=l1
                l1=l1.next
            else:
                prehead.next=l2
                l2=l2.next
            prehead=prehead.next
        prehead.next = l1 if l1  else l2 
        return pred.next