Add greedy algorithm

coopers · coopers · commit c80ba45d093f · 2023-09-10T20:11:30.000-07:00
This is much more efficient and is easy to understand.
diff --git a/python/0621-task-scheduler.py b/python/0621-task-scheduler.py
@@ -18,3 +18,17 @@ def leastInterval(self, tasks: List[str], n: int) -> int:
             if q and q[0][1] == time:
                 heapq.heappush(maxHeap, q.popleft()[0])
         return time
+
+
+# Greedy algorithm
+class Solution(object):
+    def leastInterval(self, tasks: List[str], n: int) -> int:
+        counts = collections.Counter(tasks)
+        max_count = max(counts.values())
+        min_time = (max_count - 1) * (n + 1)
+
+        for count in counts.values():
+            if count == max_count:
+                min_time += 1
+    
+        return max(min_time, len(tasks))
