LeetCode 621. Task Scheduler(java)

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

思路：首先，先把tasks里的字符的频率放进26位数的数组里，然后对这个数组sort一下，得到频率的排序，然后从先将频率最高的任务安排好，再安排频率次高的，直到安排完。

public int leastInterval(char[] tasks, int n) {
        if (tasks.length == 0) return 0;
        int[] list = new int[26];
        for (int i = 0; i < tasks.length; i++) {
            list[tasks[i] - 'A']++;
        }
        Arrays.sort(list);
        int num = 0;
        for (int i = 25; i > 0; i--) {
            if (list[i-1] == list[i]) num++;
            else break;
        }
        int cur = list[25] + (list[25] - 1) * n + num;
        if (tasks.length > cur) return tasks.length;
        else return cur;
    }

follow up : 需要按照task的相对顺序来

    //按照task的顺序来，time complexity is O(n), space complexity is O(26)
     public int taskScheduler(char[] task, int n) {
            char[] list = new int[26];
            int time = 0;
            for (char c : task) {
                time = Math.max(list[c - 'A'], time + 1);
                list[c - 'A'] = time + n + 1;
            }
            return time;
     }