[leetCode]Merge k Sorted Lists

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

外部排序的基础

 1 #include <iostream>
 2 #include<vector>
 3 using namespace std;
 4
 5 struct ListNode {
 6     int val;
 7     ListNode *next;
 8     ListNode(int x) : val(x), next(NULL) {}
 9 };
10 class Solution {
11 public:
12     static const int MAX = 9999;
13     ListNode *mergeKLists(vector<ListNode *> &lists) {
14         int listnum = checkListNum(lists);
15         ListNode *head,*tail;
16         head = tail = NULL;
17         while(listnum){
18             int index,min;
19             min = MAX;
20             index = 0;
21             for(int i = 0; i < lists.size();i++){
22                 if(lists[i] != NULL){
23                     if(lists[i]->val < min){
24                         min = lists[i]->val;
25                         index = i;
26                     }
27                 }
28             }
29             if(head == NULL){
30                 head = lists[index];
31                 tail = head;
32             }else{
33                 tail->next = lists[index];
34                 tail = tail->next;
35             }
36             lists[index] = lists[index]->next;
37             tail->next = NULL;
38             listnum = checkListNum(lists);
39         }
40         return head;
41     }
42     int checkListNum(vector<ListNode *> &lists){
43         int num = 0;
44         for(int i = 0; i < lists.size();i++){
45             if(lists[i] != NULL) num++;
46         }
47         return num;
48     }
49 };

转载于:https://www.cnblogs.com/marylins/p/3590328.html

[leetCode]Merge k Sorted Lists相关推荐

[leetcode] Merge k Sorted Lists
2019独角兽企业重金招聘Python工程师标准>>> Merge k sorted linked lists and return it as one sorted list. A ...
[LeetCode] Merge k Sorted Lists 合并k个有序链表
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. E ...
LeetCode Merge k Sorted Lists 解决报告
https://oj.leetcode.com/problems/merge-k-sorted-lists/ 归并K已经整理阵列,和分析算法的复杂. 解决报告:无论是不考虑优化,最简单的实现是要重新走 ...
LeetCode: Merge k Sorted Lists
自己写的太复杂了,一开始想的是给开始的lists头们排序,然后从这个序列的第一个抽出来,然后再重新用二分法进行排序,不过这个方法large超时了,看了网上的发现还是用很土地方法用一个for循环从前两个 ...
LeetCode Merge k Sorted Lists(有序单链表数组的合并)
题意:给出一个有序单链表数组,将其合并成一个有序单链表思路:将其转化成两个单链表合并的问题,用递归方式来实现代码如下: public class Solution {private ListNod ...
LeetCode 之 JavaScript 解答第23题 —— 合并K个有序链表（Merge K Sorted Lists）
Time:2019/4/10 Title: Merge K Sorted Lists Difficulty: Difficulty Author: 小鹿题目:Merge K Sorted Lists ...
21.Merge Two Sorted Lists 、23. Merge k Sorted Lists
21.Merge Two Sorted Lists 初始化一个指针作为开头,然后返回这个指针的next class Solution { public:ListNode* mergeTwoLists( ...
71. Merge k Sorted Lists
Merge k Sorted Lists Merge k sorted linked lists and return it as one sorted list. Analyze and descr ...
【LeetCode】【数组归并】Merge k Sorted Lists
描述 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity ...
合并k个有序链表 python_[LeetCode] 23. Merge k Sorted Lists 合并k个有序链表
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. E ...

[leetCode]Merge k Sorted Lists

[leetCode]Merge k Sorted Lists相关推荐

最新文章

热门文章