Medium
Task Scheduler II — Python
Full explanation · Time O(n) · Space O(n)
# Time: O(n)
# Space: O(n)
import collections
# hash table
class Solution(object):
def taskSchedulerII(self, tasks, space):
"""
:type tasks: List[int]
:type space: int
:rtype: int
"""
lookup = collections.defaultdict(int)
result = 0
for t in tasks:
result = max(lookup[t], result+1)
lookup[t] = result+space+1
return result