LeetCode 1834. Single-Threaded CPU

原题链接在这里：https://leetcode.com/problems/single-threaded-cpu/description/

题目：

You are given n​​​​​​ tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTimei, processingTimei] means that the i​​​​​​th​​​​ task will be available to process at enqueueTimei and will take processingTimei to finish processing.

You have a single-threaded CPU that can process at most one task at a time and will act in the following way:

• If the CPU is idle and there are no available tasks to process, the CPU remains idle.
• If the CPU is idle and there are available tasks, the CPU will choose the one with the shortest processing time. If multiple tasks have the same shortest processing time, it will choose the task with the smallest index.
• Once a task is started, the CPU will process the entire task without stopping.
• The CPU can finish a task then start a new one instantly.

Return the order in which the CPU will process the tasks. 

Example 1:

Input: tasks = [[1,2],[2,4],[3,2],[4,1]]
Output: [0,2,3,1]
Explanation: The events go as follows: 
- At time = 1, task 0 is available to process. Available tasks = {0}.
- Also at time = 1, the idle CPU starts processing task 0. Available tasks = {}.
- At time = 2, task 1 is available to process. Available tasks = {1}.
- At time = 3, task 2 is available to process. Available tasks = {1, 2}.
- Also at time = 3, the CPU finishes task 0 and starts processing task 2 as it is the shortest. Available tasks = {1}.
- At time = 4, task 3 is available to process. Available tasks = {1, 3}.
- At time = 5, the CPU finishes task 2 and starts processing task 3 as it is the shortest. Available tasks = {1}.
- At time = 6, the CPU finishes task 3 and starts processing task 1. Available tasks = {}.
- At time = 10, the CPU finishes task 1 and becomes idle.

Example 2:

Input: tasks = [[7,10],[7,12],[7,5],[7,4],[7,2]]
Output: [4,3,2,0,1]
Explanation: The events go as follows:
- At time = 7, all the tasks become available. Available tasks = {0,1,2,3,4}.
- Also at time = 7, the idle CPU starts processing task 4. Available tasks = {0,1,2,3}.
- At time = 9, the CPU finishes task 4 and starts processing task 3. Available tasks = {0,1,2}.
- At time = 13, the CPU finishes task 3 and starts processing task 2. Available tasks = {0,1}.
- At time = 18, the CPU finishes task 2 and starts processing task 0. Available tasks = {1}.
- At time = 28, the CPU finishes task 0 and starts processing task 1. Available tasks = {}.
- At time = 40, the CPU finishes task 1 and becomes idle.

Constraints:

• tasks.length == n
• 1 <= n <= 105
• 1 <= enqueueTimei, processingTimei <= 109

题解：

First, we need to construct a new array with [taskInd, startTime, processingTime].

Sort the array with startTime.

Have a minHeap on first processingTime, then taskInd.

While result index < n, n = task.length, first add all the task that startTime <= current time into the minHeap.

If minHeap is not empty, we can poll the first value add taskInd to the result and udpate the currentTime.

Otherwise, update the currentTime to the current task startTime.

Time Complexity: O(nlogn).

Space: O(n).

AC Java:

 1 class Solution {
 2     public int[] getOrder(int[][] tasks) {
 3         int n = tasks.length;
 4         int[][] sortedTask = new int[n][3];
 5         for(int i = 0; i < n; i++){
 6             sortedTask[i] = new int[]{i, tasks[i][0], tasks[i][1]};
 7         }
 8 
 9         Arrays.sort(sortedTask, (a, b) -> a[1] - b[1]);
10         PriorityQueue<int[]> minHeap = new PriorityQueue<>((a, b) -> a[2] == b[2] ? a[0] - b[0] : a[2] - b[2]);
11 
12         int time = 0;
13         int[] res = new int[n];
14         int ind = 0;
15         int taskInd = 0;
16         while(ind < n){
17             while(taskInd < n && sortedTask[taskInd][1] <= time){
18                 minHeap.add(sortedTask[taskInd]);
19                 taskInd++;
20             }
21 
22             if(!minHeap.isEmpty()){
23                 int[] cur = minHeap.poll();
24                 res[ind++] = cur[0];
25                 time += cur[2];
26             }else{
27                 time = sortedTask[taskInd][1];
28             }
29         }
30 
31         return res;
32     }
33 }