mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
48 lines
2.0 KiB
HTML
48 lines
2.0 KiB
HTML
|
<p>给你一个用字符数组 <code>tasks</code> 表示的 CPU 需要执行的任务列表。其中每个字母表示一种不同种类的任务。任务可以以任意顺序执行，并且每个任务都可以在 1 个单位时间内执行完。在任何一个单位时间，CPU 可以完成一个任务，或者处于待命状态。</p>
|
|||
|
|
|
|||
|
|
<p>然而，两个<strong> 相同种类</strong> 的任务之间必须有长度为整数<strong> </strong><code>n</code><strong> </strong>的冷却时间，因此至少有连续 <code>n</code> 个单位时间内 CPU 在执行不同的任务，或者在待命状态。</p>
|
|||
|
|
|
|||
|
|
<p>你需要计算完成所有任务所需要的<strong> 最短时间</strong> 。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>tasks = ["A","A","A","B","B","B"], n = 2
|
|||
|
|
<strong>输出：</strong>8
|
|||
|
|
<strong>解释：</strong>A -> B -> (待命) -> A -> B -> (待命) -> A -> B
|
|||
|
|
在本示例中，两个相同类型任务之间必须间隔长度为 n = 2 的冷却时间，而执行一个任务只需要一个单位时间，所以中间出现了（待命）状态。 </pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>tasks = ["A","A","A","B","B","B"], n = 0
|
|||
|
|
<strong>输出：</strong>6
|
|||
|
|
<strong>解释：</strong>在这种情况下，任何大小为 6 的排列都可以满足要求，因为 n = 0
|
|||
|
|
["A","A","A","B","B","B"]
|
|||
|
|
["A","B","A","B","A","B"]
|
|||
|
|
["B","B","B","A","A","A"]
|
|||
|
|
...
|
|||
|
|
诸如此类
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>tasks = ["A","A","A","A","A","A","B","C","D","E","F","G"], n = 2
|
|||
|
|
<strong>输出：</strong>16
|
|||
|
|
<strong>解释：</strong>一种可能的解决方案是：
|
|||
|
|
A -> B -> C -> A -> D -> E -> A -> F -> G -> A -> (待命) -> (待命) -> A -> (待命) -> (待命) -> A
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= task.length <= 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>tasks[i]</code> 是大写英文字母</li>
|
|||
|
|
<li><code>n</code> 的取值范围为 <code>[0, 100]</code></li>
|
|||
|
|
</ul>
|