task-scheduler

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array of CPU <code>tasks</code>, each labeled with a letter from A to Z, and a number <code>n</code>. Each CPU interval can be idle or allow the completion of one task. Tasks can be completed in any order, but there&#39;s a constraint: there has to be a gap of at least <code>n</code> intervals between two tasks with the same label.

Return the minimum number of CPU intervals required to complete all tasks.

&nbsp;
Example 1:

<div class="example-block" style="
 border-color: var(--border-tertiary);
 border-left-width: 2px;
 color: var(--text-secondary);
 font-size: .875rem;
 margin-bottom: 1rem;
 margin-top: 1rem;
 overflow: visible;
 padding-left: 1rem;
">
Input: tasks = [&quot;A&quot;,&quot;A&quot;,&quot;A&quot;,&quot;B&quot;,&quot;B&quot;,&quot;B&quot;], n = 2

Output: 8

Explanation: A possible sequence is: A -&gt; B -&gt; idle -&gt; A -&gt; B -&gt; idle -&gt; A -&gt; B.

After completing task A, you must wait two intervals before doing A again. The same applies to task B. In the 3rd interval, neither A nor B can be done, so you idle. By the 4th interval, you can do A again as 2 intervals have passed.
</div>

Example 2:

<div class="example-block" style="
 border-color: var(--border-tertiary);
 border-left-width: 2px;
 color: var(--text-secondary);
 font-size: .875rem;
 margin-bottom: 1rem;
 margin-top: 1rem;
 overflow: visible;
 padding-left: 1rem;
">
Input: tasks = [&quot;A&quot;,&quot;C&quot;,&quot;A&quot;,&quot;B&quot;,&quot;D&quot;,&quot;B&quot;], n = 1

Output: 6

Explanation: A possible sequence is: A -&gt; B -&gt; C -&gt; D -&gt; A -&gt; B.

With a cooling interval of 1, you can repeat a task after just one other task.
</div>

Example 3:

<div class="example-block" style="
 border-color: var(--border-tertiary);
 border-left-width: 2px;
 color: var(--text-secondary);
 font-size: .875rem;
 margin-bottom: 1rem;
 margin-top: 1rem;
 overflow: visible;
 padding-left: 1rem;
">
Input: tasks = [&quot;A&quot;,&quot;A&quot;,&quot;A&quot;, &quot;B&quot;,&quot;B&quot;,&quot;B&quot;], n = 3

Output: 10

Explanation: A possible sequence is: A -&gt; B -&gt; idle -&gt; idle -&gt; A -&gt; B -&gt; idle -&gt; idle -&gt; A -&gt; B.

There are only two types of tasks, A and B, which need to be separated by 3 intervals. This leads to idling twice between repetitions of these tasks.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= tasks.length &lt;= 104</code></li>
	<li><code>tasks[i]</code> is an uppercase English letter.</li>
	<li><code>0 &lt;= n &lt;= 100</code></li>
</ul>

leastInterval

Task Scheduler

Rearrange String k Distance Apart

rearrange-string-k-distance-apart

K 距离间隔重排字符串

Reorganize String

reorganize-string

重构字符串

Maximum Number of Weeks for Which You Can Work

maximum-number-of-weeks-for-which-you-can-work

你可以工作的最大周数

Find Minimum Time to Finish All Jobs II

find-minimum-time-to-finish-all-jobs-ii

完成所有工作的最短时间 II

Task Scheduler II

task-scheduler-ii

任务调度器 II

Greedy

Array

Hash Table

Counting

Sorting

Heap (Priority Queue)

给你一个用字符数组&nbsp;<code>tasks</code> 表示的 CPU 需要执行的任务列表，用字母 A 到 Z 表示，以及一个冷却时间 <code>n</code>。每个周期或时间间隔允许完成一项任务。任务可以按任何顺序完成，但有一个限制：两个 相同种类 的任务之间必须有长度为&nbsp;<code>n</code> 的冷却时间。

返回完成所有任务所需要的 最短时间间隔&nbsp;。

&nbsp;

示例 1：

<div class="example-block">输入：tasks = ["A","A","A","B","B","B"], n = 2</div>

<div class="example-block">输出：8</div>

<div class="example-block">解释：</div>

<div class="example-block">在完成任务 A 之后，你必须等待两个间隔。对任务 B 来说也是一样。在第 3 个间隔，A 和 B 都不能完成，所以你需要待命。在第 4 个间隔，由于已经经过了 2 个间隔，你可以再次执行 A 任务。</div>

<div class="example-block">&nbsp;</div>

示例 2：

<div class="example-block">
输入：tasks = ["A","C","A","B","D","B"], n = 1

输出：6

解释：一种可能的序列是：A -&gt; B -&gt; C -&gt; D -&gt; A -&gt; B。

由于冷却间隔为 1，你可以在完成另一个任务后重复执行这个任务。
</div>

示例 3：

<div class="example-block">输入：tasks = ["A","A","A","B","B","B"], n = 3</div>

<div class="example-block">输出：10</div>

<div class="example-block">解释：一种可能的序列为：A -&gt; B -&gt; idle -&gt; idle -&gt; A -&gt; B -&gt; idle -&gt; idle -&gt; A -&gt; B。</div>

<div class="example-block">只有两种任务类型，A 和 B，需要被 3 个间隔分割。这导致重复执行这些任务的间隔当中有两次待命状态。</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= tasks.length &lt;= 104</code></li>
	<li><code>tasks[i]</code> 是大写英文字母</li>
	<li><code>0 &lt;= n &lt;= 100</code></li>
</ul>