algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0452.用最少数量的箭引爆气球.md

Browse Source
This commit is contained in:
fw_qaq
2023-03-29 19:58:07 +08:00
committed by GitHub
parent d2bbea431e
commit cff523c993
1 changed files with 7 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
problems/0452.用最少数量的箭引爆气球.md
View File

@ -270,26 +270,18 @@ int findMinArrowShots(int** points, int pointsSize, int* pointsColSize){
### Rust ### Rust
```Rust ```Rust
use std::cmp;
impl Solution { impl Solution {
pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 { pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 {
if points.is_empty() {
return 0;
}
points.sort_by_key(|point| point[0]); points.sort_by_key(|point| point[0]);
let mut result = 1;
let size = points.len(); for i in 1..points.len() {
let mut count = 1; if points[i][0] > points[i - 1][1] {
result += 1;
for i in 1..size { } else {
if points[i][0] > points[i-1][1] { points[i][1] = points[i][1].min(points[i - 1][1])
count += 1;
} else {
points[i][1] = cmp::min(points[i][1], points[i-1][1]);
} }
} }
result
return count;
} }
} }
``` ```