Solution Class Reference

Data Structures
struct	Comparator

Public Member Functions
ListNode *	mergeKLists (vector< ListNode * > &lists)

Detailed Description

Definition at line 17 of file main.cpp.

Member Function Documentation

mergeKLists()

ListNode * Solution::mergeKLists ( vector< ListNode * > &  lists )

inline

Definition at line 28 of file main.cpp.

    {
        if (lists.empty())
            return NULL;
        priority_queue<ListNode*, vector<ListNode*>, Comparator> min_heap;
        for (ListNode* head: lists)
        {
            if (head == NULL)
                continue;
            ListNode* current = head;
            while (current != NULL)
            {
                min_heap.push(current);
                current = current->next;
            }
        }
        if (min_heap.empty())
            return NULL;
        ListNode* head = min_heap.top();
        min_heap.pop();
        ListNode* current = head;
        while (!min_heap.empty())
        {
            current->next = min_heap.top();
            min_heap.pop();
            current = current->next;
        }
        current->next = NULL;
        return head;
    }

References ListNode::next.

---

The documentation for this class was generated from the following file:

• main.cpp