23. 合并K个升序链表
给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* merge(struct ListNode* list1, struct ListNode* list2){
struct ListNode merlist, * cur = &merlist;
struct ListNode * plist1 = list1, * plist2 = list2;
while (plist1 && plist2){
if (plist1->val < plist2->val){
cur->next = plist1;
plist1 = plist1->next;
}else{
cur->next = plist2;
plist2 = plist2->next;
}
cur = cur->next;
}
cur->next = plist1 ? plist1 : plist2;
return merlist.next;
}
struct ListNode* mergeLists(struct ListNode** lists, int start, int end){
if (start > end)
return NULL;
if (start == end)
return lists[start];
int middle = (start + end) / 2;
return (merge(mergeLists(lists, start, middle), mergeLists(lists, middle + 1, end)));
}
struct ListNode* mergeKLists(struct ListNode** lists, int listsSize){
return mergeLists(lists, 0, listsSize - 1);
}