Leetcode.23 合并K个升序链表

一、思路

题目说已经是排序好的链表，因此，只需要比较链表的头的val大小，当这个值是最小的时候，取出这个链表头，并将链表头变为next，当每个链表头都变为null的时候，终止循环

二、实现

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    int k;
    bool isend(vector<ListNode*>& lists) {
        for (int i = 0; i < k; ++i) {
            if (lists[i] != nullptr) {
                return false;
            }
        }
        return true;
    }
    ListNode* minlist(vector<ListNode*>& lists) {
        ListNode* ret = nullptr;
        int tem = INT_MAX;
        int tem_mark = 0;
        for (int i = 0; i < k; ++i) {
            if (lists[i] != nullptr && tem > lists[i] -> val) {
                ret = lists[i];
                tem = lists[i] -> val;
                tem_mark = i;
            }
        }
        lists[tem_mark] = lists[tem_mark] -> next;
        return ret;
    }

    ListNode* mergeKLists(vector<ListNode*>& lists) {
        k = lists.size();
        ListNode * begin = new ListNode(0);
        ListNode * cur = begin;
        while (!isend(lists)) {
            cur -> next = minlist(lists);
            cur = cur -> next;
        }
        return begin -> next;
    }
};