314人阅读 评论(0)

## 一、问题描述

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) {
map<char, int> m;
for (int i = 0; i < tasks.size(); ++i) {
}
priority_queue<int> pq;
for (auto ite : m){
pq.push(ite.second);
}
int cycle = n + 1, ret = 0;
while(!pq.empty()){
vector<int> tmp;
int time = 0;
for (int i = 0; i < cycle; ++i) {
if (!pq.empty()){
tmp.push_back(pq.top());
pq.pop();
time++;
}
}

for (auto cnt : tmp){
int remainCnt = cnt - 1;
if(remainCnt > 0)pq.push(remainCnt);
}
if(pq.empty()) ret += time;//如果是最后一次调度，不在需要idle来填充
else ret += cycle;
}
return ret;
}
};
0
0

【在线峰会】前端开发重点难点技术剖析与创新实践
【在线峰会】一天掌握物联网全栈开发之道
【在线峰会】如何高质高效的进行Android技术开发

Python数据挖掘与分析速成班

JFinal极速开发企业实战

Python大型网络爬虫项目开发实战（全套）

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：22433次
• 积分：1071
• 等级：
• 排名：千里之外
• 原创：87篇
• 转载：0篇
• 译文：0篇
• 评论：2条
博客专栏
 LeetCode专栏 文章：63篇 阅读：6437
文章分类
阅读排行
联系我
QQ: 531267557