合并k个已排序的链表

合并k个已排序的链表

题目描述

合并 k 个已排序的链表并将其作为一个已排序的链表返回。分析并描述其复杂度。

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
import java.util.*;
public class Solution {
    public ListNode mergeKLists(ArrayList<ListNode> lists) {
        if(lists == null || lists.size() < 1) return null;
        if(lists.size()==1) return lists.get(0);
        //偶数合并
        if(lists.size()%2 == 1) lists.add(null);
        
        int n = lists.size();
        ArrayList<ListNode> sum = new ArrayList<ListNode>();
        for(int i=0; i<n; i+=2){
            sum.add( mergeTwo(lists.get(i), lists.get(i+1)) );
        }
        
        return mergeKLists(sum);
    }
    //空头节点合并
    public ListNode mergeTwo(ListNode l1, ListNode l2){
        ListNode head = new ListNode(-1);
        ListNode tmp = head;
        while(l1!=null && l2!=null){
            if(l1.val < l2.val){
                tmp.next = l1;
                l1 = l1.next;
            }else{
                tmp.next = l2;
                l2 = l2.next;
            }
            tmp = tmp.next;
        }
        tmp.next = (l1==null)? l2 : l1;
        return head.next;
    }
}