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:

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

Note:

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

题意：每种大写字母代表一种任务，相同的任务至少相隔n，否则进入“冷却”状态，求所有任务总时间。
解法：首先找出数量最多的任务出现cnt次，隔n个空分开，剩下的任务可以依次填入空中，如果全都填满了，那么最后需要的时间就是总任务数，因为只要满足了最多的任务，其他的任务都可以找到一种方式挨个填入没有空隙，如果没填满，需要时间就是
（cnt - 1）*（n + 1）再加上最多任务的个数（有可能多个任务都出现最多次）。

class Solution {
public:
    int leastInterval(vector<char>& tasks, int n) {
        int cnt = 0;
        vector<int> v(26, 0);
        for(auto &c : tasks){
            cnt = max(cnt, ++v[c - 'A']);
        }
        int ans = (cnt - 1) * (n + 1);
        for(auto c : v){
            if(c == cnt)
                ans++;
        }
        ans = max(ans, (int)tasks.size());
        return ans;
    }
};