Files
LeetCode-Go/leetcode/0113.Path-Sum-II/113. Path Sum II_test.go
2020-08-27 00:58:22 +08:00

57 lines
1.0 KiB
Go

package leetcode
import (
"fmt"
"testing"
"github.com/halfrost/LeetCode-Go/structures"
)
type question113 struct {
para113
ans113
}
// para 是参数
// one 代表第一个参数
type para113 struct {
one []int
sum int
}
// ans 是答案
// one 代表第一个答案
type ans113 struct {
one [][]int
}
func Test_Problem113(t *testing.T) {
qs := []question113{
{
para113{[]int{1, 0, 1, 1, 2, 0, -1, 0, 1, -1, 0, -1, 0, 1, 0}, 2},
ans113{[][]int{{1, 0, 1, 0}, {1, 0, 2, -1}, {1, 1, 0, 0}, {1, 1, -1, 1}}},
},
{
para113{[]int{}, 0},
ans113{[][]int{{}}},
},
{
para113{[]int{5, 4, 8, 11, structures.NULL, 13, 4, 7, 2, structures.NULL, structures.NULL, 5, 1}, 22},
ans113{[][]int{{5, 4, 11, 2}, {5, 8, 4, 5}}},
},
}
fmt.Printf("------------------------Leetcode Problem 113------------------------\n")
for _, q := range qs {
_, p := q.ans113, q.para113
fmt.Printf("【input】:%v ", p)
root := structures.Ints2TreeNode(p.one)
fmt.Printf("【output】:%v \n", pathSum(root, p.sum))
}
fmt.Printf("\n\n\n")
}