LeetCode 솔루션

[6/23] 630. Course Schedule III

mingki 쪽지보내기 메일보내기 자기소개 아이디로 검색 전체게시물 작성
작성일 2022.06.23 12:01

6,923 조회
1 댓글
0 추천
0 비추천
목록 게시글 쓰기

Hard

293977Add to ListShare

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

#Amazon, #Bloomberg, #Microsoft, #ByteDance, #Works Applications, #Array, #Greedy, #Heap(Priority Queue)

링크

https://leetcode.com/problems/course-schedule-iii/ 1882 회 연결

익명
작성일 2022.06.25 09:17

import heapq
class Solution:
    def scheduleCourse(self, courses: List[List[int]]) -> int:
        
        max_heap = []
        heapq.heapify(max_heap)
        total_time = 0
        
        for t, endt in sorted(courses, key=lambda x:x[1]):
            total_time += t
            heapq.heappush(max_heap, -t)
            if total_time > endt:
                total_time += heapq.heappop(max_heap)
                
        
        return len(max_heap)