621. Task Scheduler

Author: Akcps

621. Task Scheduler/Question.md

@@ -0,0 +1,23 @@
+**621. Task Scheduler**
+
+https://leetcode.com/problems/task-scheduler/
+
+Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks. Tasks could be done without original order. Each task could be done in one interval. For each interval, CPU could finish one task or just be idle.
+
+However, there is a non-negative cooling interval n that means between two same tasks, there must be at least n intervals that CPU are doing different tasks or just be idle.
+
+You need to return the least number of intervals the CPU will take to finish all the given tasks.
+
+ 
+
+Example:
+
+    Input: tasks = ["A","A","A","B","B","B"], n = 2
+    Output: 8
+    Explanation: A -> B -> idle -> A -> B -> idle -> A -> B.
+ 
+
+Note:
+
+- The number of tasks is in the range [1, 10000].
+- The integer n is in the range [0, 100].

621. Task Scheduler/Solution.java

@@ -0,0 +1,33 @@
+/**
+ * Runtime: 31 ms, faster than 32.09% of Java online submissions for Task Scheduler.
+ * Memory Usage: 41.9 MB, less than 5.88% of Java online submissions for Task Scheduler.
+ */
+class Solution {
+    public int leastInterval(char[] tasks, int n) {
+        Map<Character, Integer> map = new HashMap<>();
+        PriorityQueue<Integer> maxHeap = new PriorityQueue<>((a,b) -> b-a);
+
+        for (char t: tasks)
+            map.put(t, map.getOrDefault(t, 0) + 1);
+
+        maxHeap.addAll(map.values());
+
+        int cycles = 0;
+        while (!maxHeap.isEmpty()) {
+            List<Integer> temp = new ArrayList<>();
+            for (int i = 0; i <= n; i++) {
+                if (!maxHeap.isEmpty()) {
+                    int v = maxHeap.poll();
+                    if (v > 1)
+                        temp.add(v-1);
+                }
+                cycles++;
+                if (maxHeap.isEmpty() && temp.size() == 0)
+                    break;
+            }
+            for (int j : temp)
+                maxHeap.add(j);
+        }
+        return cycles;
+    }
+}