https://school.programmers.co.kr/learn/courses/30/lessons/42884
요격 시스템문제와 같은 방식def solution(routes):
answer = 1
if len(routes) == 1:
return 1
routes.sort(key=lambda x:x[1])
min_v = routes[0][1]
i = 1
while i < len(routes):
s, e = routes[i] # 시작, 끝
# 시작 > min_v
if s > min_v:
answer += 1
min_v = e
i += 1
return answer