離散数学を練習する

Interval Scheduling Greedy

Browse Interval Scheduling Greedy lessons inside Algorithmic Thinking and Complexity.

1 lessons · 5 questions

Algorithmic Thinking and Complexity

Big-O, loop analysis, graph algorithms, invariants, and developer-focused discrete math.

1 lessons · 410 questions

Interval Scheduling Greedy

1 lessons · 5 questions

Least You Need to Know: Interval Scheduling and Earliest-Finish Greedy

For maximizing how many non-overlapping intervals you can keep, the standard greedy rule is to sort by **earliest finishing time** and repeatedly accept the next compatible interval. The reason is that earlier finishes preserve more room for future choices.

レッスンを開く