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

Merge pull request #889 from hailincai/patch1101_02

Browse Source 
0055 修改代码初始覆盖范围的值和注释
This commit is contained in:
程序员Carl
2021-11-09 18:15:57 +08:00
committed by GitHub
parent c6fadbdfeb 22b77d6ce2
commit d3d5ad918a
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0055.跳跃游戏.md
View File

@ -92,8 +92,8 @@ class Solution {
if (nums.length == 1) {
return true;
}
//覆盖范围
int coverRange = nums[0];
//覆盖范围, 初始覆盖范围应该是0，因为下面的迭代是从下标0开始的
int coverRange = 0;
//在覆盖范围内更新最大的覆盖范围
for (int i = 0; i <= coverRange; i++) {
coverRange = Math.max(coverRange, i + nums[i]);