演算法›Ch7 貪婪演算法
第 12 題/共 12 題
◀ AL 12/12
12. Greedy Algorithm、Interval Scheduling
#AL-07-012中Greedy AlgorithmInterval Scheduling

There are n online courses labeled from 1 to n. Each course ii is described by courses[i] = [duration_i, lastDay_i], where the course must be taken continuously for duration_i days and completed no later than lastDay_i. You start on day 1 and may not take more than one course at a time. The goal is to determine the maximum number of courses that can be taken. Which of the following statements is/are true?

📄 中央115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch7 貪婪演算法
本章題號 · 1–12 / 12