Refactor

I hope this is easier to read.

Author: Chris Cooper

python/0621-task-scheduler.py

@@ -23,12 +23,9 @@ def leastInterval(self, tasks: List[str], n: int) -> int:
 # 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
+        counter = collections.Counter(tasks)
+        max_count = max(counter.values())
+        min_time = (max_count - 1) * (n + 1) + \
+                    sum(map(lambda c: c == max_count, counter.values()))
 
         return max(min_time, len(tasks))