[Leetcode] 621. 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:

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

思路：

开始的时候觉得需要用sort，优先安排出现次数最多的task。后来发现根本就不用。

我们首先确定一个原则，就是按照贪心策略来排列任务，首先排列出现次数最多的，其次排列次多的……最后排列出现次数最少的。而在排列的过程中按照间隔n来进行。假定出现次数最多的task A的出现次数是count，那么最后一个A的出现位置一定是(count - 1) * (n + 1)。每出现一个和task A出现次数相同的任务，那么它就需要排列在最后一个task 的位置之后，所以长度就增加1。

但是上面的情况忽略了n == 0的情况，此时所有任务可以任意排列，所以此时长度为tasks的长度。所以我们最后返回tasks长度和ans的最大值即可。算法的时间复杂度是O(tasks.size())，空间复杂度可以认为是O(1)，因为hash表的最大size是26。

代码：

class Solution {
public:
    int leastInterval(vector<char>& tasks, int n) {
        unordered_map<char,int> hash;
        int count = 0;
        for(auto t : tasks) {
            ++hash[t];
            count = max(count, hash[t]);
        }
        int ans = (count - 1) * (n + 1);    // min possible value
        for(auto h : hash) {
            if(h.second == count) {
                ++ans;
            }
        }
        return max(static_cast<int>(tasks.size()), ans);    
    }
};