René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/single-threaded-cpu","name":"#1834 - Single-Threaded CPU - LeetCode JavaScript Solutions","description":"You are given n tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTimei, processingTimei] mean...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[][]} tasks\n * @return {number[]}\n */\nvar getOrder = function(tasks) {\n  const indexedTasks = tasks.map(([enqueue, process], index) => ({ enqueue, process, index }))\n    .sort((a, b) => a.enqueue - b.enqueue);\n\n  const result = [];\n  const availableTasks = new PriorityQueue((a, b) => a.process - b.process || a.index - b.index);\n  let currentTime = indexedTasks[0].enqueue;\n  let taskIndex = 0;\n\n  while (result.length < tasks.length) {\n    while (taskIndex < tasks.length && indexedTasks[taskIndex].enqueue <= currentTime) {\n      availableTasks.push(indexedTasks[taskIndex]);\n      taskIndex++;\n    }\n\n    if (availableTasks.size() > 0) {\n      const task = availableTasks.pop();\n      result.push(task.index);\n      currentTime += task.process;\n    } else {\n      currentTime = indexedTasks[taskIndex].enqueue;\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 1834, #1834 - Single-Threaded CPU, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}