LeetCode 621 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 1:

Input: tasks = ["A","A","A","B","B","B"], n = 2
Output: 8
Explanation: A -> B -> idle -> A -> B -> idle -> A -> B.

Note:

1. The number of tasks is in the range [1, 10000].
2. The integer n is in the range [0, 100].

显然这种题目要用贪心，为什么想到用贪心的……灵光一现吧

举例，[A,A,A,A,B,B,B,C,C]，2

先找到频率最高的，留出空位

A()()A()()A()()A

然后把BC填进去，不够的补idle

特殊情况1:最高频率的任务有多个，那么就要打包

[A,A,A,B,B,B,C,C]，2

AB()AB()AB

特殊情况2:n太小算出来比task元素数量还少，那么返回len(task)

class Solution(object):
    def leastInterval(self, tasks, n):
        """
        :type tasks: List[str]
        :type n: int
        :rtype: int
        """
        res = 0
        dic = dict()
        for t in tasks:
            dic[t] = dic.get(t,0)+1
        nums = [dic[k] for k in dic]
        nums = sorted(nums)
        count = 0
        for i in nums:
            count = count+1 if i == nums[-1] else count
        return max(len(tasks),(nums[-1]-1)*(n+1-count)+count*nums[-1])