← 返回 amazon 的题目列表Meeting Rooms
类型：online_judge
Given an array of meeting time intervals intervals where intervals[i] = [start_i, end_i] and start_i < end_i, determine if a person could attend all meetings (i.e., no two intervals overlap).
Input: First line integer n. Next n lines contain start end.
Output: Print true or false.
Constraints:
0 <= n <= 2 * 10^5
0 <= start, end <= 10^9
Example: Input:
3
0 30
5 10
15 20
Output:
false
Example
Input
3
0 30
5 10
15 20
Output
false