Commit 35ce63e

committed

[20230105] Solve medium problem

1 parent dcb8a96 commit 35ce63eCopy full SHA for 35ce63e

File tree

+30

-0

lines changed

🤔medium/0452.Minimum-Number-of-Arrows-to-Burst-Balloons
- minimum-number-of-arrows-to-burst-balloons.py

+30

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,30 @@`
	`1`	`+# 452. Minimum Number of Arrows to Burst Balloons`
	`2`	`+# https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/`
	`3`	`+`
	`4`	`+from typing import List`
	`5`	`+`
	`6`	`+`
	`7`	`+class Solution:`
	`8`	`+ def findMinArrowShots(self, points: List[List[int]]) -> int:`
	`9`	`+ # point 값이 최소 1개 이상 있어서`
	`10`	`+ # 무조건 한개의 화살을 쏘게 되어 있음`
	`11`	`+ result = 1`
	`12`	`+`
	`13`	`+ # 풍선의 끝점으로 정렬함`
	`14`	`+ points.sort(key=lambda x: x[1])`
	`15`	`+ prev = points[0]`
	`16`	`+ for point in points:`
	`17`	`+ # 풍선이 서로 안 닿아 있음`
	`18`	`+ # 그러면 다음 풍선을 burst 하기 위해 화살을 쏜다`
	`19`	`+ if prev[1] < point[0]:`
	`20`	`+ result += 1`
	`21`	`+ prev = point`
	`22`	`+ # else 라면 닿아 있다는 의미 이므로`
	`23`	`+ # 화살을 쏠 필요가 없다. (이미 prev 풍선 확인 하면서 쐈기 때문임)`
	`24`	`+`
	`25`	`+ return result`
	`26`	`+`
	`27`	`+`
	`28`	`+if __name__ == '__main__':`
	`29`	`+ sol = Solution()`
	`30`	`+ print(sol.findMinArrowShots([[10, 16], [2, 8], [1, 6], [7, 12]]))`

Comments

(0)