LeetCode Merge k Sorted Lists

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

class Solution {
public:
	ListNode *mergeKLists(vector<ListNode *> &lists) {
		int k = lists.size();
		if (k == 0)
			return NULL;
		if (k == 1)
			return lists[0];

		ListNode head(0);                        //创建一个临时的表头
		ListNode *ptemp = &head;
	
		//如果链表为NULL，给其添加一个最大值的节点，用以维持堆结构
		for (int i = 0; i < k; i++) {
			if (lists[i] == NULL)       
				lists[i] = new ListNode(INT_MAX);
		}

		for (int i = (k - 2) / 2; i >= 0; i--)    //创建一个 最小堆
			FixDown(lists, i);

		while (lists[0]->val != INT_MAX) {      //如果最小节点的数值都为 INT_MAX，就结束循环
			ptemp->next = lists[0];             //将最小的节点添加到链表中
			ptemp = ptemp->next;
			
			//如果最小节点之后 链表为空，给其给其添加一个最大值的节点，用以维持堆结构
			if (lists[0]->next == NULL)         
				lists[0]->next = new ListNode(INT_MAX);
			lists[0] = lists[0]->next;
			FixDown(lists, 0);                   //向下更新堆
		}
		ptemp->next = NULL;
		return head.next;
	}

	void FixDown(vector<ListNode *> &lists, int i) {
		int len = lists.size();
		
		while (2 * i + 1 < len) {
			int j = 2 * i + 1;
			if (2 * i + 2 < len) {
				j = lists[j]->val < lists[j + 1]->val ? j : (j + 1);
			}
			if (lists[i]->val > lists[j]->val) {
				swap(lists[i], lists[j]);
			}
			i = j;
		}
	}
};