题目描述

blablabla

样例

blablabla

算法1

(暴力枚举) $O(n^2)$

blablabla

时间复杂度分析：blablabla

Python 代码

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def merge(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        dummy = ListNode(-1)
        cur = dummy

        while l1 and l2:

            if l1.val <= l2.val:
                cur.next = l1
                l1 = l1.next

            elif l2.val < l1.val:
                cur.next = l2
                l2 = l2.next
            cur = cur.next

        cur.next = l1 if l1 is not None else l2

        return dummy.next