Leetcode Problem 1834. Single-Threaded CPU

1834. Single-Threaded CPU

Leetcode Solutions

Sorting and Min-Heap Approach

  1. Create a list sortedTasks that includes each task with its original index.
  2. Sort sortedTasks based on enqueue time.
  3. Initialize currTime to 0 and an empty min-heap nextTask.
  4. Iterate while there are tasks in sortedTasks or nextTask. a. If nextTask is empty and the next task's enqueue time is greater than currTime, update currTime to the next task's enqueue time. b. Add all tasks available at currTime to nextTask. c. Pop the task with the shortest processing time from nextTask, process it, and add its index to the result. d. Increment currTime by the processing time of the processed task.
  5. Return the result containing the order of processed tasks.
UML Thumbnail

Brute Force Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...