621. Task Scheduler [Medium] 数学
621. Task Scheduler
class Solution(object):
def leastInterval(self, tasks, n):
"""
:type tasks: List[str]
:type n: int
:rtype: int
"""
dic = {}
for task in tasks:
dic[task] = dic.get(task, 0) + 1
maxNum = max(dic.values())
maxLen = 0
for value in dic.values():
if value == maxNum:
maxLen += 1
n = n + 1
allNum = n * maxNum - (n - maxLen)
idle = max(0, allNum - len(tasks))
return idle + len(tasks)
本文标题：621. Task Scheduler [Medium] 数学
本文链接：https://www.haomeiwen.com/subject/melotctx.html
网友评论