Merge k Sorted Lists

本文介绍了一种通过分治策略合并K个有序链表的方法,最终返回一个有序链表。该方法首先将所有链表两两配对并进行合并,直至只剩下一个链表。此过程的时间复杂度为O(m*n*log(n))。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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

采用分治来做。两两合并链表,直到只剩下1个链表。时间复杂度为O(m*n*log(n)),而顺序合并的时间复杂度为O(m*n^2)。
Solution:
/**
 * 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) {
        if(lists.size()==0)
         return NULL;
       int size = lists.size();
       while(size>1)
       {
         for(int i=0;i<size/2;i++)
              mergeTwo(lists.at(i),lists.at(size-i-1));
         size = (size+1)/2;
        }
        return lists.at(0);
    }
private:
    void mergeTwo(ListNode *&n1,ListNode *&n2)
    {
         ListNode *p = (ListNode*)malloc(sizeof(ListNode)), *q = (ListNode*)malloc(sizeof(ListNode));
         p->next = n1;
         n1 = p;
         q->next = n2;
         n2 = q;
         while(NULL!=p->next&&NULL!=q->next)
         {
              while(NULL!=p->next&&p->next->val<q->next->val)p = p->next;
              ListNode *tmp = p->next;
              p->next = q->next;
              q->next = q->next->next;
              p->next->next = tmp;
              p = p->next;
         }
         if(NULL==p->next)
              p->next = q->next;
         free(n2);
         n2 = n1;
         n1 = n1->next;
         free(n2);
    }
};
To merge k sorted linked lists, one approach is to repeatedly merge two of the linked lists until all k lists have been merged into one. We can use a priority queue to keep track of the minimum element across all k linked lists at any given time. Here's the code to implement this idea: ``` struct ListNode { int val; ListNode* next; ListNode(int x) : val(x), next(NULL) {} }; // Custom comparator for the priority queue struct CompareNode { bool operator()(const ListNode* node1, const ListNode* node2) const { return node1->val > node2->val; } }; ListNode* mergeKLists(vector<ListNode*>& lists) { priority_queue<ListNode*, vector<ListNode*>, CompareNode> pq; for (ListNode* list : lists) { if (list) { pq.push(list); } } ListNode* dummy = new ListNode(-1); ListNode* curr = dummy; while (!pq.empty()) { ListNode* node = pq.top(); pq.pop(); curr->next = node; curr = curr->next; if (node->next) { pq.push(node->next); } } return dummy->next; } ``` We start by initializing a priority queue with all the head nodes of the k linked lists. We use a custom comparator that compares the values of two nodes and returns true if the first node's value is less than the second node's value. We then create a dummy node to serve as the head of the merged linked list, and a current node to keep track of the last node in the merged linked list. We repeatedly pop the minimum node from the priority queue and append it to the merged linked list. If the popped node has a next node, we push it onto the priority queue. Once the priority queue is empty, we return the head of the merged linked list. Note that this implementation has a time complexity of O(n log k), where n is the total number of nodes across all k linked lists, and a space complexity of O(k).
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值