From 22b77d6ce256830db00717ea8c58240fcec5a889 Mon Sep 17 00:00:00 2001
From: hailincai <hailin.cai.neulion@gmail.com>
Date: Mon, 1 Nov 2021 07:51:12 -0400
Subject: [PATCH] =?UTF-8?q?0055=20=E4=BF=AE=E6=94=B9=E4=BB=A3=E7=A0=81?=
 =?UTF-8?q?=E5=88=9D=E5=A7=8B=E8=A6=86=E7=9B=96=E8=8C=83=E5=9B=B4=E7=9A=84?=
 =?UTF-8?q?=E5=80=BC=E5=92=8C=E6=B3=A8=E9=87=8A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

0055 修改代码初始覆盖范围的值和注释
---
 problems/0055.跳跃游戏.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/problems/0055.跳跃游戏.md b/problems/0055.跳跃游戏.md
index 816eb64b..29e09a64 100644
--- a/problems/0055.跳跃游戏.md
+++ b/problems/0055.跳跃游戏.md
@@ -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]);