leetcode621. 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:

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

解法

首先统计字符出现的次数，并排序，假设出现次数最多的字符为A，次数为m，则最后字符排序一定按照AxxAxxAxxA，如果A的次数够长且间隔够大，则可以将其他字符全部填充到间隔之中，那么最终长度为(n+1)m+1，假设有和A相同次数的字符，则只需要将+1改为+k即可。那么如果将间隔填充完毕，仍旧有剩余的字符，则只需要在间隔中继续填充即可，比如A出现4次，n=1，B出现4次，C出现2次，那么B即可填满间隔，这时候为ABABABAB，C则可以直接填充在B之后为ABCABCABAB即可，这时候字符之间没有间隔，长度为字符串长度。所以最终长度为max(原字符串长度，(n+1)m+k)。

代码

class Solution {
public:
int num[26];
int leastInterval(vector& tasks, int n) {
for(int i = 0; i < 26; i ++)
num[i] = 0;
for(int i = 0; i < tasks.size(); i ++)
{
num[tasks[i]-‘A’] ++;
}
sort(num,num+26);

    int count = 0;
    for(int i = 25; i >= 0; i --)
    {
        if(num[i] == num[25])
            count ++;
        else
            break;
    }
    int len = tasks.size();
    return max(len,((n+1)*(num[25]-1)+count));

}

};