[LintCode]104.合并k个排序链表

最新推荐文章于 2020-02-21 17:42:41 发布

温酒知莲华

最新推荐文章于 2020-02-21 17:42:41 发布

阅读量383

点赞数

分类专栏：数据结构二叉树文章标签：算法

本文链接：https://blog.csdn.net/zwy1258432405/article/details/78161309

版权

数据结构二叉树专栏收录该内容

27 篇文章 0 订阅

订阅专栏

合并k个排序链表，并且返回合并后的排序链表。尝试分析和描述其复杂度。

样例：给出3个排序链表[2->4->null,null,-1->null]，返回 -1->2->4->null

/**
 * Definition of ListNode
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param lists: a list of ListNode
     * @return: The head of one sorted list.
     */
    ListNode *mergeKLists(vector<ListNode *> &lists) {
        return partition(lists, 0, lists.size() - 1);
    }
    ListNode* partition(vector<ListNode*>& lists, int start, int end) {
        if(start == end) {
            return lists[start];
        }
        if(start < end) {
            int mid = (start + end) / 2;            
            ListNode* l1 = partition(lists, start, mid);
            ListNode* l2 = partition(lists, mid + 1, end);
            return mergeTwoLists(l1, l2);
        }       
        return NULL;
    }
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
        if(l1==NULL){ 
            return l2;  
        }else if(l2==NULL){  
            return l1;  
        }  
        ListNode *pMergeHead=NULL;  
        if(l1->val<l2->val){  
            pMergeHead=l1;  
            pMergeHead->next=mergeTwoLists(l1->next,l2);  
        }else{  
            pMergeHead=l2;  
            pMergeHead->next=mergeTwoLists(l1,l2->next);  
        }  
        return pMergeHead;  
    }
};

    ListNode *mergeKLists(vector<ListNode *> &lists) {
         int length = lists.size();
        if (length == 0)
            return NULL;
        while (lists.size() >1)
        {
            ListNode* p1 = lists.front ();
            lists.erase(lists.begin());
            ListNode* p2 = lists.front();
            lists.erase(lists.begin());
            lists.push_back(mergeTwoLists(p1, p2));
        }
        return lists[0];    
    }
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
        if(l1==NULL){ 
            return l2;  
        }else if(l2==NULL){  
            return l1;  
        }  
        ListNode *pMergeHead=NULL;  
        if(l1->val<l2->val){  
            pMergeHead=l1;  
            pMergeHead->next=mergeTwoLists(l1->next,l2);  
        }else{  
            pMergeHead=l2;  
            pMergeHead->next=mergeTwoLists(l1,l2->next);  
        }  
        return pMergeHead;  
    }