minimum-time-to-complete-all-tasks

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

There is a computer that can run an unlimited number of tasks at the same time. You are given a 2D integer array <code>tasks</code> where <code>tasks[i] = [starti, endi, durationi]</code> indicates that the <code>ith</code> task should run for a total of <code>durationi</code> seconds (not necessarily continuous) within the inclusive time range <code>[starti, endi]</code>.

You may turn on the computer only when it needs to run a task. You can also turn it off if it is idle.

Return the minimum time during which the computer should be turned on to complete all tasks.

&nbsp;
Example 1:

<pre>
Input: tasks = [[2,3,1],[4,5,1],[1,5,2]]
Output: 2
Explanation: 
- The first task can be run in the inclusive time range [2, 2].
- The second task can be run in the inclusive time range [5, 5].
- The third task can be run in the two inclusive time ranges [2, 2] and [5, 5].
The computer will be on for a total of 2 seconds.
</pre>

Example 2:

<pre>
Input: tasks = [[1,3,2],[2,5,3],[5,6,2]]
Output: 4
Explanation: 
- The first task can be run in the inclusive time range [2, 3].
- The second task can be run in the inclusive time ranges [2, 3] and [5, 5].
- The third task can be run in the two inclusive time range [5, 6].
The computer will be on for a total of 4 seconds.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= tasks.length &lt;= 2000</code></li>
	<li><code>tasks[i].length == 3</code></li>
	<li><code>1 &lt;= starti, endi &lt;= 2000</code></li>
	<li><code>1 &lt;= durationi &lt;= endi - starti + 1 </code></li>
</ul>

findMinimumTime

Minimum Time to Complete All Tasks

Single-Threaded CPU

single-threaded-cpu

单线程 CPU

Stack

Greedy

Array

Binary Search

Sorting

你有一台电脑，它可以 同时&nbsp;运行无数个任务。给你一个二维整数数组&nbsp;<code>tasks</code>&nbsp;，其中&nbsp;<code>tasks[i] = [starti, endi, durationi]</code>&nbsp;表示第&nbsp;<code>i</code>&nbsp;个任务需要在 闭区间&nbsp;时间段&nbsp;<code>[starti, endi]</code>&nbsp;内运行&nbsp;<code>durationi</code>&nbsp;个整数时间点（但不需要连续）。

当电脑需要运行任务时，你可以打开电脑，如果空闲时，你可以将电脑关闭。

请你返回完成所有任务的情况下，电脑最少需要运行多少秒。

&nbsp;

示例 1：

<pre>输入：tasks = [[2,3,1],[4,5,1],[1,5,2]]
输出：2
解释：
- 第一个任务在闭区间 [2, 2] 运行。
- 第二个任务在闭区间 [5, 5] 运行。
- 第三个任务在闭区间 [2, 2] 和 [5, 5] 运行。
电脑总共运行 2 个整数时间点。
</pre>

示例 2：

<pre>输入：tasks = [[1,3,2],[2,5,3],[5,6,2]]
输出：4
解释：
- 第一个任务在闭区间 [2, 3] 运行
- 第二个任务在闭区间 [2, 3] 和 [5, 5] 运行。
- 第三个任务在闭区间 [5, 6] 运行。
电脑总共运行 4 个整数时间点。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= tasks.length &lt;= 2000</code></li>
	<li><code>tasks[i].length == 3</code></li>
	<li><code>1 &lt;= starti, endi &lt;= 2000</code></li>
	<li><code>1 &lt;= durationi &lt;= endi - starti + 1 </code></li>
</ul>