helper fix

Author: aQua

Algorithms/0055.jump-game/README.md

@@ -0,0 +1,21 @@
+# [55. Jump Game](https://leetcode.com/problems/jump-game/)
+
+## 题目
+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

@@ -0,0 +1,5 @@
+package Problem0055
+
+func canJump(nums []int) bool {
+
+}

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

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

helper.v3/problem.go

@@ -179,7 +179,7 @@ func Test_%s(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%s~~\n", p)
 
-		ast.Equal(a.one, %s(p  ), "输入:%s", p)
+		ast.Equal(a.one, %s(p.  ), "输入:%s", p)
 	}
 }
 `