20220610 other: Task Scheduler

        Title Description ： Here's an array of characters for you  tasks It means CPU List of tasks to be performed . Each letter represents a different kind of task . Tasks can be performed in any order , And every task can be in 1 In unit time . At any unit time ,CPU Can complete a task , Or on standby .

         However , Two Same kind There must be integer length between tasks of n The cooling time of , So at least there's continuity n In units of time CPU On different missions , Or on standby .

         You need to calculate what it takes to complete all the tasks The shortest time .

        coded ：

    public static int leastInterval(char[] tasks, int n) {
        int maxSize = 0, maxCount = 0;
        int hash[] = new int[26];

        int length = tasks.length;
        for (int i=0; i< length; i++) {
            hash[tasks[i] - 'A']++;
            if (hash[tasks[i] - 'A'] > maxSize) {
                maxSize = hash[tasks[i] - 'A'];
            }
        }
        for (int i=0; i<26; i++) {
            if (hash[i] == maxSize) maxCount++;
        }

        return length > (maxSize-1)*(n+1)+maxCount ? length : (maxSize-1)*(n+1)+maxCount;
    }