From 39f25c499818ef9da78a1c09264738e68292b96f Mon Sep 17 00:00:00 2001
From: CUI <ccyiyili@163.com>
Date: Sat, 6 Jan 2024 15:01:08 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0go=E8=AF=AD=E8=A8=80=E8=B4=AA?=
 =?UTF-8?q?=E5=BF=83=E4=BC=98=E5=8C=96=E7=89=88=E6=9C=AC=E5=9C=A80045.?=
 =?UTF-8?q?=E8=B7=B3=E8=B7=83=E6=B8=B8=E6=88=8FII.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0045.跳跃游戏II.md b/problems/0045.跳跃游戏II.md
index e006caa2..d290f55e 100644
--- a/problems/0045.跳跃游戏II.md
+++ b/problems/0045.跳跃游戏II.md
@@ -285,6 +285,34 @@ class Solution:
 
 ### Go
 
+
+```go
+/**
+ * @date: 2024 Jan 06
+ * @time: 13:44
+ * @author: Chris
+**/
+// 贪心算法优化版
+
+// 记录步骤规则：每超过上一次可达最大范围，需要跳跃一次，次数+1
+// 记录位置：i == lastDistance + 1
+func jump(nums []int) int {
+	// 根据题目规则，初始位置为nums[0]
+	lastDistance := 0 // 上一次覆盖范围
+	curDistance := 0  // 当前覆盖范围（可达最大范围）
+	minStep := 0      // 记录最少跳跃次数
+
+	for i := 0; i < len(nums); i++ {
+		if i == lastDistance+1 { // 在上一次可达范围+1的位置，记录步骤
+			minStep++                  // 跳跃次数+1
+			lastDistance = curDistance // 记录时才可以更新
+		}
+		curDistance = max(nums[i]+i, curDistance) // 更新当前可达的最大范围
+	}
+	return minStep
+}
+```
+
 ```go
 // 贪心版本一
 func jump(nums []int) int {