55 accepted

Author: aQua

Algorithms/0055.jump-game/README.md

@@ -3,19 +3,15 @@
 ## 题目
 Given an array of non-negative integers, you are initially positioned at the first index of the array.
 
-
 Each element in the array represents your maximum jump length at that position. 
 
-
 Determine if you are able to reach the last index.
 
-
-
+```
 For example:
 A = [2,3,1,1,4], return true.
-
-
 A = [3,2,1,0,4], return false.
+```
 ## 解题思路
 
 见程序注释

Algorithms/0055.jump-game/jump-game.go

@@ -1,5 +1,24 @@
 package Problem0055
 
 func canJump(nums []int) bool {
+	i := len(nums) - 2
+	for ; i >= 0; i-- {
+		if nums[i] != 0 {
+			continue
+		}
 
+		j := i - 1
+		for ; j >= 0; j-- {
+			if i-j < nums[j] {
+				i = j
+				break
+			}
+		}
+
+		if j == -1 {
+			return false
+		}
+	}
+
+	return true
 }

Algorithms/0055.jump-game/jump-game_test.go

@@ -1,8 +1,8 @@
 package Problem0055
 
 import (
-	"testing"
 	"fmt"
+	"testing"
 
 	"github.com/stretchr/testify/assert"
 )
@@ -19,7 +19,7 @@ type para struct {
 
 // ans 是答案
 type ans struct {
-	one  bool 
+	one bool
 }
 
 func Test_Problem0055(t *testing.T) {
@@ -29,20 +29,38 @@ func Test_Problem0055(t *testing.T) {
 
 		question{
 			para{
-					,
+				[]int{2, 3, 1, 1, 4},
+			},
+			ans{
+				true,
+			},
+		},
+
+		question{
+			para{
+				[]int{3, 2, 1, 0, 4},
 			},
 			ans{
-					,
+				false,
 			},
 		},
-	
+
+		question{
+			para{
+				[]int{3, 2, 2, 0, 4},
+			},
+			ans{
+				true,
+			},
+		},
+
 		// 如需多个测试，可以复制上方元素。
 	}
 
 	for _, q := range qs {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, canJump(p  ), "输入:%v", p)
+		ast.Equal(a.one, canJump(p.nums), "输入:%v", p)
 	}
 }