leetcode 621 Task Scheduler -FB TAG

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 is 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].

思路：

1. 贪心算法+数学公式

先找出最大的词频， 然后找出最大词频的词的个数，假色task是A， 间隔为N ， 出现的频率为X， 要满足需求，就至少要有x-1个n的间隔， 最大词频可能不止1个，设为K个， 如果填满，最大长度就是tasks的长度，

所以最后， Math.max(maxFrequent-1) * (n+1) + k

class Solution {
    public int leastInterval(char[] tasks, int n) {
           int res = 0;
           int  maxFrequent = 0;
           int[] FreArray = new int[26];
           for(int i=0;i<tasks.length;i++){
                  FreArray[tasks[i]-'A']++;
           }
           for(int i=0;i<26;i++){
               if(FreArray[i]>maxFrequent)
                   maxFrequent = FreArray[i];
        
          }
        int k=0;
           for(int i=0;i<26;i++){
               if(FreArray[i]==maxFrequent)
                   k++;
        
          }
        return Math.max(tasks.length, (maxFrequent-1)*(n+1)+k);
}
}