LeetCode-Go/leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim a Binary Search Tree_test.go

package leetcode

import (
	"fmt"
	"testing"

	"github.com/halfrost/LeetCode-Go/structures"
)

type question669 struct {
	para669
	ans669
}

// para 是参数
// one 代表第一个参数
type para669 struct {
	one  []int
	low  int
	high int
}

// ans 是答案
// one 代表第一个答案
type ans669 struct {
	one []int
}

func Test_Problem669(t *testing.T) {

	qs := []question669{

		{
			para669{[]int{1, 0, 2}, 1, 2},
			ans669{[]int{1, structures.NULL, 2}},
		},

		{
			para669{[]int{3, 0, 4, structures.NULL, 2, structures.NULL, structures.NULL, 1}, 1, 3},
			ans669{[]int{3, 2, structures.NULL, 1}},
		},

		{
			para669{[]int{1}, 1, 2},
			ans669{[]int{1}},
		},

		{
			para669{[]int{1, structures.NULL, 2}, 1, 3},
			ans669{[]int{1, structures.NULL, 2}},
		},

		{
			para669{[]int{1, structures.NULL, 2}, 2, 4},
			ans669{[]int{2}},
		},
	}

	fmt.Printf("------------------------Leetcode Problem 669------------------------\n")

	for _, q := range qs {
		_, p := q.ans669, q.para669
		fmt.Printf("【input】:%v      ", p)
		root := structures.Ints2TreeNode(p.one)
		fmt.Printf("【output】:%v      \n", structures.Tree2ints(trimBST(root, p.low, p.high)))
	}
	fmt.Printf("\n\n\n")
}