题解 | 链表操作|#合并k个已排序的链表#

合并k个已排序的链表_牛客题霸_牛客网

两个有序链表合并的拓展，将k个链表逐个进行合并，虽然耗费资源较多但逻辑简单。注意考虑遍历完所有链表。

/**
 * struct ListNode {
 *  int val;
 *  struct ListNode *next;
 *  ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
#include <cstddef>
#include <vector>
class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param lists ListNode类vector
     * @return ListNode类
     */
    ListNode* mergeKLists(vector<ListNode*>& lists) {
        // write code here
        if (lists.size()==0) {
        return nullptr;
        }
        ListNode* l = lists[0];
        for (int i = 1; i < lists.size(); i++) {

            l = Merge(l, lists[i]);
        }
        return l;
    }

   ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        // write code here
 
        if (pHead1 == nullptr) {
            return pHead2;
        }
        if (pHead2 == nullptr) {
            return pHead1;
        }
        ListNode* r = pHead2;
        ListNode* l = new ListNode(0);
        l->next = pHead1;
 
        while (r!= nullptr) {
            ListNode* m1 = l;
            ListNode* m2 = l->next;
            int fla = 0;
            while (m2 != nullptr) {
                if (r->val <= m2->val) {
                    ListNode* item = new ListNode(0);
                    item->val = r->val;
                    item->next = m2;
                    m1->next = item;
                    fla ++;
                    break;
                }
                m1 = m1->next;
                m2 = m2->next;
            }
            if (fla == 0) {
                ListNode* item = new ListNode(0);
                item->val = r->val;
                m1->next = item;
            }
            r = r->next;
        }
        return l->next;
    }

};