leetcode(9)

leetcode(9)

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

class Solution {
public:
int leastInterval(vector<char>& tasks, int n) {
unordered_map<char,int>mp;
int count = 0;
for(auto e : tasks)
{

//记录每个任务出现的次数
mp[e]++;

//记录出现次数最多的次数(可能是多个任务)
count = max(count, mp[e]);
}

int ans = (count-1)*(n+1);

//计算出现次数最多,且多个任务
for(auto e : mp) if(e.second == count) ans++;

//排除间隙过小
return max((int)tasks.size(), ans);
}
};




So BadJust So SoGoodCoolPretty Cool (还没人评过分呢!)
Loading...

发表评论

电子邮件地址不会被公开。 必填项已用*标注