[Leetcode 50] 23 Merge K Sorted Lists

Problem:

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

 

Analysis:

Since each list is sorted, the second element won't be merged into the final list until the first element is merged. So we can scan the head of each list and find the minimum element to merge into the final result. Note how to process those empty list and when to exit the scan phase.

 

Code:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *mergeKLists(vector<ListNode *> &lists) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (lists.size() == 0) return NULL;
        
        ListNode *head=NULL, *cur=NULL;
        int  minIdx;
        while (true) {
            minIdx = -1;
            for (int i=0; i<lists.size(); i++) {
                if (lists[i] != NULL) {
                    if (minIdx == -1) 
                        minIdx = i;
                    else if (lists[i]->val < lists[minIdx]->val) {
                        minIdx = i;
                    }
                }
            }
            
            if (minIdx == -1) break; //all list are NULL;
            
            if (head == NULL) {
                head = lists[minIdx];
                cur = lists[minIdx];
            } else {
                cur->next = lists[minIdx];
                cur = cur->next;
            }
            
            lists[minIdx] = lists[minIdx]->next;
        }
        
        return head;
    }
};