Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

[pull] master from youngyangyang04:master #295

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 8 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Jun 29, 2023
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update 0452.用最少数量的箭引爆气球.md
  • Loading branch information
fwqaaq authored Mar 29, 2023
commit cff523c993e88c7e8de553225af7112113ae6754
22 changes: 7 additions & 15 deletions problems/0452.用最少数量的箭引爆气球.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -270,26 +270,18 @@ int findMinArrowShots(int** points, int pointsSize, int* pointsColSize){

### Rust
```Rust
use std::cmp;
impl Solution {
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]);

let size = points.len();
let mut count = 1;

for i in 1..size {
if points[i][0] > points[i-1][1] {
count += 1;
} else {
points[i][1] = cmp::min(points[i][1], points[i-1][1]);
let mut result = 1;
for i in 1..points.len() {
if points[i][0] > points[i - 1][1] {
result += 1;
} else {
points[i][1] = points[i][1].min(points[i - 1][1])
}
}

return count;
result
}
}
```
Expand Down

AltStyle によって変換されたページ (->オリジナル) /