From 7a5008ef78993ce5b538148082f70dab3520947a Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Wed, 19 May 2021 10:50:27 +0800
Subject: [PATCH] =?UTF-8?q?Update=200045.=E8=B7=B3=E8=B7=83=E6=B8=B8?=
 =?UTF-8?q?=E6=88=8FII.md?=
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 f65ceb9e..9b303a7c 100644
--- a/problems/0045.跳跃游戏II.md
+++ b/problems/0045.跳跃游戏II.md
@@ -193,6 +193,26 @@ class Solution:
 ```
 
 Go：
+```Go
+func jump(nums []int) int {
+	dp:=make([]int ,len(nums))
+	dp[0]=0
+
+	for i:=1;i<len(nums);i++{
+		dp[i]=i
+		for j:=0;j<i;j++{
+			if nums[j]+j>i{
+				dp[i]=min(dp[j]+1,dp[i])
+			}
+		}
+	}
+	return dp[len(nums)-1]
+}
+/*
+dp[i]表示从起点到当前位置的最小跳跃次数
+dp[i]=min(dp[j]+1,dp[i]) 表示从j位置用一步跳跃到当前位置，这个j位置可能有很多个，却最小一个就可以
+*/
+```