course-schedule-iii

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 are <code>n</code> different online courses numbered from <code>1</code> to <code>n</code>. You are given an array <code>courses</code> where <code>courses[i] = [durationi, lastDayi]</code> indicate that the <code>ith</code> course should be taken continuously for <code>durationi</code> days and must be finished before or on <code>lastDayi</code>.

You will start on the <code>1st</code> day and you cannot take two or more courses simultaneously.

Return the maximum number of courses that you can take.

&nbsp;
Example 1:

<pre>
Input: courses = [[100,200],[200,1300],[1000,1250],[2000,3200]]
Output: 3
Explanation: 
There are totally 4 courses, but you can take 3 courses at most:
First, take the 1st course, it costs 100 days so you will finish it on the 100th day, and ready to take the next course on the 101st day.
Second, take the 3rd course, it costs 1000 days so you will finish it on the 1100th day, and ready to take the next course on the 1101st day. 
Third, take the 2nd course, it costs 200 days so you will finish it on the 1300th day. 
The 4th course cannot be taken now, since you will finish it on the 3300th day, which exceeds the closed date.
</pre>

Example 2:

<pre>
Input: courses = [[1,2]]
Output: 1
</pre>

Example 3:

<pre>
Input: courses = [[3,2],[4,3]]
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= courses.length &lt;= 104</code></li>
	<li><code>1 &lt;= durationi, lastDayi &lt;= 104</code></li>
</ul>

scheduleCourse

Course Schedule III

Course Schedule

course-schedule

课程表

Course Schedule II

course-schedule-ii

课程表 II

Parallel Courses III

parallel-courses-iii

并行课程 III

Greedy

Array

Sorting

Heap (Priority Queue)

这里有 <code>n</code> 门不同的在线课程，按从 <code>1</code> 到 <code>n</code>&nbsp;编号。给你一个数组 <code>courses</code> ，其中 <code>courses[i] = [durationi, lastDayi]</code> 表示第 <code>i</code> 门课将会 持续 上 <code>durationi</code> 天课，并且必须在不晚于 <code>lastDayi</code> 的时候完成。

你的学期从第 <code>1</code> 天开始。且不能同时修读两门及两门以上的课程。

返回你最多可以修读的课程数目。

&nbsp;

示例 1：

<pre>
输入：courses = [[100, 200], [200, 1300], [1000, 1250], [2000, 3200]]
输出：3
解释：
这里一共有 4 门课程，但是你最多可以修 3 门：
首先，修第 1 门课，耗费 100 天，在第 100 天完成，在第 101 天开始下门课。
第二，修第 3 门课，耗费 1000 天，在第 1100 天完成，在第 1101 天开始下门课程。
第三，修第 2 门课，耗时 200 天，在第 1300 天完成。
第 4 门课现在不能修，因为将会在第 3300 天完成它，这已经超出了关闭日期。</pre>

示例 2：

<pre>
输入：courses = [[1,2]]
输出：1
</pre>

示例 3：

<pre>
输入：courses = [[3,2],[4,3]]
输出：0
</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= courses.length &lt;= 104</code></li>
	<li><code>1 &lt;= durationi, lastDayi &lt;= 104</code></li>
</ul>