题目:原题链接(简单)
标签:排序
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
Ans 1 (Python) | O ( N l o g N ) | O ( N ) | 48ms (58.49%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一:
class Solution:
def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
intervals.sort()
finish = 0
for start, end in intervals:
if start < finish:
return False
finish = end
return True