[LeetCode] 621. Task Scheduler

题：https://leetcode.com/problems/task-scheduler/description/

题目

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

思路

题目大意

cpu与处理任务，每个任务处理时间为1。但相同任务处理需要相隔n个时间。求最小处理时间。

解题思路

由于相同的元素 需要隔离n个时间。那么我们找到tasks 中出现最多次数的元素，该元素的出现次数为 t。那么总时间至少 (t-1)(n+1)+1，若最多元素不止一个总有 s个，那么 总时间最少为 (t-1)(n+1)+s。
还有一种情况，当所有 相同元素造成的 间隔都被填满的情况下， 这时 总时间应该是 task任务的长度。

code

class Solution {
    public int leastInterval(char[] tasks, int n) {
        int c[] = new int[26];
        Arrays.fill(c,0);
        for(int i = 0 ;i<tasks.length;i++){
            c[tasks[i] - 'A']++;
        }
        Arrays.sort(c);
        int i =25;
        while(i>=0 && c[i] == c[25])    i--;
        return Math.max(tasks.length,(c[25] - 1)*(n+1)+25-i);
    }
}