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]);