forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmangodm-web.py
22 lines (18 loc) Β· 941 Bytes
/
mangodm-web.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
from typing import List
class Solution:
def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
"""
- Idea: λͺ¨λ νμμ μ°Έμν μ μμΌλ €λ©΄, μμ μ€λ νμκ° λλλ μκ°μ΄
λ€μ νμμ μμ μκ°μ λμ΄μλ μλλ€.
μ΄λ₯Ό νμΈνκΈ° μν΄ μ£Όμ΄μ§ νμ μΌμ μ μμ μκ° κΈ°μ€μΌλ‘ μ λ ¬νκ³ ,
μμ°¨μ μΌλ‘ λΉκ΅νμ¬ μμ 쑰건μ μλ°νλ νμκ° μλμ§ νμΈνλ€.
- Time Complexity: O(nlogn). nμ νμμ μ.
μ λ ¬μ O(nlogn)μ΄ μμλκ³ , μμ°¨ νμμ νλ λ°λ O(n)μ΄ νμνλ€.
- Space Complexity: O(1).
μΆκ° 곡κ°μ μ¬μ©νμ§ μλλ€.
"""
intervals.sort()
for i in range(len(intervals) - 1):
if intervals[i][1] > intervals[i + 1][0]:
return False
return True