Description
There are n different online courses numbered from 1 to n. You are given an array courses where courses[i] = [durationi, lastDayi] indicate that the ith course should be taken continuously for durationi days and must be finished before or on lastDayi.
You will start on the 1st day and you cannot take two or more courses simultaneously.
Return the maximum number of courses that you can take.
Example 1:
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.
Example 2:
Input: courses = [[1,2]]
Output: 1
Example 3:
Input: courses = [[3,2],[4,3]]
Output: 0
Constraints:
1 <= courses.length <= 104
1 <= durationi, lastDayi <= 104
Solution
Assume we have a solution for k
courses, for the next course:
- If we could complete this course before lastDay, then we add this course to the previous solution, and we continue;
- If we could not complete this course, then we could select the course with largest duration and delete it, other course behind this course will be completed earlier, so the previous solution will always be valid. Then we add the new course to the end of our previous solution, so the total time will be reduced, and the total number of courses remains the same.
Time complexity:
o
(
n
log
n
)
o(n \log n)
o(nlogn)
Space complexity:
o
(
n
)
o(n)
o(n)
Code
class Solution:
def scheduleCourse(self, courses: List[List[int]]) -> int:
courses.sort(key=lambda x:x[1])
heap = []
cur_time = 0
for duration, last_day in courses:
if cur_time + duration <= last_day:
heapq.heappush(heap, -duration)
cur_time += duration
elif heap:
learned_max_duration = heapq.heappop(heap)
if duration < -learned_max_duration:
heapq.heappush(heap, -duration)
cur_time += (learned_max_duration + duration)
else:
heapq.heappush(heap, learned_max_duration)
return len(heap)