mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-09 15:59:06 +01:00
19 lines
467 B
Swift
19 lines
467 B
Swift
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
|
|
}
|
|
}
|