题解 | #牛群的合并#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param lists ListNode类一维数组 
     * @return ListNode类
     */
    public ListNode mergeKLists (ListNode[] lists) {
        // write code here
        ListNode result = null;
        List<Integer> valList = new ArrayList<>();
        for(int i = 0;i < lists.length;i++){
            while(lists[i] != null){
                valList.add(lists[i].val);
                lists[i] = lists[i].next;
            }
        }

        valList.sort(Comparator.reverseOrder());
        for(int j = 0;j < valList.size();j++){
            ListNode temp = new ListNode(valList.get(j));
            temp.next = result;
            result = temp;
        }
    return result;
    }
}