add 0055 go tanxin

problems/0055.跳跃游戏.md

@@ -139,7 +139,31 @@ func canJUmp(nums []int) bool {
 }
 ```
 
+```go
+// 贪心
+func canJump(nums []int) bool {
+    cover := 0
+    n := len(nums)-1
+    for i := 0; i <= cover; i++ { // 每次与覆盖值比较
+        cover = max(i+nums[i], cover) //每走一步都将 cover 更新为最大值
+        if cover >= n {
+            return true
+        }
+    }
+    return false
+}
+func max(a, b int ) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+```
+
+
+
 ### Javascript 
+
 ```Javascript
 var canJump = function(nums) {
     if(nums.length === 1) return true