1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
| def solution(routes):
sorted_route = sorted(routes)
sector = []
sector.append(sorted_route[0])
for i in range(1,len(sorted_route)):
route = sorted_route[i]
sector_start = sector[-1][0]
sector_end = sector[-1][1]
route_start = route[0]
route_end = route[1]
if sector_end >= route_start:
sector[-1][0] = max(sector_start, route_start)
sector[-1][1] = min(sector_end, route_end)
else:
sector.append(route)
answer = len(sector)
return answer
|