23. 合并K个升序链表
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-k-sorted-lists/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题目
给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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 = [[]]
输出:[]
提示:
k == lists.length
0 <= k <= 10^4
0 <= lists[i].length <= 500
-10^4 <= lists[i][j] <= 10^4
lists[i] 按 升序 排列
lists[i].length 的总和不超过 10^4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-k-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
1、两个升序链表合并的推广
思想
参考Leetcode21题思想,构造合并两个链表的函数
然后循环,链表vector,将目标链表与每一个链表进行合并即可得最终结果
https://blog.csdn.net/qq_34767784/article/details/106966962
C++代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* merge2Lists(ListNode *a, ListNode *b) {
ListNode *head = new ListNode(-1);
//此处不加new ListNode(-1)会一直报错:runtime error: member access within null pointer of type 'ListNode'
ListNode *tail = head;
ListNode *aptr = a, *bptr = b;
while(aptr != nullptr && bptr != nullptr){
if(aptr->val < bptr->val){
tail->next = aptr;
tail = tail->next;
aptr = aptr->next;
}
else{
tail->next = bptr;
tail = tail->next;
bptr = bptr->next;
}
}
while(aptr != nullptr){
tail->next = aptr;
aptr = aptr->next;
tail = tail->next;
}
while(bptr != nullptr){
tail->next = bptr;
bptr = bptr->next;
tail = tail->next;
}
return head->next;
}
ListNode* mergeKLists(vector<ListNode*>& lists) {
ListNode *res = nullptr;
if(lists.empty() || lists.size() == 0){
return nullptr;
}
for(size_t i = 0; i < lists.size(); i++){
res = merge2Lists(res, lists[i]);
}
return res;
}
};
Java代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode merge2Lists(ListNode a, ListNode b) {
ListNode head = new ListNode(-1);
ListNode tail = head, aptr = a, bptr = b;
while(aptr != null && bptr != null){
if(aptr.val <= bptr.val){
tail.next = aptr;
aptr = aptr.next;
}
else{
tail.next = bptr;
bptr = bptr.next;
}
tail = tail.next;
}
if(aptr != null){
tail.next = aptr;
}
else{
tail.next = bptr;
}
return head.next;
}
public ListNode mergeKLists(ListNode[] lists) {
if(lists.length == 0){
return null;
}
ListNode res = null; //注意此处的表头初始化得和两个表合并对表头的处理一致
for(int i = 0; i < lists.length; i++){
res = merge2Lists(res, lists[i]);
}
return res;
}
}
2、递归
思想
代码**