diff --git a/problems/0045.跳跃游戏II.md b/problems/0045.跳跃游戏II.md
index 13142c99..59e30df5 100644
--- a/problems/0045.跳跃游戏II.md
+++ b/problems/0045.跳跃游戏II.md
@@ -214,7 +214,26 @@ class Solution:
         return ans
 ```
 
+```python
+# 贪心版本二
+class Solution:
+    def jump(self, nums: List[int]) -> int:
+        if len(nums) == 1:
+            return 0
+        curDistance, nextDistance = 0, 0
+        step = 0
+        for i in range(len(nums)-1):
+            nextDistance = max(nextDistance, nums[i]+i)
+            if i == curDistance:
+                curDistance = nextDistance
+                step += 1
+        return step
+```
+
+
+
 ### Go
+
 ```Go
 func jump(nums []int) int {
     dp := make([]int, len(nums))
@@ -240,7 +259,71 @@ func min(a, b int) int {
 }
 ```
 
+```go
+// 贪心版本一
+func jump(nums []int) int {
+    n := len(nums)
+    if n == 1 {
+        return 0
+    }
+    cur, next := 0, 0
+    step := 0
+    for i := 0; i < n; i++ {
+        next = max(nums[i]+i, next)
+        if i == cur {
+            if cur != n-1 {
+                step++
+                cur = next
+                if cur >= n-1 {
+                    return step
+                }
+            } else {
+                return step
+            }
+        }
+    }
+    return step
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+```
+
+```go
+// 贪心版本二
+func jump(nums []int) int {
+    n := len(nums)
+    if n == 1 {
+        return 0
+    }
+    cur, next := 0, 0
+    step := 0
+    for i := 0; i < n-1; i++ {
+        next = max(nums[i]+i, next)
+        if i == cur {
+            cur = next
+            step++
+        }
+    }
+    return step
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+```
+
+
+
 ### Javascript
+
 ```Javascript
 var jump = function(nums) {
     let curIndex = 0