LeetCode-Go/leetcode/0594.Longest-Harmonious-Subsequence/594. Longest Harmonious Subsequence_test.go

package leetcode

import (
	"fmt"
	"testing"
)

type question594 struct {
	para594
	ans594
}

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

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

func Test_Problem594(t *testing.T) {

	qs := []question594{

		{
			para594{[]int{1, 3, 2, 2, 5, 2, 3, 7}},
			ans594{5},
		},
	}

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

	for _, q := range qs {
		_, p := q.ans594, q.para594
		fmt.Printf("【input】:%v       【output】:%v\n", p, findLHS(p.one))
	}
	fmt.Printf("\n\n\n")
}