From 60ad3b081134174577ad58416d275b1bb78267cd Mon Sep 17 00:00:00 2001
From: fusunx <1102654482@qq.com>
Date: Sun, 30 May 2021 23:37:15 +0800
Subject: [PATCH] =?UTF-8?q?0045.=E8=B7=B3=E8=B7=83=E6=B8=B8=E6=88=8F||.md?=
 =?UTF-8?q?=20Javascript?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0045.跳跃游戏II.md | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)

diff --git a/problems/0045.跳跃游戏II.md b/problems/0045.跳跃游戏II.md
index 31b52b31..4128da4c 100644
--- a/problems/0045.跳跃游戏II.md
+++ b/problems/0045.跳跃游戏II.md
@@ -208,6 +208,26 @@ func jump(nums []int) int {
 	}
 	return dp[len(nums)-1]
 }
+```
+
+Javascript:
+```Javascript
+var jump = function(nums) {
+    let curIndex = 0
+    let nextIndex = 0
+    let steps = 0
+    for(let i = 0; i < nums.length - 1; i++) {
+        nextIndex = Math.max(nums[i] + i, nextIndex)
+        if(i === curIndex) {
+            curIndex = nextIndex
+            steps++
+        }
+    }
+
+    return steps
+};
+```
+
 /*
 dp[i]表示从起点到当前位置的最小跳跃次数
 dp[i]=min(dp[j]+1,dp[i]) 表示从j位置用一步跳跃到当前位置，这个j位置可能有很多个，却最小一个就可以