algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 21:10:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0045.跳跃游戏II.md

Browse Source
This commit is contained in:
fw_qaq
2023-03-14 11:58:01 +08:00
committed by GitHub
parent 2b73437e72
commit 0502841530
1 changed files with 6 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
problems/0045.跳跃游戏II.md
View File

@ -386,13 +386,13 @@ impl Solution {
let mut cur_distance = 0;
let mut ans = 0;
let mut next_distance = 0;
for (n, &i) in nums.iter().enumerate() {
next_distance = (n as i32 + i).max(next_distance);
for (i, &n) in nums.iter().enumerate().take(nums.len() - 1) {
next_distance = (n as usize + i).max(next_distance);
if i == cur_distance {
if cur_distance < n as i32 - 1 {
if cur_distance < nums.len() - 1 {
ans += 1;
cur_distance = next_distance;
if next_distance >= n as i32 - 1 {
if next_distance >= nums.len() - 1 {
break;
};
} else {
@ -403,7 +403,6 @@ impl Solution {
ans
}
}
```
```Rust
@ -416,8 +415,8 @@ impl Solution {
let mut cur_distance = 0;
let mut ans = 0;
let mut next_distance = 0;
for (n, &i) in nums.iter().enumerate() {
next_distance = (n as i32 + i).max(next_distance);
for (i, &n) in nums.iter().enumerate().take(nums.len() - 1) {
next_distance = (n as usize + i).max(next_distance);
if i == cur_distance {
cur_distance = next_distance;
ans += 1;
@ -426,7 +425,6 @@ impl Solution {
ans
}
}
```