Update test

Author: halfrost

leetcode/0005.Longest-Palindromic-Substring/5. Longest Palindromic Substring_test.go

@@ -61,7 +61,8 @@ func Test_Problem5(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans5, q.para5
-		fmt.Printf("【input】:%v       【output】:%v\n", p, longestPalindrome(p.s))
+		fmt.Printf("【input】:%v       【output】:%v %v %v %v\n", p,
+			longestPalindrome(p.s), longestPalindrome1(p.s), longestPalindrome2(p.s), longestPalindrome3(p.s))
 	}
 	fmt.Printf("\n\n\n")
 }

leetcode/0231.Power-of-Two/231. Power of Two_test.go

@@ -46,7 +46,8 @@ func Test_Problem231(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans231, q.para231
-		fmt.Printf("【input】:%v       【output】:%v\n", p, isPowerOfTwo(p.one))
+		fmt.Printf("【input】:%v       【output】:%v %v %v %v\n", p,
+			isPowerOfTwo(p.one), isPowerOfTwo1(p.one), isPowerOfTwo2(p.one), isPowerOfTwo3(p.one))
 	}
 	fmt.Printf("\n\n\n")
 }

leetcode/0509.Fibonacci-Number/509. Fibonacci Number_test.go

@@ -47,7 +47,9 @@ func Test_Problem509(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans509, q.para509
-		fmt.Printf("【input】:%v       【output】:%v\n", p, fib(p.one))
+		// 覆盖全部解法（fib2 经 memoize、fib4 经 matrixPower/multiply、fib6 经 fibb 间接覆盖）
+		fmt.Printf("【input】:%v       【output】:%v %v %v %v %v %v %v\n", p,
+			fib(p.one), fib1(p.one), fib2(p.one), fib3(p.one), fib4(p.one), fib5(p.one), fib6(p.one))
 	}
 	fmt.Printf("\n\n\n")
 }