Commitb77e4e5

committed

Fixed task 452.

1 parent87076b0 commitb77e4e5Copy full SHA for b77e4e5

File tree

-1

lines changed

src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons
- readme.md

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -56,7 +56,7 @@ public class Solution {`
`56`	`56`	`* I'm glad to have come up with this solution on my own on 10/13/2021:`
`57`	`57`	`* we'll have to sort the`
`58`	`58`	`* balloons by its ending points, a counter case to this is below:`
`59`		`- * {{0, 6}, {0, 9}, {7, 8}}`
	`59`	`+ * {{0, 6}, {0, 9}, {7, 8}}`
`60`	`60`	`* if we sort by starting points, then it becomes:`
`61`	`61`	`* {0, 6}, {0, 9}, {7, 8}`
`62`	`62`	`* this way, if we shoot 9,`

Comments

(0)