首页 > itarticle > 算法笔记: 力扣#21 合并两个有序链表

算法笔记: 力扣#21 合并两个有序链表

admin 11月 12, 2020 0

问题描述

解法

分析

Python 实现

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class :
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if l1 is None:
            return l2
        if l2 is None:
            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

Java 实现

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class  {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null){ return l2; }
        if(l2 == null){ return l1; }
        if(l1.val < l2.val){
            l1.next = mergeTwoLists(l1.next, l2);
            return l1;
        }else{
            l2.next = mergeTwoLists(l1, l2.next);
            return l2;
        }
    }
}

时间复杂度

O(m+n).

空间复杂度

O(m+n).

链接

21. Merge Two Sorted Lists
21. 合并两个有序链表
 (English version) Algorithm Notes: Leetcode#21 Merge Two Sorted Lists