merge K sorted lists

leetcode 23
采用分治法和队列解决。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* merge2list(ListNode* list1,ListNode* list2)
    {
        if (list1 == NULL)
        {
            return list2;
        }
        if (list2 == NULL)
        {
            return list1;
        }
        ListNode *head = NULL;
        if(list1->val < list2->val)
        {
            head = list1;
            head->next = merge2list(head->next,list2);
        }
        else
        {
            head = list2;
            head->next = merge2list(head->next,list1);
        }
        return head;
    }
    ListNode* mergeKLists(vector<ListNode*>& lists) {
        if(lists.size() == 0)
            return NULL;
        queue<ListNode*> q;
        int i;
        for (i=0; i<lists.size(); i++)
        {
            q.push(lists[i]);
        }
        while(q.size() > 1)
        {
            ListNode *l1 = q.front();
            ListNode *l2 = NULL;
            q.pop();
            if(!q.empty())
            {
                l2 = q.front();
                q.pop();
            }
            q.push(merge2list(l2,l1));
        }
        ListNode * res = q.front();
        q.pop();
        return res;
    }
};

如果采用如下的方式，效果会慢很多哦。

ListNode *res =NULL;
int i;
for(i=0; i< lists.size()-1; i++)
{
    res = merge2list(res,lists[i]);
}
return res;