Leetcode-Daily-Challenge-/71_mergeksortedlist.cpp at main · coderbysoul/Leetcode-Daily-Challenge- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
//https://leetcode.com/problems/merge-k-sorted-lists/description/

/**
 * 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* mergeKLists(vector<ListNode*>& lists) {
        vector<int> temp;
        for(int i=0;i<lists.size();i++){
            ListNode* t= lists[i];
            if(t){
                while(t){
               temp.push_back(t->val);
                t=t->next;
            }
            }


        }
        sort(temp.begin(), temp.end());
        ListNode* ans=nullptr;
        ListNode*curr;
        for(int i=0;i<temp.size();i++){
            if(i==0){

                ans=new ListNode(temp[i]);
                curr=ans;
            }else{

                curr->next=new ListNode(temp[i]);
                curr=curr->next;
            }

        }


        return ans;

    }
};