Merge k sorted lists

最新推荐文章于 2021-04-17 10:36:02 发布

sinat_26567963

最新推荐文章于 2021-04-17 10:36:02 发布

阅读量108

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/sinat_26567963/article/details/72973058

版权

LeetCode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

链表的使用以及递归的用法

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Wrong answer:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode merge2Lists(ListNode l1, ListNode l2){
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        if(l1.val <= l2.val){
            merge2Lists(l1.next, l2);
            return l1;
        }else{
            merge2Lists(l1, l2.next);
            return l2;
        }
    }
    public ListNode merge(ListNode[] lists, int left, int right){
        if(left == right) 
            return lists[right];
        else if(left < right){
            int mid = (left + right) / 2;
            ListNode l1 = merge(lists, left, mid);
            ListNode l2 = merge(lists, mid + 1, right);
            return merge2Lists(l1, l2);
        }else return null;
    }
    
    public ListNode mergeKLists(ListNode[] lists) {
        ListNode ans = merge(lists, 0, lists.length - 1);
        return ans;
    }
}

Correct:

public class Solution {
    public ListNode merge2Lists(ListNode l1, ListNode l2){
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        if(l1.val <= l2.val){
            l1.next = merge2Lists(l1.next, l2);
            return l1;
        }else{
            l2.next = merge2Lists(l1, l2.next);
            return l2;
        }
    }
    public ListNode merge(ListNode[] lists, int left, int right){
        if(left == right) 
            return lists[right];
        else if(left < right){
            int mid = (left + right) / 2;
            ListNode l1 = merge(lists, left, mid);
            ListNode l2 = merge(lists, mid + 1, right);
            return merge2Lists(l1, l2);
        }else return null;
    }
    
    public ListNode mergeKLists(ListNode[] lists) {
        ListNode ans = merge(lists, 0, lists.length - 1);
        return ans;
    }
}