给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 1:
输入:lists = [[1,4,5],[1,3,4],[2,6]]
输出:[1,1,2,3,4,4,5,6]
解释:链表数组如下:
[ 1->4->5, 1->3->4, 2->6 ] 将它们合并到一个有序链表中得到。 1->1->2->3->4->4->5->6
示例 2:
输入:lists = []
输出:[]
示例 3:
输入:lists = [[]]
输出:[]
代码:
//递归写法,先两两链表合并
var mergeKLists = function (lists) {
let mergeTwoList = function (l1, l2) {
let preNode = new ListNode('0')
let head = preNode
while (l1 && l2) {
if (l1.val <= l2.val) {
preNode.next = l1
l1 = l1.next
} else {
preNode.next = l2
l2 = l2.next
}
preNode = preNode.next
}
preNode.next = l1 ? l1 : l2
return head.next
}
let cur = lists[0]
if (!lists.length) return null
for (let i = 1; i < lists.length; i++) {
if (lists[i]) {
cur = mergeTwoList(cur, lists[i])
}
}
return cur
}
// reduce+sort+reduceRight
var mergeKLists = function (lists) {
let listToArray = lists.reduce((p, n) => {
while (n) {
p.push(n)
n = n.next
}
return p
}, [])
return listToArray.sort((a, b) => a.val - b.val).reduceRight((p, n) => {
n.next = p
p = n
return p
}, null)
};