← 返回 amazon 的题目列表Get Maximum Events
类型：online_judge
Given a series of courses, each with a start and end time.
Input:
A 2D list where each sublist represents a course's start and end time within a day.
Output:
An integer representing the maximum number of non-overlapping courses a person can attend.
Constraints:
0 <= event[i][0] < event[i][1] <= 10^5
1 <= len(events) <= 10^5
Example
Input
[[1, 2], [3, 4], [0, 6], [5, 7], [8, 9], [5, 9]]