[leetcode]621. Task Scheduler任务调度
Posted 程序媛詹妮弗
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了[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:
Input: tasks = ["A","A","A","B","B","B"], n = 2 Output: 8 Explanation: A -> B -> idle -> A -> B -> idle -> A -> B.
以上是关于[leetcode]621. Task Scheduler任务调度的主要内容，如果未能解决你的问题，请参考以下文章
[leetcode]Queue-621. Task Scheduler
leetcode621 - Task Scheduler - medium
[leetcode]621. Task Scheduler任务调度