合并K个排序链表|博客系列

/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode[]} lists
 * @return {ListNode}
 */
var mergeKLists = function(lists) {
    if (!lists || lists.length <= 0) return null
    if (lists.length === 1) return lists[0]
    let currentList = lists[0]
    for (let i = 1; i < lists.length; i++) {
        currentList = mergeKList(currentList, lists[i])
    }
    return currentList
};
/**
* 合并两个链表
* @param {ListNode[]} 链表
* @return {ListNode}
*/
var mergeKList = function (l1, l2) {
    if (!l1) return l2
    if (!l2) return l1
    let newList = new ListNode(null)
    if (l1.val < l2.val) {
        newList.val = l1.val
        newList.next = mergeKList(l1.next, l2)
    } else {
        newList.val = l2.val
        newList.next = mergeKList(l1, l2.next)
    }
    return newList
}

/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode[]} lists
 * @return {ListNode}
 */
var mergeKLists = function(lists) {
    if (!lists || lists.length === 0) return null
    if (lists.length === 1) return lists[0]
    let collect = lists.reduce((allList, list) => {
        return allList.concat(transformListToArray(list))
    }, [])
    collect = collect.sort((a, b) => a - b);
    return transformArrayToList(collect)
};
// 将数组转化为链表
function transformArrayToList (arr) {
    let list = new ListNode(null)
    let node = list
    while (arr.length > 0) {
        node.next = new ListNode(arr.shift())
        node = node.next
    }
    return list.next
}
// 将链表转化为数组
function transformListToArray (node) {
    let arr = []
    while (node) {
        arr.push(node.val)
        node = node.next
    }
    return arr
}