목록greedy (1)
EPguy
[LeetCode] 452. Minimum Number of Arrows to Burst Balloons
문제 There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array points where points[i] = [xstart, xend] denotes a balloon whose horizontal diameter stretches between xstart and xend. You do not know the exact y-coordinates of the balloons. Arrows can be shot up directly vertically (in the positive y-direction) from diff..
알고리즘/LeetCode
2024. 3. 19. 10:24