更新helper助手和README.md

Author: aQua

Algorithms/0016.3sum-closest/3sum-closest_test.go

@@ -41,6 +41,6 @@ func Test_Problem0016(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go

@@ -41,6 +41,6 @@ func Test_Problem0017(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0018.4sum/4sum_test.go

@@ -41,6 +41,6 @@ func Test_Problem0018(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go

@@ -41,6 +41,6 @@ func Test_Problem0019(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0020.valid-parentheses/valid-parentheses_test.go

@@ -41,6 +41,6 @@ func Test_Problem0020(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go

@@ -41,6 +41,6 @@ func Test_Problem0021(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0022.generate-parentheses/generate-parentheses_test.go

@@ -41,6 +41,6 @@ func Test_Problem0022(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go

@@ -41,6 +41,6 @@ func Test_Problem0023(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go

@@ -41,6 +41,6 @@ func Test_Problem0024(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go

@@ -41,6 +41,6 @@ func Test_Problem0025(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go

@@ -41,6 +41,6 @@ func Test_Problem0026(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0027.remove-element/remove-element_test.go

@@ -41,6 +41,6 @@ func Test_Problem0027(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0028.implement-strstr/implement-strstr_test.go

@@ -41,6 +41,6 @@ func Test_Problem0028(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0029.divide-two-integers/divide-two-integers_test.go

@@ -41,6 +41,6 @@ func Test_Problem0029(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go

@@ -41,6 +41,6 @@ func Test_Problem0030(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0031.next-permutation/next-permutation_test.go

@@ -41,6 +41,6 @@ func Test_Problem0031(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go

@@ -41,6 +41,6 @@ func Test_Problem0032(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go

@@ -41,6 +41,6 @@ func Test_Problem0033(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0034.search-for-a-range/search-for-a-range_test.go

@@ -41,6 +41,6 @@ func Test_Problem0034(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0035.search-insert-position/search-insert-position_test.go

@@ -41,6 +41,6 @@ func Test_Problem0035(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0036.valid-sudoku/valid-sudoku_test.go

@@ -41,6 +41,6 @@ func Test_Problem0036(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0037.sudoku-solver/sudoku-solver_test.go

@@ -41,6 +41,6 @@ func Test_Problem0037(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0038.count-and-say/count-and-say_test.go

@@ -41,6 +41,6 @@ func Test_Problem0038(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0039.combination-sum/combination-sum_test.go

@@ -41,6 +41,6 @@ func Test_Problem0039(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go

@@ -41,6 +41,6 @@ func Test_Problem0040(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0041.first-missing-positive/first-missing-positive_test.go

@@ -41,6 +41,6 @@ func Test_Problem0041(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go

@@ -41,6 +41,6 @@ func Test_Problem0042(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0043.multiply-strings/multiply-strings_test.go

@@ -41,6 +41,6 @@ func Test_Problem0043(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0044.wildcard-matching/wildcard-matching_test.go

@@ -41,6 +41,6 @@ func Test_Problem0044(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0045.jump-game-ii/jump-game-ii_test.go

@@ -41,6 +41,6 @@ func Test_Problem0045(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0046.permutations/permutations_test.go

@@ -41,6 +41,6 @@ func Test_Problem0046(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0047.permutations-ii/permutations-ii_test.go

@@ -41,6 +41,6 @@ func Test_Problem0047(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0048.rotate-image/rotate-image_test.go

@@ -41,6 +41,6 @@ func Test_Problem0048(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0049.group-anagrams/group-anagrams_test.go

@@ -41,6 +41,6 @@ func Test_Problem0049(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0050.powx-n/powx-n_test.go

@@ -41,6 +41,6 @@ func Test_Problem0050(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0051.n-queens/n-queens_test.go

@@ -41,6 +41,6 @@ func Test_Problem0051(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0052.n-queens-ii/n-queens-ii_test.go

@@ -41,6 +41,6 @@ func Test_Problem0052(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0053.maximum-subarray/maximum-subarray_test.go

@@ -41,6 +41,6 @@ func Test_Problem0053(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0054.spiral-matrix/spiral-matrix_test.go

@@ -41,6 +41,6 @@ func Test_Problem0054(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

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

@@ -41,6 +41,6 @@ func Test_Problem0055(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0056.merge-intervals/merge-intervals_test.go

@@ -41,6 +41,6 @@ func Test_Problem0056(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0057.insert-interval/insert-interval_test.go

@@ -41,6 +41,6 @@ func Test_Problem0057(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0058.length-of-last-word/length-of-last-word_test.go

@@ -41,6 +41,6 @@ func Test_Problem0058(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go

@@ -41,6 +41,6 @@ func Test_Problem0059(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0060.permutation-sequence/permutation-sequence_test.go

@@ -41,6 +41,6 @@ func Test_Problem0060(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0061.rotate-list/rotate-list_test.go

@@ -41,6 +41,6 @@ func Test_Problem0061(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0062.unique-paths/unique-paths_test.go

@@ -41,6 +41,6 @@ func Test_Problem0062(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go

@@ -41,6 +41,6 @@ func Test_Problem0063(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go

@@ -41,6 +41,6 @@ func Test_Problem0064(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }

Algorithms/0065.valid-number/valid-number_test.go

@@ -41,6 +41,6 @@ func Test_Problem0065(t *testing.T) {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%!s(MISSING)", p)
+		ast.Equal(a.one, (p.one), "输入:%v", p)
 	}
 }