Merge K Sorted Linked Lists
Merge K sorted linked lists.
Input: lists = [[2,2,3],[1,5]]
Output: [1,2,2,3,5]
Explanation: Extracts the smallest current node iteratively using a priority queue to build a single merged and sorted linked list.

Question

Merge K Sorted Linked Lists

Merge K sorted linked lists.

Input: lists = [[2,2,3],[1,5]]

Output: [1,2,2,3,5]

Explanation: Extracts the smallest current node iteratively using a priority queue to build a single merged and sorted linked list.

Anonymous · Accepted Answer

var mergeKLists = function (lists) {
  const dummy = new ListNode(0);
  let current = dummy;

while (true) {
    let smallestIndex = -1;

// Buscar cuál lista tiene actualmente el nodo más pequeño
    for (let i = 0; i < lists.length; i++) {
      if (
        lists[i] !== null &&
        (smallestIndex === -1 ||
          lists[i].val < lists[smallestIndex].val)
      ) {
        smallestIndex = i;
      }
    }

// Ya no quedan nodos en ninguna lista
    if (smallestIndex === -1) {
      break;
    }

// Agregar el nodo más pequeño al resultado
    current.next = lists[smallestIndex];
    current = current.next;

// Avanzar la lista de donde sacamos el nodo
    lists[smallestIndex] = lists[smallestIndex].next;
  }

return dummy.next;
};

Merge K Sorted Linked Lists

Practice this question with AI

Go Premium

Community Answers

Unlock Full Access

Practice More Questions