1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-11-14 09:59:41 +01:00
LeetCode/swift/minimum-number-of-arrows-to-burst-balloons.swift

20 lines
467 B
Swift
Raw Normal View History

class Solution {
func findMinArrowShots(_ points: [[Int]]) -> Int {
let points = points.sorted(by: { a, b in return a[0] < b[0] })
var usedArrows = 1
var maxX = points[0][1]
for point in points.dropFirst() {
if point[0] <= maxX {
maxX = min(maxX, point[1])
} else {
maxX = point[1]
usedArrows += 1
}
}
return usedArrows
}
}