diff --git a/Algorithms/0016.3sum-closest/3sum-closest_test.go b/Algorithms/0016.3sum-closest/3sum-closest_test.go index a1e233c01..060ff601c 100755 --- a/Algorithms/0016.3sum-closest/3sum-closest_test.go +++ b/Algorithms/0016.3sum-closest/3sum-closest_test.go @@ -32,13 +32,14 @@ func Test_Problem0016(t *testing.T) { para{""}, ans{""}, }, - + // 如需多个测试，可以复制上方元素。 } for _, q := range qs { a, p := q.ans, q.para + fmt.Printf("~~%v~~\n", p) - ast.Equal(a.one, (p.one), "输入:%v", p) + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go b/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go index 7f82b2a11..28959fc7c 100755 --- a/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go +++ b/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0017(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0018.4sum/4sum_test.go b/Algorithms/0018.4sum/4sum_test.go index 5311e5c49..908eb6f82 100755 --- a/Algorithms/0018.4sum/4sum_test.go +++ b/Algorithms/0018.4sum/4sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0018(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go b/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go index 15f4f1e50..75d079298 100755 --- a/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go +++ b/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0019(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0020.valid-parentheses/valid-parentheses_test.go b/Algorithms/0020.valid-parentheses/valid-parentheses_test.go index 43eae149a..dd009219d 100755 --- a/Algorithms/0020.valid-parentheses/valid-parentheses_test.go +++ b/Algorithms/0020.valid-parentheses/valid-parentheses_test.go @@ -38,7 +38,8 @@ func Test_Problem0020(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go b/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go index b577af463..7d5f7e6ff 100755 --- a/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go +++ b/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go @@ -38,7 +38,8 @@ func Test_Problem0021(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0022.generate-parentheses/generate-parentheses_test.go b/Algorithms/0022.generate-parentheses/generate-parentheses_test.go index cb1d25618..410571ad0 100755 --- a/Algorithms/0022.generate-parentheses/generate-parentheses_test.go +++ b/Algorithms/0022.generate-parentheses/generate-parentheses_test.go @@ -38,7 +38,8 @@ func Test_Problem0022(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go b/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go index 1620274c4..cd3dff8da 100755 --- a/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go +++ b/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go @@ -38,7 +38,8 @@ func Test_Problem0023(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go b/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go index 0b192f38e..0a5b427db 100755 --- a/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go +++ b/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go @@ -38,7 +38,8 @@ func Test_Problem0024(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go b/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go index 545cb2c4f..18ae58e8a 100755 --- a/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go +++ b/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go @@ -38,7 +38,8 @@ func Test_Problem0025(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go b/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go index 0d28491ed..eae7e49ac 100755 --- a/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go +++ b/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0026(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0027.remove-element/remove-element_test.go b/Algorithms/0027.remove-element/remove-element_test.go index d569c8263..056bd4057 100755 --- a/Algorithms/0027.remove-element/remove-element_test.go +++ b/Algorithms/0027.remove-element/remove-element_test.go @@ -38,7 +38,8 @@ func Test_Problem0027(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0028.implement-strstr/implement-strstr_test.go b/Algorithms/0028.implement-strstr/implement-strstr_test.go index 3ea677b21..cb741cae1 100755 --- a/Algorithms/0028.implement-strstr/implement-strstr_test.go +++ b/Algorithms/0028.implement-strstr/implement-strstr_test.go @@ -38,7 +38,8 @@ func Test_Problem0028(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0029.divide-two-integers/divide-two-integers_test.go b/Algorithms/0029.divide-two-integers/divide-two-integers_test.go index 37302df22..40e3bd65b 100755 --- a/Algorithms/0029.divide-two-integers/divide-two-integers_test.go +++ b/Algorithms/0029.divide-two-integers/divide-two-integers_test.go @@ -38,7 +38,8 @@ func Test_Problem0029(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go b/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go index 3c73cb114..fdf4da1af 100755 --- a/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go +++ b/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go @@ -38,7 +38,8 @@ func Test_Problem0030(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0031.next-permutation/next-permutation_test.go b/Algorithms/0031.next-permutation/next-permutation_test.go index 0576db265..2c75f5048 100755 --- a/Algorithms/0031.next-permutation/next-permutation_test.go +++ b/Algorithms/0031.next-permutation/next-permutation_test.go @@ -38,7 +38,8 @@ func Test_Problem0031(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go b/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go index 0a258250c..87a91c06c 100755 --- a/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go +++ b/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go @@ -38,7 +38,8 @@ func Test_Problem0032(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go b/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go index 30a593ce8..b9d0c6033 100755 --- a/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go +++ b/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0033(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0034.search-for-a-range/search-for-a-range_test.go b/Algorithms/0034.search-for-a-range/search-for-a-range_test.go index c6e1d2ec1..f7d289b87 100755 --- a/Algorithms/0034.search-for-a-range/search-for-a-range_test.go +++ b/Algorithms/0034.search-for-a-range/search-for-a-range_test.go @@ -38,7 +38,8 @@ func Test_Problem0034(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0035.search-insert-position/search-insert-position_test.go b/Algorithms/0035.search-insert-position/search-insert-position_test.go index f5ad22940..ae53c2099 100755 --- a/Algorithms/0035.search-insert-position/search-insert-position_test.go +++ b/Algorithms/0035.search-insert-position/search-insert-position_test.go @@ -38,7 +38,8 @@ func Test_Problem0035(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0036.valid-sudoku/valid-sudoku_test.go b/Algorithms/0036.valid-sudoku/valid-sudoku_test.go index 5dc7a0284..9e36c6d00 100755 --- a/Algorithms/0036.valid-sudoku/valid-sudoku_test.go +++ b/Algorithms/0036.valid-sudoku/valid-sudoku_test.go @@ -38,7 +38,8 @@ func Test_Problem0036(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0037.sudoku-solver/sudoku-solver_test.go b/Algorithms/0037.sudoku-solver/sudoku-solver_test.go index d27af8571..3a5d7e633 100755 --- a/Algorithms/0037.sudoku-solver/sudoku-solver_test.go +++ b/Algorithms/0037.sudoku-solver/sudoku-solver_test.go @@ -38,7 +38,8 @@ func Test_Problem0037(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0038.count-and-say/count-and-say_test.go b/Algorithms/0038.count-and-say/count-and-say_test.go index 6ea8a5dd5..8ddc8b322 100755 --- a/Algorithms/0038.count-and-say/count-and-say_test.go +++ b/Algorithms/0038.count-and-say/count-and-say_test.go @@ -38,7 +38,8 @@ func Test_Problem0038(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0039.combination-sum/combination-sum_test.go b/Algorithms/0039.combination-sum/combination-sum_test.go index d4bca4f06..6ec05fd20 100755 --- a/Algorithms/0039.combination-sum/combination-sum_test.go +++ b/Algorithms/0039.combination-sum/combination-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0039(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go b/Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go index a70f2e691..6921f7c01 100755 --- a/Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go +++ b/Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0040(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0041.first-missing-positive/first-missing-positive_test.go b/Algorithms/0041.first-missing-positive/first-missing-positive_test.go index 42cf0b405..a2253129e 100755 --- a/Algorithms/0041.first-missing-positive/first-missing-positive_test.go +++ b/Algorithms/0041.first-missing-positive/first-missing-positive_test.go @@ -38,7 +38,8 @@ func Test_Problem0041(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go b/Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go index 973311776..8c116bcce 100755 --- a/Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go +++ b/Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go @@ -38,7 +38,8 @@ func Test_Problem0042(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0043.multiply-strings/multiply-strings_test.go b/Algorithms/0043.multiply-strings/multiply-strings_test.go index c0344edf3..07a133818 100755 --- a/Algorithms/0043.multiply-strings/multiply-strings_test.go +++ b/Algorithms/0043.multiply-strings/multiply-strings_test.go @@ -38,7 +38,8 @@ func Test_Problem0043(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0044.wildcard-matching/wildcard-matching_test.go b/Algorithms/0044.wildcard-matching/wildcard-matching_test.go index 87cf87fde..f42fba8ee 100755 --- a/Algorithms/0044.wildcard-matching/wildcard-matching_test.go +++ b/Algorithms/0044.wildcard-matching/wildcard-matching_test.go @@ -38,7 +38,8 @@ func Test_Problem0044(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0045.jump-game-ii/jump-game-ii_test.go b/Algorithms/0045.jump-game-ii/jump-game-ii_test.go index 35cae7f4f..7f3b81de8 100755 --- a/Algorithms/0045.jump-game-ii/jump-game-ii_test.go +++ b/Algorithms/0045.jump-game-ii/jump-game-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0045(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0046.permutations/permutations_test.go b/Algorithms/0046.permutations/permutations_test.go index f2ec5a3d4..df29fd5ec 100755 --- a/Algorithms/0046.permutations/permutations_test.go +++ b/Algorithms/0046.permutations/permutations_test.go @@ -38,7 +38,8 @@ func Test_Problem0046(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0047.permutations-ii/permutations-ii_test.go b/Algorithms/0047.permutations-ii/permutations-ii_test.go index a903a648a..b198f5554 100755 --- a/Algorithms/0047.permutations-ii/permutations-ii_test.go +++ b/Algorithms/0047.permutations-ii/permutations-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0047(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0048.rotate-image/rotate-image_test.go b/Algorithms/0048.rotate-image/rotate-image_test.go index 0303145a9..a12e0f3e2 100755 --- a/Algorithms/0048.rotate-image/rotate-image_test.go +++ b/Algorithms/0048.rotate-image/rotate-image_test.go @@ -38,7 +38,8 @@ func Test_Problem0048(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0049.group-anagrams/group-anagrams_test.go b/Algorithms/0049.group-anagrams/group-anagrams_test.go index 374201637..15cec511d 100755 --- a/Algorithms/0049.group-anagrams/group-anagrams_test.go +++ b/Algorithms/0049.group-anagrams/group-anagrams_test.go @@ -38,7 +38,8 @@ func Test_Problem0049(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0050.powx-n/powx-n_test.go b/Algorithms/0050.powx-n/powx-n_test.go index 9adce1fc6..180b99947 100755 --- a/Algorithms/0050.powx-n/powx-n_test.go +++ b/Algorithms/0050.powx-n/powx-n_test.go @@ -38,7 +38,8 @@ func Test_Problem0050(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0051.n-queens/n-queens_test.go b/Algorithms/0051.n-queens/n-queens_test.go index 447a3c538..9d23a6c82 100755 --- a/Algorithms/0051.n-queens/n-queens_test.go +++ b/Algorithms/0051.n-queens/n-queens_test.go @@ -38,7 +38,8 @@ func Test_Problem0051(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0052.n-queens-ii/n-queens-ii_test.go b/Algorithms/0052.n-queens-ii/n-queens-ii_test.go index 02a4f0194..d83a5aefa 100755 --- a/Algorithms/0052.n-queens-ii/n-queens-ii_test.go +++ b/Algorithms/0052.n-queens-ii/n-queens-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0052(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0053.maximum-subarray/maximum-subarray_test.go b/Algorithms/0053.maximum-subarray/maximum-subarray_test.go index 57f34e52a..9e4250a50 100755 --- a/Algorithms/0053.maximum-subarray/maximum-subarray_test.go +++ b/Algorithms/0053.maximum-subarray/maximum-subarray_test.go @@ -38,7 +38,8 @@ func Test_Problem0053(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0054.spiral-matrix/spiral-matrix_test.go b/Algorithms/0054.spiral-matrix/spiral-matrix_test.go index c63c4c73b..7ea12dad0 100755 --- a/Algorithms/0054.spiral-matrix/spiral-matrix_test.go +++ b/Algorithms/0054.spiral-matrix/spiral-matrix_test.go @@ -38,7 +38,8 @@ func Test_Problem0054(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0055.jump-game/jump-game_test.go b/Algorithms/0055.jump-game/jump-game_test.go index cab854863..7790d93e4 100755 --- a/Algorithms/0055.jump-game/jump-game_test.go +++ b/Algorithms/0055.jump-game/jump-game_test.go @@ -38,7 +38,8 @@ func Test_Problem0055(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0056.merge-intervals/merge-intervals_test.go b/Algorithms/0056.merge-intervals/merge-intervals_test.go index 8d1b98cfb..4a833ba60 100755 --- a/Algorithms/0056.merge-intervals/merge-intervals_test.go +++ b/Algorithms/0056.merge-intervals/merge-intervals_test.go @@ -38,7 +38,8 @@ func Test_Problem0056(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0057.insert-interval/insert-interval_test.go b/Algorithms/0057.insert-interval/insert-interval_test.go index 15f4db894..55118dde1 100755 --- a/Algorithms/0057.insert-interval/insert-interval_test.go +++ b/Algorithms/0057.insert-interval/insert-interval_test.go @@ -38,7 +38,8 @@ func Test_Problem0057(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0058.length-of-last-word/length-of-last-word_test.go b/Algorithms/0058.length-of-last-word/length-of-last-word_test.go index 9939e02ae..b6bd55568 100755 --- a/Algorithms/0058.length-of-last-word/length-of-last-word_test.go +++ b/Algorithms/0058.length-of-last-word/length-of-last-word_test.go @@ -38,7 +38,8 @@ func Test_Problem0058(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go b/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go index bc7ad5d02..9e2f7b5ff 100755 --- a/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go +++ b/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0059(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0060.permutation-sequence/permutation-sequence_test.go b/Algorithms/0060.permutation-sequence/permutation-sequence_test.go index 4e4f6237e..4d1a34f41 100755 --- a/Algorithms/0060.permutation-sequence/permutation-sequence_test.go +++ b/Algorithms/0060.permutation-sequence/permutation-sequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0060(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0061.rotate-list/rotate-list_test.go b/Algorithms/0061.rotate-list/rotate-list_test.go index c9d32b581..428c55c67 100755 --- a/Algorithms/0061.rotate-list/rotate-list_test.go +++ b/Algorithms/0061.rotate-list/rotate-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0061(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0062.unique-paths/unique-paths_test.go b/Algorithms/0062.unique-paths/unique-paths_test.go index 3f12401c7..198eecea9 100755 --- a/Algorithms/0062.unique-paths/unique-paths_test.go +++ b/Algorithms/0062.unique-paths/unique-paths_test.go @@ -38,7 +38,8 @@ func Test_Problem0062(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go b/Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go index 651f8c124..f674b5ce2 100755 --- a/Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go +++ b/Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0063(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go b/Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go index eb878ab28..f61aa73fa 100755 --- a/Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go +++ b/Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0064(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0065.valid-number/valid-number_test.go b/Algorithms/0065.valid-number/valid-number_test.go index 156ae6b9d..4ad257c14 100755 --- a/Algorithms/0065.valid-number/valid-number_test.go +++ b/Algorithms/0065.valid-number/valid-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0065(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0066.plus-one/plus-one_test.go b/Algorithms/0066.plus-one/plus-one_test.go index 9694231d0..8f47ea46a 100755 --- a/Algorithms/0066.plus-one/plus-one_test.go +++ b/Algorithms/0066.plus-one/plus-one_test.go @@ -38,7 +38,8 @@ func Test_Problem0066(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0067.add-binary/add-binary_test.go b/Algorithms/0067.add-binary/add-binary_test.go index 9732af4a8..06c9a3cf6 100755 --- a/Algorithms/0067.add-binary/add-binary_test.go +++ b/Algorithms/0067.add-binary/add-binary_test.go @@ -38,7 +38,8 @@ func Test_Problem0067(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0068.text-justification/text-justification_test.go b/Algorithms/0068.text-justification/text-justification_test.go index edb76937d..55cb00ee2 100755 --- a/Algorithms/0068.text-justification/text-justification_test.go +++ b/Algorithms/0068.text-justification/text-justification_test.go @@ -38,7 +38,8 @@ func Test_Problem0068(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0069.sqrtx/sqrtx_test.go b/Algorithms/0069.sqrtx/sqrtx_test.go index 20e3e3935..789b119a4 100755 --- a/Algorithms/0069.sqrtx/sqrtx_test.go +++ b/Algorithms/0069.sqrtx/sqrtx_test.go @@ -38,7 +38,8 @@ func Test_Problem0069(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0070.climbing-stairs/climbing-stairs_test.go b/Algorithms/0070.climbing-stairs/climbing-stairs_test.go index 8c29d19df..17503b68f 100755 --- a/Algorithms/0070.climbing-stairs/climbing-stairs_test.go +++ b/Algorithms/0070.climbing-stairs/climbing-stairs_test.go @@ -38,7 +38,8 @@ func Test_Problem0070(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0071.simplify-path/simplify-path_test.go b/Algorithms/0071.simplify-path/simplify-path_test.go index 09a6abbdb..56f2e2c6b 100755 --- a/Algorithms/0071.simplify-path/simplify-path_test.go +++ b/Algorithms/0071.simplify-path/simplify-path_test.go @@ -38,7 +38,8 @@ func Test_Problem0071(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0072.edit-distance/edit-distance_test.go b/Algorithms/0072.edit-distance/edit-distance_test.go index 820b6b041..669c4c4e4 100755 --- a/Algorithms/0072.edit-distance/edit-distance_test.go +++ b/Algorithms/0072.edit-distance/edit-distance_test.go @@ -38,7 +38,8 @@ func Test_Problem0072(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go b/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go index 3447f07f8..3157ab8db 100755 --- a/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go +++ b/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go @@ -38,7 +38,8 @@ func Test_Problem0073(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix_test.go b/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix_test.go index 422f1bc4a..48e1aa672 100755 --- a/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix_test.go +++ b/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix_test.go @@ -38,7 +38,8 @@ func Test_Problem0074(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0075.sort-colors/sort-colors_test.go b/Algorithms/0075.sort-colors/sort-colors_test.go index b04d849cc..b7c9cf1ee 100755 --- a/Algorithms/0075.sort-colors/sort-colors_test.go +++ b/Algorithms/0075.sort-colors/sort-colors_test.go @@ -38,7 +38,8 @@ func Test_Problem0075(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go b/Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go index 68fcb48cc..0e9fc70ae 100755 --- a/Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go +++ b/Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go @@ -38,7 +38,8 @@ func Test_Problem0076(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0077.combinations/combinations_test.go b/Algorithms/0077.combinations/combinations_test.go index 8c6115ced..9642f600e 100755 --- a/Algorithms/0077.combinations/combinations_test.go +++ b/Algorithms/0077.combinations/combinations_test.go @@ -38,7 +38,8 @@ func Test_Problem0077(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0078.subsets/subsets_test.go b/Algorithms/0078.subsets/subsets_test.go index c736a2b71..c59ac3bfa 100755 --- a/Algorithms/0078.subsets/subsets_test.go +++ b/Algorithms/0078.subsets/subsets_test.go @@ -38,7 +38,8 @@ func Test_Problem0078(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0079.word-search/word-search_test.go b/Algorithms/0079.word-search/word-search_test.go index 66a008459..8a1e338f1 100755 --- a/Algorithms/0079.word-search/word-search_test.go +++ b/Algorithms/0079.word-search/word-search_test.go @@ -38,7 +38,8 @@ func Test_Problem0079(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii_test.go b/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii_test.go index abe97c021..02455a3db 100755 --- a/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii_test.go +++ b/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0080(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii_test.go b/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii_test.go index 1d0fad46d..ce754ab10 100755 --- a/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii_test.go +++ b/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0081(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii_test.go b/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii_test.go index 4e3e25ea4..5e3bb0e7b 100755 --- a/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii_test.go +++ b/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0082(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list_test.go b/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list_test.go index ff146f2a6..53b0c70ca 100755 --- a/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list_test.go +++ b/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0083(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram_test.go b/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram_test.go index fb527d760..2e352bf0a 100755 --- a/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram_test.go +++ b/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram_test.go @@ -38,7 +38,8 @@ func Test_Problem0084(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go b/Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go index f1d8f15ae..29bbe5aee 100755 --- a/Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go +++ b/Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go @@ -38,7 +38,8 @@ func Test_Problem0085(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0086.partition-list/partition-list_test.go b/Algorithms/0086.partition-list/partition-list_test.go index 23ceff4f4..8b97a025b 100755 --- a/Algorithms/0086.partition-list/partition-list_test.go +++ b/Algorithms/0086.partition-list/partition-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0086(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0087.scramble-string/scramble-string_test.go b/Algorithms/0087.scramble-string/scramble-string_test.go index c3b230dff..d52bb5c1a 100755 --- a/Algorithms/0087.scramble-string/scramble-string_test.go +++ b/Algorithms/0087.scramble-string/scramble-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0087(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go b/Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go index de2ecd51f..fa2cb9665 100755 --- a/Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go +++ b/Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0088(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0089.gray-code/gray-code_test.go b/Algorithms/0089.gray-code/gray-code_test.go index a4790b3d6..caf4648aa 100755 --- a/Algorithms/0089.gray-code/gray-code_test.go +++ b/Algorithms/0089.gray-code/gray-code_test.go @@ -38,7 +38,8 @@ func Test_Problem0089(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0090.subsets-ii/subsets-ii_test.go b/Algorithms/0090.subsets-ii/subsets-ii_test.go index e14e0ab54..6182fd194 100755 --- a/Algorithms/0090.subsets-ii/subsets-ii_test.go +++ b/Algorithms/0090.subsets-ii/subsets-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0090(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0091.decode-ways/decode-ways_test.go b/Algorithms/0091.decode-ways/decode-ways_test.go index 832f470c0..59b22abb4 100755 --- a/Algorithms/0091.decode-ways/decode-ways_test.go +++ b/Algorithms/0091.decode-ways/decode-ways_test.go @@ -38,7 +38,8 @@ func Test_Problem0091(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii_test.go b/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii_test.go index 6d700c21f..ae2cf1a71 100755 --- a/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii_test.go +++ b/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0092(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go b/Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go index 579150c74..d81f2aa56 100755 --- a/Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go +++ b/Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go @@ -38,7 +38,8 @@ func Test_Problem0093(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal_test.go b/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal_test.go index d8ae36d55..465dcb9c9 100755 --- a/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal_test.go +++ b/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0094(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii_test.go b/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii_test.go index e1c34f011..2d7546be7 100755 --- a/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii_test.go +++ b/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0095(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees_test.go b/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees_test.go index 7eb7616fd..9dedaa499 100755 --- a/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees_test.go +++ b/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees_test.go @@ -38,7 +38,8 @@ func Test_Problem0096(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0097.interleaving-string/interleaving-string_test.go b/Algorithms/0097.interleaving-string/interleaving-string_test.go index e0bc0f422..174eb4fa5 100755 --- a/Algorithms/0097.interleaving-string/interleaving-string_test.go +++ b/Algorithms/0097.interleaving-string/interleaving-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0097(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree_test.go b/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree_test.go index 9c5bcee16..e197e6732 100755 --- a/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree_test.go +++ b/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0098(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree_test.go b/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree_test.go index bb605be1a..21ecec9f5 100755 --- a/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree_test.go +++ b/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0099(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0100.same-tree/same-tree_test.go b/Algorithms/0100.same-tree/same-tree_test.go index 9881d5c3e..9d9406a98 100755 --- a/Algorithms/0100.same-tree/same-tree_test.go +++ b/Algorithms/0100.same-tree/same-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0100(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0101.symmetric-tree/symmetric-tree_test.go b/Algorithms/0101.symmetric-tree/symmetric-tree_test.go index 963ed59fb..83e8edb22 100755 --- a/Algorithms/0101.symmetric-tree/symmetric-tree_test.go +++ b/Algorithms/0101.symmetric-tree/symmetric-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0101(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal_test.go b/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal_test.go index 1846a4e1e..6f98f24bd 100755 --- a/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal_test.go +++ b/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0102(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal_test.go b/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal_test.go index 5a6f4f8cd..d849d58eb 100755 --- a/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal_test.go +++ b/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0103(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree_test.go b/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree_test.go index 3b3e88fb1..49032edac 100755 --- a/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree_test.go +++ b/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0104(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal_test.go b/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal_test.go index 5593e02c7..19b71106b 100755 --- a/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal_test.go +++ b/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0105(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal_test.go b/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal_test.go index 5fca8295c..efd6977d7 100755 --- a/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal_test.go +++ b/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0106(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii_test.go b/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii_test.go index 5f18b1322..ef245c61c 100755 --- a/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii_test.go +++ b/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0107(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree_test.go b/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree_test.go index 8b47dbbe7..6d77889b4 100755 --- a/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree_test.go +++ b/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0108(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree_test.go b/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree_test.go index 82ddf3250..2ef6375e2 100755 --- a/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree_test.go +++ b/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0109(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go b/Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go index 820f15b42..c49561125 100755 --- a/Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go +++ b/Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0110(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree_test.go b/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree_test.go index 93d9e4df2..f3c0dde83 100755 --- a/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree_test.go +++ b/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0111(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0112.path-sum/path-sum_test.go b/Algorithms/0112.path-sum/path-sum_test.go index 8ba9be69d..6b2c413f1 100755 --- a/Algorithms/0112.path-sum/path-sum_test.go +++ b/Algorithms/0112.path-sum/path-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0112(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0113.path-sum-ii/path-sum-ii_test.go b/Algorithms/0113.path-sum-ii/path-sum-ii_test.go index d0edbb4f7..64a2b480e 100755 --- a/Algorithms/0113.path-sum-ii/path-sum-ii_test.go +++ b/Algorithms/0113.path-sum-ii/path-sum-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0113(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list_test.go b/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list_test.go index 5d45ddd64..8d747204b 100755 --- a/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list_test.go +++ b/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0114(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go b/Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go index 9a0737fba..756699100 100755 --- a/Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go +++ b/Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go @@ -38,7 +38,8 @@ func Test_Problem0115(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node_test.go b/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node_test.go index c97a7f657..d06f801a2 100755 --- a/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node_test.go +++ b/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node_test.go @@ -38,7 +38,8 @@ func Test_Problem0116(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii_test.go b/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii_test.go index 30be99e78..ee6bd848d 100755 --- a/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii_test.go +++ b/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0117(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0118.pascals-triangle/pascals-triangle_test.go b/Algorithms/0118.pascals-triangle/pascals-triangle_test.go index b20bc36aa..c75628330 100755 --- a/Algorithms/0118.pascals-triangle/pascals-triangle_test.go +++ b/Algorithms/0118.pascals-triangle/pascals-triangle_test.go @@ -38,7 +38,8 @@ func Test_Problem0118(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go b/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go index 1ad28aea1..6a5f050a6 100755 --- a/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go +++ b/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0119(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0120.triangle/triangle_test.go b/Algorithms/0120.triangle/triangle_test.go index 1d3bcd12d..d559e1afb 100755 --- a/Algorithms/0120.triangle/triangle_test.go +++ b/Algorithms/0120.triangle/triangle_test.go @@ -38,7 +38,8 @@ func Test_Problem0120(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock_test.go b/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock_test.go index 7387210fb..28a6a8dd8 100755 --- a/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock_test.go +++ b/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock_test.go @@ -38,7 +38,8 @@ func Test_Problem0121(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii_test.go b/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii_test.go index da8ee7df3..6ccc83a45 100755 --- a/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii_test.go +++ b/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0122(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii_test.go b/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii_test.go index 482b14a95..7fa27c0b4 100755 --- a/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii_test.go +++ b/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0123(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum_test.go b/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum_test.go index 16cb204d5..f18e9edbe 100755 --- a/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum_test.go +++ b/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0124(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0125.valid-palindrome/valid-palindrome_test.go b/Algorithms/0125.valid-palindrome/valid-palindrome_test.go index b9378b678..c36db6bcc 100755 --- a/Algorithms/0125.valid-palindrome/valid-palindrome_test.go +++ b/Algorithms/0125.valid-palindrome/valid-palindrome_test.go @@ -38,7 +38,8 @@ func Test_Problem0125(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go b/Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go index c0ac86706..157460787 100755 --- a/Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go +++ b/Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0126(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0127.word-ladder/word-ladder_test.go b/Algorithms/0127.word-ladder/word-ladder_test.go index ddc7f7866..cb7707091 100755 --- a/Algorithms/0127.word-ladder/word-ladder_test.go +++ b/Algorithms/0127.word-ladder/word-ladder_test.go @@ -38,7 +38,8 @@ func Test_Problem0127(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go b/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go index 6f825d773..acdf9d8ef 100755 --- a/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go +++ b/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0128(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers_test.go b/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers_test.go index 34021bb01..12c328e11 100755 --- a/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers_test.go +++ b/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers_test.go @@ -38,7 +38,8 @@ func Test_Problem0129(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0130.surrounded-regions/surrounded-regions_test.go b/Algorithms/0130.surrounded-regions/surrounded-regions_test.go index ad62dc633..6524e6644 100755 --- a/Algorithms/0130.surrounded-regions/surrounded-regions_test.go +++ b/Algorithms/0130.surrounded-regions/surrounded-regions_test.go @@ -38,7 +38,8 @@ func Test_Problem0130(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go b/Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go index f3367e061..cc8739d31 100755 --- a/Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go +++ b/Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go @@ -38,7 +38,8 @@ func Test_Problem0131(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go b/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go index 5f3d2e051..35df2bff9 100755 --- a/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go +++ b/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0132(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0133.clone-graph/clone-graph_test.go b/Algorithms/0133.clone-graph/clone-graph_test.go index 2e537baa4..3d297294b 100755 --- a/Algorithms/0133.clone-graph/clone-graph_test.go +++ b/Algorithms/0133.clone-graph/clone-graph_test.go @@ -38,7 +38,8 @@ func Test_Problem0133(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0134.gas-station/gas-station_test.go b/Algorithms/0134.gas-station/gas-station_test.go index 7553891df..25a6ab9a2 100755 --- a/Algorithms/0134.gas-station/gas-station_test.go +++ b/Algorithms/0134.gas-station/gas-station_test.go @@ -38,7 +38,8 @@ func Test_Problem0134(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0135.candy/candy_test.go b/Algorithms/0135.candy/candy_test.go index 4bb3a9464..795d230f2 100755 --- a/Algorithms/0135.candy/candy_test.go +++ b/Algorithms/0135.candy/candy_test.go @@ -38,7 +38,8 @@ func Test_Problem0135(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0136.single-number/single-number_test.go b/Algorithms/0136.single-number/single-number_test.go index ac6273f6a..96351eb78 100755 --- a/Algorithms/0136.single-number/single-number_test.go +++ b/Algorithms/0136.single-number/single-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0136(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0137.single-number-ii/single-number-ii_test.go b/Algorithms/0137.single-number-ii/single-number-ii_test.go index 90ccee679..5aaf0cd3d 100755 --- a/Algorithms/0137.single-number-ii/single-number-ii_test.go +++ b/Algorithms/0137.single-number-ii/single-number-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0137(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer_test.go b/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer_test.go index e94ea2304..4816148f7 100755 --- a/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer_test.go +++ b/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer_test.go @@ -38,7 +38,8 @@ func Test_Problem0138(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0139.word-break/word-break_test.go b/Algorithms/0139.word-break/word-break_test.go index 09d7687d3..a81e6975d 100755 --- a/Algorithms/0139.word-break/word-break_test.go +++ b/Algorithms/0139.word-break/word-break_test.go @@ -38,7 +38,8 @@ func Test_Problem0139(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0140.word-break-ii/word-break-ii_test.go b/Algorithms/0140.word-break-ii/word-break-ii_test.go index 77697e218..23f95df52 100755 --- a/Algorithms/0140.word-break-ii/word-break-ii_test.go +++ b/Algorithms/0140.word-break-ii/word-break-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0140(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go b/Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go index 3eb50e8e6..a2d8f599f 100755 --- a/Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go +++ b/Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go @@ -38,7 +38,8 @@ func Test_Problem0141(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii_test.go b/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii_test.go index f299ab82f..0070e8953 100755 --- a/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii_test.go +++ b/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0142(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0143.reorder-list/reorder-list_test.go b/Algorithms/0143.reorder-list/reorder-list_test.go index 18f2bfa67..621e51758 100755 --- a/Algorithms/0143.reorder-list/reorder-list_test.go +++ b/Algorithms/0143.reorder-list/reorder-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0143(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal_test.go b/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal_test.go index f81dc7e3c..ba0b8079e 100755 --- a/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal_test.go +++ b/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0144(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal_test.go b/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal_test.go index 8686d6202..1cef4821f 100755 --- a/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal_test.go +++ b/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0145(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0146.lru-cache/lru-cache_test.go b/Algorithms/0146.lru-cache/lru-cache_test.go index 68a64c830..3b28919a2 100755 --- a/Algorithms/0146.lru-cache/lru-cache_test.go +++ b/Algorithms/0146.lru-cache/lru-cache_test.go @@ -38,7 +38,8 @@ func Test_Problem0146(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go b/Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go index 5bc8af6bd..4eea7d0ba 100755 --- a/Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go +++ b/Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0147(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0148.sort-list/sort-list_test.go b/Algorithms/0148.sort-list/sort-list_test.go index a66ba2787..29415f63e 100755 --- a/Algorithms/0148.sort-list/sort-list_test.go +++ b/Algorithms/0148.sort-list/sort-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0148(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0149.max-points-on-a-line/max-points-on-a-line_test.go b/Algorithms/0149.max-points-on-a-line/max-points-on-a-line_test.go index caf925787..a2d8de9db 100755 --- a/Algorithms/0149.max-points-on-a-line/max-points-on-a-line_test.go +++ b/Algorithms/0149.max-points-on-a-line/max-points-on-a-line_test.go @@ -38,7 +38,8 @@ func Test_Problem0149(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation_test.go b/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation_test.go index ff77763ea..69fad4a4a 100755 --- a/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation_test.go +++ b/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation_test.go @@ -38,7 +38,8 @@ func Test_Problem0150(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string_test.go b/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string_test.go index 1ec4fa655..3e362bdec 100755 --- a/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string_test.go +++ b/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0151(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go b/Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go index 01294a4e6..c66e97393 100755 --- a/Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go +++ b/Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go @@ -38,7 +38,8 @@ func Test_Problem0152(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array_test.go b/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array_test.go index 04808e91f..e99c20970 100755 --- a/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array_test.go +++ b/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0153(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii_test.go b/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii_test.go index 47da2a8d9..5b6107b67 100755 --- a/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii_test.go +++ b/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0154(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0155.min-stack/min-stack_test.go b/Algorithms/0155.min-stack/min-stack_test.go index 297ff8a28..a730a0526 100755 --- a/Algorithms/0155.min-stack/min-stack_test.go +++ b/Algorithms/0155.min-stack/min-stack_test.go @@ -38,7 +38,8 @@ func Test_Problem0155(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down_test.go b/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down_test.go index 680fea988..c0e1700a7 100755 --- a/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down_test.go +++ b/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down_test.go @@ -38,7 +38,8 @@ func Test_Problem0156(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4_test.go b/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4_test.go index 55ab22993..a5600995a 100755 --- a/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4_test.go +++ b/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4_test.go @@ -38,7 +38,8 @@ func Test_Problem0157(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times_test.go b/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times_test.go index 375eb7683..ab0b10673 100755 --- a/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times_test.go +++ b/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times_test.go @@ -38,7 +38,8 @@ func Test_Problem0158(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters_test.go b/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters_test.go index b17805786..7c33bec3a 100755 --- a/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters_test.go +++ b/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters_test.go @@ -38,7 +38,8 @@ func Test_Problem0159(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists_test.go b/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists_test.go index a6b642fa7..4c172ba58 100755 --- a/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists_test.go +++ b/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists_test.go @@ -38,7 +38,8 @@ func Test_Problem0160(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0161.one-edit-distance/one-edit-distance_test.go b/Algorithms/0161.one-edit-distance/one-edit-distance_test.go index 195dca4a6..ee95df088 100755 --- a/Algorithms/0161.one-edit-distance/one-edit-distance_test.go +++ b/Algorithms/0161.one-edit-distance/one-edit-distance_test.go @@ -38,7 +38,8 @@ func Test_Problem0161(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0162.find-peak-element/find-peak-element_test.go b/Algorithms/0162.find-peak-element/find-peak-element_test.go index 529276186..cce8b4ca3 100755 --- a/Algorithms/0162.find-peak-element/find-peak-element_test.go +++ b/Algorithms/0162.find-peak-element/find-peak-element_test.go @@ -38,7 +38,8 @@ func Test_Problem0162(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0163.missing-ranges/missing-ranges_test.go b/Algorithms/0163.missing-ranges/missing-ranges_test.go index fe485aa97..6787f40bc 100755 --- a/Algorithms/0163.missing-ranges/missing-ranges_test.go +++ b/Algorithms/0163.missing-ranges/missing-ranges_test.go @@ -38,7 +38,8 @@ func Test_Problem0163(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0164.maximum-gap/maximum-gap_test.go b/Algorithms/0164.maximum-gap/maximum-gap_test.go index 04a4e039f..fefa1b53c 100755 --- a/Algorithms/0164.maximum-gap/maximum-gap_test.go +++ b/Algorithms/0164.maximum-gap/maximum-gap_test.go @@ -38,7 +38,8 @@ func Test_Problem0164(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go b/Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go index 46afdc76c..cde944a5a 100755 --- a/Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go +++ b/Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go @@ -38,7 +38,8 @@ func Test_Problem0165(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal_test.go b/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal_test.go index 299f43756..277c06eb2 100755 --- a/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal_test.go +++ b/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal_test.go @@ -38,7 +38,8 @@ func Test_Problem0166(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted_test.go b/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted_test.go index 75eb11dd0..9d82db834 100755 --- a/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted_test.go +++ b/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted_test.go @@ -38,7 +38,8 @@ func Test_Problem0167(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title_test.go b/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title_test.go index c5e77c31f..25f3258dd 100755 --- a/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title_test.go +++ b/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title_test.go @@ -38,7 +38,8 @@ func Test_Problem0168(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0169.majority-element/majority-element_test.go b/Algorithms/0169.majority-element/majority-element_test.go index 85a293bbb..13c3e4ab6 100755 --- a/Algorithms/0169.majority-element/majority-element_test.go +++ b/Algorithms/0169.majority-element/majority-element_test.go @@ -38,7 +38,8 @@ func Test_Problem0169(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design_test.go b/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design_test.go index e5bf8176d..273604b86 100755 --- a/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design_test.go +++ b/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design_test.go @@ -38,7 +38,8 @@ func Test_Problem0170(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number_test.go b/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number_test.go index 557e2d219..54df6b052 100755 --- a/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number_test.go +++ b/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0171(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go b/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go index 5e9913dd0..46827154b 100755 --- a/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go +++ b/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go @@ -38,7 +38,8 @@ func Test_Problem0172(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator_test.go b/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator_test.go index 218ae3970..9259defb6 100755 --- a/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator_test.go +++ b/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator_test.go @@ -38,7 +38,8 @@ func Test_Problem0173(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0174.dungeon-game/dungeon-game_test.go b/Algorithms/0174.dungeon-game/dungeon-game_test.go index de7f258ed..4b9def9dd 100755 --- a/Algorithms/0174.dungeon-game/dungeon-game_test.go +++ b/Algorithms/0174.dungeon-game/dungeon-game_test.go @@ -38,7 +38,8 @@ func Test_Problem0174(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0179.largest-number/largest-number_test.go b/Algorithms/0179.largest-number/largest-number_test.go index 9b4d020d8..8ce517aca 100755 --- a/Algorithms/0179.largest-number/largest-number_test.go +++ b/Algorithms/0179.largest-number/largest-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0179(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii_test.go b/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii_test.go index 84f66052c..cd0f2c575 100755 --- a/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii_test.go +++ b/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0186(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go b/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go index d7d22e226..85ee0b5b0 100755 --- a/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go +++ b/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go @@ -38,7 +38,8 @@ func Test_Problem0187(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv_test.go b/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv_test.go index 3acd650b2..dd2a13372 100755 --- a/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv_test.go +++ b/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv_test.go @@ -38,7 +38,8 @@ func Test_Problem0188(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0189.rotate-array/rotate-array_test.go b/Algorithms/0189.rotate-array/rotate-array_test.go index 77faeebfe..ead4ede61 100755 --- a/Algorithms/0189.rotate-array/rotate-array_test.go +++ b/Algorithms/0189.rotate-array/rotate-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0189(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0190.reverse-bits/reverse-bits_test.go b/Algorithms/0190.reverse-bits/reverse-bits_test.go index 9218f6141..6c2156b3f 100755 --- a/Algorithms/0190.reverse-bits/reverse-bits_test.go +++ b/Algorithms/0190.reverse-bits/reverse-bits_test.go @@ -38,7 +38,8 @@ func Test_Problem0190(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0191.number-of-1-bits/number-of-1-bits_test.go b/Algorithms/0191.number-of-1-bits/number-of-1-bits_test.go index 3859da9b9..78e967ad7 100755 --- a/Algorithms/0191.number-of-1-bits/number-of-1-bits_test.go +++ b/Algorithms/0191.number-of-1-bits/number-of-1-bits_test.go @@ -38,7 +38,8 @@ func Test_Problem0191(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0198.house-robber/house-robber_test.go b/Algorithms/0198.house-robber/house-robber_test.go index 29fba252a..908f978f0 100755 --- a/Algorithms/0198.house-robber/house-robber_test.go +++ b/Algorithms/0198.house-robber/house-robber_test.go @@ -38,7 +38,8 @@ func Test_Problem0198(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view_test.go b/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view_test.go index 042c85e9a..6afa0310d 100755 --- a/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view_test.go +++ b/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view_test.go @@ -38,7 +38,8 @@ func Test_Problem0199(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0200.number-of-islands/number-of-islands_test.go b/Algorithms/0200.number-of-islands/number-of-islands_test.go index 19b50afa1..5f850dc23 100755 --- a/Algorithms/0200.number-of-islands/number-of-islands_test.go +++ b/Algorithms/0200.number-of-islands/number-of-islands_test.go @@ -38,7 +38,8 @@ func Test_Problem0200(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range_test.go b/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range_test.go index 49e4f9cbc..dc8691189 100755 --- a/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range_test.go +++ b/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range_test.go @@ -38,7 +38,8 @@ func Test_Problem0201(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0202.happy-number/happy-number_test.go b/Algorithms/0202.happy-number/happy-number_test.go index 9e31a2142..1c882a3fd 100755 --- a/Algorithms/0202.happy-number/happy-number_test.go +++ b/Algorithms/0202.happy-number/happy-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0202(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements_test.go b/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements_test.go index a0c495e7d..e846efc15 100755 --- a/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements_test.go +++ b/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements_test.go @@ -38,7 +38,8 @@ func Test_Problem0203(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0204.count-primes/count-primes_test.go b/Algorithms/0204.count-primes/count-primes_test.go index 0eaf93231..066135e9a 100755 --- a/Algorithms/0204.count-primes/count-primes_test.go +++ b/Algorithms/0204.count-primes/count-primes_test.go @@ -38,7 +38,8 @@ func Test_Problem0204(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go b/Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go index 265e24b2e..74eb5779d 100755 --- a/Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go +++ b/Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go @@ -38,7 +38,8 @@ func Test_Problem0205(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go b/Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go index 3d02210ac..5537a918c 100755 --- a/Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go +++ b/Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0206(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0207.course-schedule/course-schedule_test.go b/Algorithms/0207.course-schedule/course-schedule_test.go index 9812af0d5..e062e65c7 100755 --- a/Algorithms/0207.course-schedule/course-schedule_test.go +++ b/Algorithms/0207.course-schedule/course-schedule_test.go @@ -38,7 +38,8 @@ func Test_Problem0207(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree_test.go b/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree_test.go index b8ffa1b5c..41a6d0a54 100755 --- a/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree_test.go +++ b/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0208(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum_test.go b/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum_test.go index 27c686a50..c30932f01 100755 --- a/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum_test.go +++ b/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0209(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go b/Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go index 31be63874..75a315fda 100755 --- a/Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go +++ b/Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0210(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design_test.go b/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design_test.go index 18d8f18d3..3c1e7a65b 100755 --- a/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design_test.go +++ b/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design_test.go @@ -38,7 +38,8 @@ func Test_Problem0211(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0212.word-search-ii/word-search-ii_test.go b/Algorithms/0212.word-search-ii/word-search-ii_test.go index e60536053..076a3fb68 100755 --- a/Algorithms/0212.word-search-ii/word-search-ii_test.go +++ b/Algorithms/0212.word-search-ii/word-search-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0212(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0213.house-robber-ii/house-robber-ii_test.go b/Algorithms/0213.house-robber-ii/house-robber-ii_test.go index d6a5717fa..586d0ab3f 100755 --- a/Algorithms/0213.house-robber-ii/house-robber-ii_test.go +++ b/Algorithms/0213.house-robber-ii/house-robber-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0213(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go b/Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go index cdda3c14d..53d4396b2 100755 --- a/Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go +++ b/Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go @@ -38,7 +38,8 @@ func Test_Problem0214(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array_test.go b/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array_test.go index c99256742..470f7d5a5 100755 --- a/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array_test.go +++ b/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0215(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go b/Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go index 69a666795..e88c2b127 100755 --- a/Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go +++ b/Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0216(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0217.contains-duplicate/contains-duplicate_test.go b/Algorithms/0217.contains-duplicate/contains-duplicate_test.go index 3e287756f..184d88a76 100755 --- a/Algorithms/0217.contains-duplicate/contains-duplicate_test.go +++ b/Algorithms/0217.contains-duplicate/contains-duplicate_test.go @@ -38,7 +38,8 @@ func Test_Problem0217(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go b/Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go index 4b6a54952..92a4aa1bd 100755 --- a/Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go +++ b/Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go @@ -38,7 +38,8 @@ func Test_Problem0218(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go b/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go index 1d0ed9fd2..237912948 100755 --- a/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go +++ b/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0219(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go b/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go index d2d21fabd..150d1b1b5 100755 --- a/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go +++ b/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0220(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0221.maximal-square/maximal-square_test.go b/Algorithms/0221.maximal-square/maximal-square_test.go index 3f2f31c57..637ecd711 100755 --- a/Algorithms/0221.maximal-square/maximal-square_test.go +++ b/Algorithms/0221.maximal-square/maximal-square_test.go @@ -38,7 +38,8 @@ func Test_Problem0221(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes_test.go b/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes_test.go index dcc48cdc7..3fa4bf3c1 100755 --- a/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes_test.go +++ b/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes_test.go @@ -38,7 +38,8 @@ func Test_Problem0222(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0223.rectangle-area/rectangle-area_test.go b/Algorithms/0223.rectangle-area/rectangle-area_test.go index 4f841e9b4..bcad3768b 100755 --- a/Algorithms/0223.rectangle-area/rectangle-area_test.go +++ b/Algorithms/0223.rectangle-area/rectangle-area_test.go @@ -38,7 +38,8 @@ func Test_Problem0223(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0224.basic-calculator/basic-calculator_test.go b/Algorithms/0224.basic-calculator/basic-calculator_test.go index 5616feb96..a980607c5 100755 --- a/Algorithms/0224.basic-calculator/basic-calculator_test.go +++ b/Algorithms/0224.basic-calculator/basic-calculator_test.go @@ -38,7 +38,8 @@ func Test_Problem0224(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues_test.go b/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues_test.go index cacba3248..cedae8245 100755 --- a/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues_test.go +++ b/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues_test.go @@ -38,7 +38,8 @@ func Test_Problem0225(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go b/Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go index c303b4a06..701df5d8b 100755 --- a/Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go +++ b/Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0226(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go b/Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go index daec3f2fb..30c0a7b53 100755 --- a/Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go +++ b/Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0227(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0228.summary-ranges/summary-ranges_test.go b/Algorithms/0228.summary-ranges/summary-ranges_test.go index 3d690cb19..2349d3e31 100755 --- a/Algorithms/0228.summary-ranges/summary-ranges_test.go +++ b/Algorithms/0228.summary-ranges/summary-ranges_test.go @@ -38,7 +38,8 @@ func Test_Problem0228(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0229.majority-element-ii/majority-element-ii_test.go b/Algorithms/0229.majority-element-ii/majority-element-ii_test.go index e0c0ad791..9b96b4818 100755 --- a/Algorithms/0229.majority-element-ii/majority-element-ii_test.go +++ b/Algorithms/0229.majority-element-ii/majority-element-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0229(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst_test.go b/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst_test.go index 1f01bcdd7..034c5043e 100755 --- a/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst_test.go +++ b/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst_test.go @@ -38,7 +38,8 @@ func Test_Problem0230(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0231.power-of-two/power-of-two_test.go b/Algorithms/0231.power-of-two/power-of-two_test.go index c6b4916a3..656ad4646 100755 --- a/Algorithms/0231.power-of-two/power-of-two_test.go +++ b/Algorithms/0231.power-of-two/power-of-two_test.go @@ -38,7 +38,8 @@ func Test_Problem0231(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks_test.go b/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks_test.go index 84d7bb6ea..65b446999 100755 --- a/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks_test.go +++ b/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks_test.go @@ -38,7 +38,8 @@ func Test_Problem0232(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0233.number-of-digit-one/number-of-digit-one_test.go b/Algorithms/0233.number-of-digit-one/number-of-digit-one_test.go index b512bb4ed..30f5078d8 100755 --- a/Algorithms/0233.number-of-digit-one/number-of-digit-one_test.go +++ b/Algorithms/0233.number-of-digit-one/number-of-digit-one_test.go @@ -38,7 +38,8 @@ func Test_Problem0233(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go b/Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go index 1af1fcd3f..e23420b97 100755 --- a/Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go +++ b/Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0234(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree_test.go b/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree_test.go index 87aa57440..7298adc5d 100755 --- a/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree_test.go +++ b/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0235(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree_test.go b/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree_test.go index fbd8fd620..ea4e2bbcd 100755 --- a/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree_test.go +++ b/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0236(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list_test.go b/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list_test.go index 00fb40e56..c8616010a 100755 --- a/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list_test.go +++ b/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0237(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0238.product-of-array-except-self/product-of-array-except-self_test.go b/Algorithms/0238.product-of-array-except-self/product-of-array-except-self_test.go index b74b29b25..cd0eb5d9f 100755 --- a/Algorithms/0238.product-of-array-except-self/product-of-array-except-self_test.go +++ b/Algorithms/0238.product-of-array-except-self/product-of-array-except-self_test.go @@ -38,7 +38,8 @@ func Test_Problem0238(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go b/Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go index f1ae126cc..a4844ea51 100755 --- a/Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go +++ b/Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go @@ -38,7 +38,8 @@ func Test_Problem0239(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii_test.go b/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii_test.go index a7b2bf69b..1cb3d611a 100755 --- a/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii_test.go +++ b/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0240(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses_test.go b/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses_test.go index 8f55e3e71..97a6f7bae 100755 --- a/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses_test.go +++ b/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses_test.go @@ -38,7 +38,8 @@ func Test_Problem0241(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0242.valid-anagram/valid-anagram_test.go b/Algorithms/0242.valid-anagram/valid-anagram_test.go index 7722f79e9..c944b7dd3 100755 --- a/Algorithms/0242.valid-anagram/valid-anagram_test.go +++ b/Algorithms/0242.valid-anagram/valid-anagram_test.go @@ -38,7 +38,8 @@ func Test_Problem0242(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go b/Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go index 3e4c58ee8..a02e2bf0c 100755 --- a/Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go +++ b/Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go @@ -38,7 +38,8 @@ func Test_Problem0243(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii_test.go b/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii_test.go index 3846f1a84..815611cf8 100755 --- a/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii_test.go +++ b/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0244(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii_test.go b/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii_test.go index 4084a48c7..3397a87b1 100755 --- a/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii_test.go +++ b/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0245(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go b/Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go index 3bf88efe3..fa3b2512d 100755 --- a/Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go +++ b/Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0246(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go b/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go index b35b536d8..f1d39608d 100755 --- a/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go +++ b/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0247(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go b/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go index eb9922fcc..a6889ee06 100755 --- a/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go +++ b/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0248(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go b/Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go index 31c6d10a2..7159325c8 100755 --- a/Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go +++ b/Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go @@ -38,7 +38,8 @@ func Test_Problem0249(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go b/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go index f05a04b87..ddef08fa4 100755 --- a/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go +++ b/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go @@ -38,7 +38,8 @@ func Test_Problem0250(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go b/Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go index c69e321b8..bb87c8525 100755 --- a/Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go +++ b/Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go @@ -38,7 +38,8 @@ func Test_Problem0251(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0252.meeting-rooms/meeting-rooms_test.go b/Algorithms/0252.meeting-rooms/meeting-rooms_test.go index eaad60229..889ff59be 100755 --- a/Algorithms/0252.meeting-rooms/meeting-rooms_test.go +++ b/Algorithms/0252.meeting-rooms/meeting-rooms_test.go @@ -38,7 +38,8 @@ func Test_Problem0252(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go b/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go index 79b3be31e..3dc26484e 100755 --- a/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go +++ b/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0253(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0254.factor-combinations/factor-combinations_test.go b/Algorithms/0254.factor-combinations/factor-combinations_test.go index bbd8697b8..2cb49ff35 100755 --- a/Algorithms/0254.factor-combinations/factor-combinations_test.go +++ b/Algorithms/0254.factor-combinations/factor-combinations_test.go @@ -38,7 +38,8 @@ func Test_Problem0254(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree_test.go b/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree_test.go index fc0d8eae6..04d80aa6d 100755 --- a/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree_test.go +++ b/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0255(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0256.paint-house/paint-house_test.go b/Algorithms/0256.paint-house/paint-house_test.go index 197e14d54..749c9b3ed 100755 --- a/Algorithms/0256.paint-house/paint-house_test.go +++ b/Algorithms/0256.paint-house/paint-house_test.go @@ -38,7 +38,8 @@ func Test_Problem0256(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go b/Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go index b1ca4343f..e2fd66f4c 100755 --- a/Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go +++ b/Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go @@ -38,7 +38,8 @@ func Test_Problem0257(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0258.add-digits/add-digits_test.go b/Algorithms/0258.add-digits/add-digits_test.go index 29c8aff03..313b9ce86 100755 --- a/Algorithms/0258.add-digits/add-digits_test.go +++ b/Algorithms/0258.add-digits/add-digits_test.go @@ -38,7 +38,8 @@ func Test_Problem0258(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0259.3sum-smaller/3sum-smaller_test.go b/Algorithms/0259.3sum-smaller/3sum-smaller_test.go index c2ee04557..e3fda2cf4 100755 --- a/Algorithms/0259.3sum-smaller/3sum-smaller_test.go +++ b/Algorithms/0259.3sum-smaller/3sum-smaller_test.go @@ -38,7 +38,8 @@ func Test_Problem0259(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0260.single-number-iii/single-number-iii_test.go b/Algorithms/0260.single-number-iii/single-number-iii_test.go index 494648fc8..707702554 100755 --- a/Algorithms/0260.single-number-iii/single-number-iii_test.go +++ b/Algorithms/0260.single-number-iii/single-number-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0260(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go b/Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go index 68608576b..b577d8edf 100755 --- a/Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go +++ b/Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0261(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0263.ugly-number/ugly-number_test.go b/Algorithms/0263.ugly-number/ugly-number_test.go index 082f7bb3e..983860fce 100755 --- a/Algorithms/0263.ugly-number/ugly-number_test.go +++ b/Algorithms/0263.ugly-number/ugly-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0263(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go b/Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go index 1885e05ca..fa787ed89 100755 --- a/Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go +++ b/Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0264(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0265.paint-house-ii/paint-house-ii_test.go b/Algorithms/0265.paint-house-ii/paint-house-ii_test.go index a32ca4ae3..fda8b06c1 100755 --- a/Algorithms/0265.paint-house-ii/paint-house-ii_test.go +++ b/Algorithms/0265.paint-house-ii/paint-house-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0265(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go b/Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go index fa44b9aaa..610acd2f2 100755 --- a/Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go +++ b/Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go @@ -38,7 +38,8 @@ func Test_Problem0266(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go b/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go index f9edac602..f901eab39 100755 --- a/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go +++ b/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0267(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0268.missing-number/missing-number_test.go b/Algorithms/0268.missing-number/missing-number_test.go index a3096b9f9..d7b664849 100755 --- a/Algorithms/0268.missing-number/missing-number_test.go +++ b/Algorithms/0268.missing-number/missing-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0268(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0269.alien-dictionary/alien-dictionary_test.go b/Algorithms/0269.alien-dictionary/alien-dictionary_test.go index c95fda761..25b2948eb 100755 --- a/Algorithms/0269.alien-dictionary/alien-dictionary_test.go +++ b/Algorithms/0269.alien-dictionary/alien-dictionary_test.go @@ -38,7 +38,8 @@ func Test_Problem0269(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value_test.go b/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value_test.go index 670198f04..437a00264 100755 --- a/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value_test.go +++ b/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value_test.go @@ -38,7 +38,8 @@ func Test_Problem0270(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings_test.go b/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings_test.go index 8fcd3cc32..8fe287f16 100755 --- a/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings_test.go +++ b/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings_test.go @@ -38,7 +38,8 @@ func Test_Problem0271(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii_test.go b/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii_test.go index 8510d29de..0b5f2ee92 100755 --- a/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii_test.go +++ b/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0272(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0273.integer-to-english-words/integer-to-english-words_test.go b/Algorithms/0273.integer-to-english-words/integer-to-english-words_test.go index 0f98b5702..634474d29 100755 --- a/Algorithms/0273.integer-to-english-words/integer-to-english-words_test.go +++ b/Algorithms/0273.integer-to-english-words/integer-to-english-words_test.go @@ -38,7 +38,8 @@ func Test_Problem0273(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0274.h-index/h-index_test.go b/Algorithms/0274.h-index/h-index_test.go index 0c051f7c7..a0b90f9fb 100755 --- a/Algorithms/0274.h-index/h-index_test.go +++ b/Algorithms/0274.h-index/h-index_test.go @@ -38,7 +38,8 @@ func Test_Problem0274(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0275.h-index-ii/h-index-ii_test.go b/Algorithms/0275.h-index-ii/h-index-ii_test.go index ada27ee5b..0de740e86 100755 --- a/Algorithms/0275.h-index-ii/h-index-ii_test.go +++ b/Algorithms/0275.h-index-ii/h-index-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0275(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0276.paint-fence/paint-fence_test.go b/Algorithms/0276.paint-fence/paint-fence_test.go index efc126360..cc1998c36 100755 --- a/Algorithms/0276.paint-fence/paint-fence_test.go +++ b/Algorithms/0276.paint-fence/paint-fence_test.go @@ -38,7 +38,8 @@ func Test_Problem0276(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go b/Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go index e542057ea..1593410a4 100755 --- a/Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go +++ b/Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go @@ -38,7 +38,8 @@ func Test_Problem0277(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0278.first-bad-version/first-bad-version_test.go b/Algorithms/0278.first-bad-version/first-bad-version_test.go index 235b02f4d..e6d7764ab 100755 --- a/Algorithms/0278.first-bad-version/first-bad-version_test.go +++ b/Algorithms/0278.first-bad-version/first-bad-version_test.go @@ -38,7 +38,8 @@ func Test_Problem0278(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0279.perfect-squares/perfect-squares_test.go b/Algorithms/0279.perfect-squares/perfect-squares_test.go index ba4780e30..eaab60913 100755 --- a/Algorithms/0279.perfect-squares/perfect-squares_test.go +++ b/Algorithms/0279.perfect-squares/perfect-squares_test.go @@ -38,7 +38,8 @@ func Test_Problem0279(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0280.wiggle-sort/wiggle-sort_test.go b/Algorithms/0280.wiggle-sort/wiggle-sort_test.go index fb77ad7de..14e8efeed 100755 --- a/Algorithms/0280.wiggle-sort/wiggle-sort_test.go +++ b/Algorithms/0280.wiggle-sort/wiggle-sort_test.go @@ -38,7 +38,8 @@ func Test_Problem0280(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go b/Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go index c38c5150e..123371dd0 100755 --- a/Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go +++ b/Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go @@ -38,7 +38,8 @@ func Test_Problem0281(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0282.expression-add-operators/expression-add-operators_test.go b/Algorithms/0282.expression-add-operators/expression-add-operators_test.go index 1c044f3a3..15c0c50d8 100755 --- a/Algorithms/0282.expression-add-operators/expression-add-operators_test.go +++ b/Algorithms/0282.expression-add-operators/expression-add-operators_test.go @@ -38,7 +38,8 @@ func Test_Problem0282(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0283.move-zeroes/move-zeroes_test.go b/Algorithms/0283.move-zeroes/move-zeroes_test.go index 6e900c342..ebfd186a6 100755 --- a/Algorithms/0283.move-zeroes/move-zeroes_test.go +++ b/Algorithms/0283.move-zeroes/move-zeroes_test.go @@ -38,7 +38,8 @@ func Test_Problem0283(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0284.peeking-iterator/peeking-iterator_test.go b/Algorithms/0284.peeking-iterator/peeking-iterator_test.go index 21ec94139..f099473fe 100755 --- a/Algorithms/0284.peeking-iterator/peeking-iterator_test.go +++ b/Algorithms/0284.peeking-iterator/peeking-iterator_test.go @@ -38,7 +38,8 @@ func Test_Problem0284(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst_test.go b/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst_test.go index 83f5a213d..5ebc11f5f 100755 --- a/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst_test.go +++ b/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst_test.go @@ -38,7 +38,8 @@ func Test_Problem0285(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0286.walls-and-gates/walls-and-gates_test.go b/Algorithms/0286.walls-and-gates/walls-and-gates_test.go index 94755bffe..ef66bf9bd 100755 --- a/Algorithms/0286.walls-and-gates/walls-and-gates_test.go +++ b/Algorithms/0286.walls-and-gates/walls-and-gates_test.go @@ -38,7 +38,8 @@ func Test_Problem0286(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number_test.go b/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number_test.go index 432ca192f..ab2237564 100755 --- a/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number_test.go +++ b/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0287(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go b/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go index 02d3b2f01..c35e2f44e 100755 --- a/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go +++ b/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go @@ -38,7 +38,8 @@ func Test_Problem0288(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0289.game-of-life/game-of-life_test.go b/Algorithms/0289.game-of-life/game-of-life_test.go index 96ed1f61a..3ca1a66b9 100755 --- a/Algorithms/0289.game-of-life/game-of-life_test.go +++ b/Algorithms/0289.game-of-life/game-of-life_test.go @@ -38,7 +38,8 @@ func Test_Problem0289(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0290.word-pattern/word-pattern_test.go b/Algorithms/0290.word-pattern/word-pattern_test.go index 022b1ea24..3b2094d86 100755 --- a/Algorithms/0290.word-pattern/word-pattern_test.go +++ b/Algorithms/0290.word-pattern/word-pattern_test.go @@ -38,7 +38,8 @@ func Test_Problem0290(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go b/Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go index 2aade19f6..0d4838ba4 100755 --- a/Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go +++ b/Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0291(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0292.nim-game/nim-game_test.go b/Algorithms/0292.nim-game/nim-game_test.go index ae47cd2bb..423fb336e 100755 --- a/Algorithms/0292.nim-game/nim-game_test.go +++ b/Algorithms/0292.nim-game/nim-game_test.go @@ -38,7 +38,8 @@ func Test_Problem0292(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0293.flip-game/flip-game_test.go b/Algorithms/0293.flip-game/flip-game_test.go index 899389919..b9656c7e0 100755 --- a/Algorithms/0293.flip-game/flip-game_test.go +++ b/Algorithms/0293.flip-game/flip-game_test.go @@ -38,7 +38,8 @@ func Test_Problem0293(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0294.flip-game-ii/flip-game-ii_test.go b/Algorithms/0294.flip-game-ii/flip-game-ii_test.go index a749bf62e..fb96f0e88 100755 --- a/Algorithms/0294.flip-game-ii/flip-game-ii_test.go +++ b/Algorithms/0294.flip-game-ii/flip-game-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0294(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream_test.go b/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream_test.go index 2b9166fc6..17ad4b3e4 100755 --- a/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream_test.go +++ b/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream_test.go @@ -38,7 +38,8 @@ func Test_Problem0295(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0296.best-meeting-point/best-meeting-point_test.go b/Algorithms/0296.best-meeting-point/best-meeting-point_test.go index 6085af6a5..923ef8f99 100755 --- a/Algorithms/0296.best-meeting-point/best-meeting-point_test.go +++ b/Algorithms/0296.best-meeting-point/best-meeting-point_test.go @@ -38,7 +38,8 @@ func Test_Problem0296(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree_test.go b/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree_test.go index d9b5795d9..324f912f5 100755 --- a/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree_test.go +++ b/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0297(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence_test.go b/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence_test.go index 3361357a4..f0b6221a9 100755 --- a/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence_test.go +++ b/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0298(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go b/Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go index 0025eaef3..3abcd99e1 100755 --- a/Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go +++ b/Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go @@ -38,7 +38,8 @@ func Test_Problem0299(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go b/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go index b5077c638..dd81a5d75 100755 --- a/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go +++ b/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0300(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go b/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go index 38ea951f3..68824dfcf 100755 --- a/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go +++ b/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go @@ -38,7 +38,8 @@ func Test_Problem0301(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels_test.go b/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels_test.go index 4eae0bdf2..c7c0b7a9a 100755 --- a/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels_test.go +++ b/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels_test.go @@ -38,7 +38,8 @@ func Test_Problem0302(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable_test.go b/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable_test.go index 8c5548826..4aa071efd 100755 --- a/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable_test.go +++ b/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable_test.go @@ -38,7 +38,8 @@ func Test_Problem0303(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable_test.go b/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable_test.go index fcde2ed50..675f454c3 100755 --- a/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable_test.go +++ b/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable_test.go @@ -38,7 +38,8 @@ func Test_Problem0304(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0305.number-of-islands-ii/number-of-islands-ii_test.go b/Algorithms/0305.number-of-islands-ii/number-of-islands-ii_test.go index 965d9b8eb..e8ace3cab 100755 --- a/Algorithms/0305.number-of-islands-ii/number-of-islands-ii_test.go +++ b/Algorithms/0305.number-of-islands-ii/number-of-islands-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0305(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0306.additive-number/additive-number_test.go b/Algorithms/0306.additive-number/additive-number_test.go index 87cd82d64..469d5db7c 100755 --- a/Algorithms/0306.additive-number/additive-number_test.go +++ b/Algorithms/0306.additive-number/additive-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0306(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable_test.go b/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable_test.go index 9e6179778..b0bfaae6d 100755 --- a/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable_test.go +++ b/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable_test.go @@ -38,7 +38,8 @@ func Test_Problem0307(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable_test.go b/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable_test.go index c4e39db3b..2f3df70d1 100755 --- a/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable_test.go +++ b/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable_test.go @@ -38,7 +38,8 @@ func Test_Problem0308(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown_test.go b/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown_test.go index 19d3601b5..5bf2b245b 100755 --- a/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown_test.go +++ b/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown_test.go @@ -38,7 +38,8 @@ func Test_Problem0309(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go b/Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go index 779fe1b06..896d4b18c 100755 --- a/Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go +++ b/Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go @@ -38,7 +38,8 @@ func Test_Problem0310(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go b/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go index 65474b1f7..2e34f49eb 100755 --- a/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go +++ b/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go @@ -38,7 +38,8 @@ func Test_Problem0311(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0312.burst-balloons/burst-balloons_test.go b/Algorithms/0312.burst-balloons/burst-balloons_test.go index 7706a7a17..0957b7ba6 100755 --- a/Algorithms/0312.burst-balloons/burst-balloons_test.go +++ b/Algorithms/0312.burst-balloons/burst-balloons_test.go @@ -38,7 +38,8 @@ func Test_Problem0312(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0313.super-ugly-number/super-ugly-number_test.go b/Algorithms/0313.super-ugly-number/super-ugly-number_test.go index 98a3f9057..259b37548 100755 --- a/Algorithms/0313.super-ugly-number/super-ugly-number_test.go +++ b/Algorithms/0313.super-ugly-number/super-ugly-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0313(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal_test.go b/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal_test.go index 94193fad3..0cfff714b 100755 --- a/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal_test.go +++ b/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal_test.go @@ -38,7 +38,8 @@ func Test_Problem0314(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self_test.go b/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self_test.go index d0b7806ef..9e456a839 100755 --- a/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self_test.go +++ b/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self_test.go @@ -38,7 +38,8 @@ func Test_Problem0315(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go b/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go index 7eb0e9a3f..650801452 100755 --- a/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go +++ b/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go @@ -38,7 +38,8 @@ func Test_Problem0316(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings_test.go b/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings_test.go index 25a3bb31c..beac40fdc 100755 --- a/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings_test.go +++ b/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings_test.go @@ -38,7 +38,8 @@ func Test_Problem0317(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths_test.go b/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths_test.go index 14cd7ea81..86c66c947 100755 --- a/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths_test.go +++ b/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths_test.go @@ -38,7 +38,8 @@ func Test_Problem0318(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0319.bulb-switcher/bulb-switcher_test.go b/Algorithms/0319.bulb-switcher/bulb-switcher_test.go index 46edfc732..3c2eb6576 100755 --- a/Algorithms/0319.bulb-switcher/bulb-switcher_test.go +++ b/Algorithms/0319.bulb-switcher/bulb-switcher_test.go @@ -38,7 +38,8 @@ func Test_Problem0319(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go b/Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go index dae92bcf0..9ee91df15 100755 --- a/Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go +++ b/Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go @@ -38,7 +38,8 @@ func Test_Problem0320(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0321.create-maximum-number/create-maximum-number_test.go b/Algorithms/0321.create-maximum-number/create-maximum-number_test.go index 77b0632af..cab2a3a72 100755 --- a/Algorithms/0321.create-maximum-number/create-maximum-number_test.go +++ b/Algorithms/0321.create-maximum-number/create-maximum-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0321(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0322.coin-change/coin-change_test.go b/Algorithms/0322.coin-change/coin-change_test.go index 009d3c76b..6fbf3c7d4 100755 --- a/Algorithms/0322.coin-change/coin-change_test.go +++ b/Algorithms/0322.coin-change/coin-change_test.go @@ -38,7 +38,8 @@ func Test_Problem0322(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph_test.go b/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph_test.go index a96d93aca..ec08187f8 100755 --- a/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph_test.go +++ b/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph_test.go @@ -38,7 +38,8 @@ func Test_Problem0323(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go b/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go index 91c53a304..bacee83e8 100755 --- a/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go +++ b/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0324(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k_test.go b/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k_test.go index 8318e38ab..796c98593 100755 --- a/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k_test.go +++ b/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k_test.go @@ -38,7 +38,8 @@ func Test_Problem0325(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0326.power-of-three/power-of-three_test.go b/Algorithms/0326.power-of-three/power-of-three_test.go index ad3586042..90d84f5d4 100755 --- a/Algorithms/0326.power-of-three/power-of-three_test.go +++ b/Algorithms/0326.power-of-three/power-of-three_test.go @@ -38,7 +38,8 @@ func Test_Problem0326(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0327.count-of-range-sum/count-of-range-sum_test.go b/Algorithms/0327.count-of-range-sum/count-of-range-sum_test.go index 90b51d77e..844a4d40b 100755 --- a/Algorithms/0327.count-of-range-sum/count-of-range-sum_test.go +++ b/Algorithms/0327.count-of-range-sum/count-of-range-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0327(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0328.odd-even-linked-list/odd-even-linked-list_test.go b/Algorithms/0328.odd-even-linked-list/odd-even-linked-list_test.go index 29bcad1aa..b95a213f6 100755 --- a/Algorithms/0328.odd-even-linked-list/odd-even-linked-list_test.go +++ b/Algorithms/0328.odd-even-linked-list/odd-even-linked-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0328(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix_test.go b/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix_test.go index 927c52a99..afc3307c1 100755 --- a/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix_test.go +++ b/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix_test.go @@ -38,7 +38,8 @@ func Test_Problem0329(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0330.patching-array/patching-array_test.go b/Algorithms/0330.patching-array/patching-array_test.go index cbc19e1cf..9af5b3ad6 100755 --- a/Algorithms/0330.patching-array/patching-array_test.go +++ b/Algorithms/0330.patching-array/patching-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0330(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree_test.go b/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree_test.go index da786f540..7dded6f9b 100755 --- a/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree_test.go +++ b/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0331(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go b/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go index 430abfd0f..8797f887c 100755 --- a/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go +++ b/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go @@ -38,7 +38,8 @@ func Test_Problem0332(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go b/Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go index 5be296075..9fd1b2428 100755 --- a/Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go +++ b/Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go @@ -38,7 +38,8 @@ func Test_Problem0333(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go b/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go index 2a1055c77..2cb048c8c 100755 --- a/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go +++ b/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0334(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0335.self-crossing/self-crossing_test.go b/Algorithms/0335.self-crossing/self-crossing_test.go index 7417a0181..c88199475 100755 --- a/Algorithms/0335.self-crossing/self-crossing_test.go +++ b/Algorithms/0335.self-crossing/self-crossing_test.go @@ -38,7 +38,8 @@ func Test_Problem0335(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go b/Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go index d05f0eab1..f2507b137 100755 --- a/Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go +++ b/Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go @@ -38,7 +38,8 @@ func Test_Problem0336(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0337.house-robber-iii/house-robber-iii_test.go b/Algorithms/0337.house-robber-iii/house-robber-iii_test.go index 7702db1e4..df2fd2ed6 100755 --- a/Algorithms/0337.house-robber-iii/house-robber-iii_test.go +++ b/Algorithms/0337.house-robber-iii/house-robber-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0337(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0338.counting-bits/counting-bits_test.go b/Algorithms/0338.counting-bits/counting-bits_test.go index c6a46e492..9820d4b0f 100755 --- a/Algorithms/0338.counting-bits/counting-bits_test.go +++ b/Algorithms/0338.counting-bits/counting-bits_test.go @@ -38,7 +38,8 @@ func Test_Problem0338(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum_test.go b/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum_test.go index ad784e001..984a69d3f 100755 --- a/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum_test.go +++ b/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0339(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters_test.go b/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters_test.go index c0d957467..c3e0ac3c6 100755 --- a/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters_test.go +++ b/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters_test.go @@ -38,7 +38,8 @@ func Test_Problem0340(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator_test.go b/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator_test.go index 5d8683875..cfd09a7a0 100755 --- a/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator_test.go +++ b/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator_test.go @@ -38,7 +38,8 @@ func Test_Problem0341(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0342.power-of-four/power-of-four_test.go b/Algorithms/0342.power-of-four/power-of-four_test.go index d2cebf775..ed62a4321 100755 --- a/Algorithms/0342.power-of-four/power-of-four_test.go +++ b/Algorithms/0342.power-of-four/power-of-four_test.go @@ -38,7 +38,8 @@ func Test_Problem0342(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0343.integer-break/integer-break_test.go b/Algorithms/0343.integer-break/integer-break_test.go index 5fe7444fe..f4dc91a43 100755 --- a/Algorithms/0343.integer-break/integer-break_test.go +++ b/Algorithms/0343.integer-break/integer-break_test.go @@ -38,7 +38,8 @@ func Test_Problem0343(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0344.reverse-string/reverse-string_test.go b/Algorithms/0344.reverse-string/reverse-string_test.go index 051f7f994..a9a9957b5 100755 --- a/Algorithms/0344.reverse-string/reverse-string_test.go +++ b/Algorithms/0344.reverse-string/reverse-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0344(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string_test.go b/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string_test.go index 6af27791b..c182eba6d 100755 --- a/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string_test.go +++ b/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0345(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream_test.go b/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream_test.go index 2f103e575..dccf5ee7d 100755 --- a/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream_test.go +++ b/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream_test.go @@ -38,7 +38,8 @@ func Test_Problem0346(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements_test.go b/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements_test.go index 6701b899d..2bf1136f5 100755 --- a/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements_test.go +++ b/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements_test.go @@ -38,7 +38,8 @@ func Test_Problem0347(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe_test.go b/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe_test.go index fed61ea0e..bb98ac2ef 100755 --- a/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe_test.go +++ b/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe_test.go @@ -38,7 +38,8 @@ func Test_Problem0348(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays_test.go b/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays_test.go index 26617e27b..ba8b9bf62 100755 --- a/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays_test.go +++ b/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays_test.go @@ -38,7 +38,8 @@ func Test_Problem0349(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii_test.go b/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii_test.go index 37bd000b7..63e2e323c 100755 --- a/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii_test.go +++ b/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0350(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go b/Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go index 950a5210f..aebd1d876 100755 --- a/Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go +++ b/Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go @@ -38,7 +38,8 @@ func Test_Problem0351(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals_test.go b/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals_test.go index ec48a36a0..3f406bfc9 100755 --- a/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals_test.go +++ b/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals_test.go @@ -38,7 +38,8 @@ func Test_Problem0352(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0353.design-snake-game/design-snake-game_test.go b/Algorithms/0353.design-snake-game/design-snake-game_test.go index a34e1f7fb..ad52abd13 100755 --- a/Algorithms/0353.design-snake-game/design-snake-game_test.go +++ b/Algorithms/0353.design-snake-game/design-snake-game_test.go @@ -38,7 +38,8 @@ func Test_Problem0353(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go b/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go index 4dfb90608..670db83c1 100755 --- a/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go +++ b/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go @@ -38,7 +38,8 @@ func Test_Problem0354(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0355.design-twitter/design-twitter_test.go b/Algorithms/0355.design-twitter/design-twitter_test.go index 54a9fbc5f..af86a7205 100755 --- a/Algorithms/0355.design-twitter/design-twitter_test.go +++ b/Algorithms/0355.design-twitter/design-twitter_test.go @@ -38,7 +38,8 @@ func Test_Problem0355(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0356.line-reflection/line-reflection_test.go b/Algorithms/0356.line-reflection/line-reflection_test.go index fad3a7f52..247c8a132 100755 --- a/Algorithms/0356.line-reflection/line-reflection_test.go +++ b/Algorithms/0356.line-reflection/line-reflection_test.go @@ -38,7 +38,8 @@ func Test_Problem0356(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits_test.go b/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits_test.go index 8cd665865..53b6658de 100755 --- a/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits_test.go +++ b/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits_test.go @@ -38,7 +38,8 @@ func Test_Problem0357(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart_test.go b/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart_test.go index 4f4e43461..2dc3e4289 100755 --- a/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart_test.go +++ b/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart_test.go @@ -38,7 +38,8 @@ func Test_Problem0358(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go b/Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go index 4ef35ab72..997b4c1c9 100755 --- a/Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go +++ b/Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go @@ -38,7 +38,8 @@ func Test_Problem0359(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go b/Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go index 54f884caf..dfb7c6abb 100755 --- a/Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go +++ b/Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0360(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0361.bomb-enemy/bomb-enemy_test.go b/Algorithms/0361.bomb-enemy/bomb-enemy_test.go index 85f2ae1f2..36b83297c 100755 --- a/Algorithms/0361.bomb-enemy/bomb-enemy_test.go +++ b/Algorithms/0361.bomb-enemy/bomb-enemy_test.go @@ -38,7 +38,8 @@ func Test_Problem0361(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0362.design-hit-counter/design-hit-counter_test.go b/Algorithms/0362.design-hit-counter/design-hit-counter_test.go index e603ed456..814ea4c26 100755 --- a/Algorithms/0362.design-hit-counter/design-hit-counter_test.go +++ b/Algorithms/0362.design-hit-counter/design-hit-counter_test.go @@ -38,7 +38,8 @@ func Test_Problem0362(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k_test.go b/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k_test.go index 690feb282..e929396dc 100755 --- a/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k_test.go +++ b/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k_test.go @@ -38,7 +38,8 @@ func Test_Problem0363(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii_test.go b/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii_test.go index 22b4ff13c..359ad84c0 100755 --- a/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii_test.go +++ b/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0364(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0365.water-and-jug-problem/water-and-jug-problem_test.go b/Algorithms/0365.water-and-jug-problem/water-and-jug-problem_test.go index 6e1c226f8..504a72ad2 100755 --- a/Algorithms/0365.water-and-jug-problem/water-and-jug-problem_test.go +++ b/Algorithms/0365.water-and-jug-problem/water-and-jug-problem_test.go @@ -38,7 +38,8 @@ func Test_Problem0365(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree_test.go b/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree_test.go index 167931436..e16411942 100755 --- a/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree_test.go +++ b/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0366(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go b/Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go index 47285552d..753e1c8a1 100755 --- a/Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go +++ b/Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go @@ -38,7 +38,8 @@ func Test_Problem0367(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go b/Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go index eed009697..9184684b2 100755 --- a/Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go +++ b/Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go @@ -38,7 +38,8 @@ func Test_Problem0368(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0369.plus-one-linked-list/plus-one-linked-list_test.go b/Algorithms/0369.plus-one-linked-list/plus-one-linked-list_test.go index 774f51da4..97c950b26 100755 --- a/Algorithms/0369.plus-one-linked-list/plus-one-linked-list_test.go +++ b/Algorithms/0369.plus-one-linked-list/plus-one-linked-list_test.go @@ -38,7 +38,8 @@ func Test_Problem0369(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0370.range-addition/range-addition_test.go b/Algorithms/0370.range-addition/range-addition_test.go index 7ef2341ec..d02adf2ff 100755 --- a/Algorithms/0370.range-addition/range-addition_test.go +++ b/Algorithms/0370.range-addition/range-addition_test.go @@ -38,7 +38,8 @@ func Test_Problem0370(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0371.sum-of-two-integers/sum-of-two-integers_test.go b/Algorithms/0371.sum-of-two-integers/sum-of-two-integers_test.go index 82c2ab2ff..78f7c2361 100755 --- a/Algorithms/0371.sum-of-two-integers/sum-of-two-integers_test.go +++ b/Algorithms/0371.sum-of-two-integers/sum-of-two-integers_test.go @@ -38,7 +38,8 @@ func Test_Problem0371(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0372.super-pow/super-pow_test.go b/Algorithms/0372.super-pow/super-pow_test.go index 8df63c3a8..ec41d53f0 100755 --- a/Algorithms/0372.super-pow/super-pow_test.go +++ b/Algorithms/0372.super-pow/super-pow_test.go @@ -38,7 +38,8 @@ func Test_Problem0372(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums_test.go b/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums_test.go index 3a3be82c9..d09aa818c 100755 --- a/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums_test.go +++ b/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums_test.go @@ -38,7 +38,8 @@ func Test_Problem0373(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower_test.go b/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower_test.go index d4521a04c..8618c3811 100755 --- a/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower_test.go +++ b/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower_test.go @@ -38,7 +38,8 @@ func Test_Problem0374(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii_test.go b/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii_test.go index 879bf6db8..d16706ad9 100755 --- a/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii_test.go +++ b/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0375(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go b/Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go index 273dbb38a..dc9c3efc4 100755 --- a/Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go +++ b/Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0376(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go b/Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go index dcdbd63a7..20e4d94f1 100755 --- a/Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go +++ b/Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go @@ -38,7 +38,8 @@ func Test_Problem0377(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix_test.go b/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix_test.go index f49029719..8d80f9864 100755 --- a/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix_test.go +++ b/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix_test.go @@ -38,7 +38,8 @@ func Test_Problem0378(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0379.design-phone-directory/design-phone-directory_test.go b/Algorithms/0379.design-phone-directory/design-phone-directory_test.go index 44feef68f..decb9348b 100755 --- a/Algorithms/0379.design-phone-directory/design-phone-directory_test.go +++ b/Algorithms/0379.design-phone-directory/design-phone-directory_test.go @@ -38,7 +38,8 @@ func Test_Problem0379(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1_test.go b/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1_test.go index cb4aa18c8..4c4ba93b2 100755 --- a/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1_test.go +++ b/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1_test.go @@ -38,7 +38,8 @@ func Test_Problem0380(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed_test.go b/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed_test.go index bd3c1d861..40f657be8 100755 --- a/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed_test.go +++ b/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed_test.go @@ -38,7 +38,8 @@ func Test_Problem0381(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0382.linked-list-random-node/linked-list-random-node_test.go b/Algorithms/0382.linked-list-random-node/linked-list-random-node_test.go index 2fd21b1a9..a2752e70b 100755 --- a/Algorithms/0382.linked-list-random-node/linked-list-random-node_test.go +++ b/Algorithms/0382.linked-list-random-node/linked-list-random-node_test.go @@ -38,7 +38,8 @@ func Test_Problem0382(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0383.ransom-note/ransom-note_test.go b/Algorithms/0383.ransom-note/ransom-note_test.go index df752aecf..541436eec 100755 --- a/Algorithms/0383.ransom-note/ransom-note_test.go +++ b/Algorithms/0383.ransom-note/ransom-note_test.go @@ -38,7 +38,8 @@ func Test_Problem0383(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go b/Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go index daa0ed996..7cbbf1e9a 100755 --- a/Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go +++ b/Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0384(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0385.mini-parser/mini-parser_test.go b/Algorithms/0385.mini-parser/mini-parser_test.go index 6c49225ed..400c1e832 100755 --- a/Algorithms/0385.mini-parser/mini-parser_test.go +++ b/Algorithms/0385.mini-parser/mini-parser_test.go @@ -38,7 +38,8 @@ func Test_Problem0385(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go b/Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go index 8cbb473ad..37b517209 100755 --- a/Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go +++ b/Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go @@ -38,7 +38,8 @@ func Test_Problem0386(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string_test.go b/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string_test.go index 07d0b30cc..e60eb2083 100755 --- a/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string_test.go +++ b/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0387(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path_test.go b/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path_test.go index 6288654b1..05ee42ff8 100755 --- a/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path_test.go +++ b/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path_test.go @@ -38,7 +38,8 @@ func Test_Problem0388(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0389.find-the-difference/find-the-difference_test.go b/Algorithms/0389.find-the-difference/find-the-difference_test.go index aa51257b8..30dc7e04d 100755 --- a/Algorithms/0389.find-the-difference/find-the-difference_test.go +++ b/Algorithms/0389.find-the-difference/find-the-difference_test.go @@ -38,7 +38,8 @@ func Test_Problem0389(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0390.elimination-game/elimination-game_test.go b/Algorithms/0390.elimination-game/elimination-game_test.go index ed0aacf91..f90ebf87d 100755 --- a/Algorithms/0390.elimination-game/elimination-game_test.go +++ b/Algorithms/0390.elimination-game/elimination-game_test.go @@ -38,7 +38,8 @@ func Test_Problem0390(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go b/Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go index cdda670a0..9ef9515fc 100755 --- a/Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go +++ b/Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go @@ -38,7 +38,8 @@ func Test_Problem0391(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0392.is-subsequence/is-subsequence_test.go b/Algorithms/0392.is-subsequence/is-subsequence_test.go index b0b932821..d6b23ceb4 100755 --- a/Algorithms/0392.is-subsequence/is-subsequence_test.go +++ b/Algorithms/0392.is-subsequence/is-subsequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0392(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0393.utf-8-validation/utf-8-validation_test.go b/Algorithms/0393.utf-8-validation/utf-8-validation_test.go index 4edf6798e..f3bac40e2 100755 --- a/Algorithms/0393.utf-8-validation/utf-8-validation_test.go +++ b/Algorithms/0393.utf-8-validation/utf-8-validation_test.go @@ -38,7 +38,8 @@ func Test_Problem0393(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0394.decode-string/decode-string_test.go b/Algorithms/0394.decode-string/decode-string_test.go index 29457ee76..3dd60e655 100755 --- a/Algorithms/0394.decode-string/decode-string_test.go +++ b/Algorithms/0394.decode-string/decode-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0394(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters_test.go b/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters_test.go index 2423194db..cc308f2d6 100755 --- a/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters_test.go +++ b/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters_test.go @@ -38,7 +38,8 @@ func Test_Problem0395(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0396.rotate-function/rotate-function_test.go b/Algorithms/0396.rotate-function/rotate-function_test.go index d0cbe156b..185ebf0dd 100755 --- a/Algorithms/0396.rotate-function/rotate-function_test.go +++ b/Algorithms/0396.rotate-function/rotate-function_test.go @@ -38,7 +38,8 @@ func Test_Problem0396(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0397.integer-replacement/integer-replacement_test.go b/Algorithms/0397.integer-replacement/integer-replacement_test.go index a062a701c..ecb9f59a9 100755 --- a/Algorithms/0397.integer-replacement/integer-replacement_test.go +++ b/Algorithms/0397.integer-replacement/integer-replacement_test.go @@ -38,7 +38,8 @@ func Test_Problem0397(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0398.random-pick-index/random-pick-index_test.go b/Algorithms/0398.random-pick-index/random-pick-index_test.go index 1b72329d9..ed2e168cc 100755 --- a/Algorithms/0398.random-pick-index/random-pick-index_test.go +++ b/Algorithms/0398.random-pick-index/random-pick-index_test.go @@ -38,7 +38,8 @@ func Test_Problem0398(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0399.evaluate-division/evaluate-division_test.go b/Algorithms/0399.evaluate-division/evaluate-division_test.go index 3d25d3001..c66d0baeb 100755 --- a/Algorithms/0399.evaluate-division/evaluate-division_test.go +++ b/Algorithms/0399.evaluate-division/evaluate-division_test.go @@ -38,7 +38,8 @@ func Test_Problem0399(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0400.nth-digit/nth-digit_test.go b/Algorithms/0400.nth-digit/nth-digit_test.go index ea09f34cb..da71fb1bd 100755 --- a/Algorithms/0400.nth-digit/nth-digit_test.go +++ b/Algorithms/0400.nth-digit/nth-digit_test.go @@ -38,7 +38,8 @@ func Test_Problem0400(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0401.binary-watch/binary-watch_test.go b/Algorithms/0401.binary-watch/binary-watch_test.go index a27d3059e..575d6935d 100755 --- a/Algorithms/0401.binary-watch/binary-watch_test.go +++ b/Algorithms/0401.binary-watch/binary-watch_test.go @@ -38,7 +38,8 @@ func Test_Problem0401(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0402.remove-k-digits/remove-k-digits_test.go b/Algorithms/0402.remove-k-digits/remove-k-digits_test.go index 6fcc97139..c17432e0e 100755 --- a/Algorithms/0402.remove-k-digits/remove-k-digits_test.go +++ b/Algorithms/0402.remove-k-digits/remove-k-digits_test.go @@ -38,7 +38,8 @@ func Test_Problem0402(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0403.frog-jump/frog-jump_test.go b/Algorithms/0403.frog-jump/frog-jump_test.go index fd6461050..c0d3840b2 100755 --- a/Algorithms/0403.frog-jump/frog-jump_test.go +++ b/Algorithms/0403.frog-jump/frog-jump_test.go @@ -38,7 +38,8 @@ func Test_Problem0403(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves_test.go b/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves_test.go index 177369462..121e24b08 100755 --- a/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves_test.go +++ b/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves_test.go @@ -38,7 +38,8 @@ func Test_Problem0404(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal_test.go b/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal_test.go index 708b173df..256cc3582 100755 --- a/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal_test.go +++ b/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal_test.go @@ -38,7 +38,8 @@ func Test_Problem0405(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height_test.go b/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height_test.go index adb5134f7..8db76c35d 100755 --- a/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height_test.go +++ b/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height_test.go @@ -38,7 +38,8 @@ func Test_Problem0406(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii_test.go b/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii_test.go index 2fbbd678c..e1deb8ae1 100755 --- a/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii_test.go +++ b/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0407(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go b/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go index c468e480c..2cb4e69fd 100755 --- a/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go +++ b/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go @@ -38,7 +38,8 @@ func Test_Problem0408(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0409.longest-palindrome/longest-palindrome_test.go b/Algorithms/0409.longest-palindrome/longest-palindrome_test.go index e0a4beb86..14ecdec77 100755 --- a/Algorithms/0409.longest-palindrome/longest-palindrome_test.go +++ b/Algorithms/0409.longest-palindrome/longest-palindrome_test.go @@ -38,7 +38,8 @@ func Test_Problem0409(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0410.split-array-largest-sum/split-array-largest-sum_test.go b/Algorithms/0410.split-array-largest-sum/split-array-largest-sum_test.go index 95d03945d..c60d06e4c 100755 --- a/Algorithms/0410.split-array-largest-sum/split-array-largest-sum_test.go +++ b/Algorithms/0410.split-array-largest-sum/split-array-largest-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0410(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation_test.go b/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation_test.go index b65f969b7..f68f4f000 100755 --- a/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation_test.go +++ b/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation_test.go @@ -38,7 +38,8 @@ func Test_Problem0411(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0412.fizz-buzz/fizz-buzz_test.go b/Algorithms/0412.fizz-buzz/fizz-buzz_test.go index 882d18cd8..696121d52 100755 --- a/Algorithms/0412.fizz-buzz/fizz-buzz_test.go +++ b/Algorithms/0412.fizz-buzz/fizz-buzz_test.go @@ -38,7 +38,8 @@ func Test_Problem0412(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go b/Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go index 0c3ce24d7..a7c7f4c9b 100755 --- a/Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go +++ b/Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go @@ -38,7 +38,8 @@ func Test_Problem0413(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0414.third-maximum-number/third-maximum-number_test.go b/Algorithms/0414.third-maximum-number/third-maximum-number_test.go index 7c0ee3375..46cf8aa77 100755 --- a/Algorithms/0414.third-maximum-number/third-maximum-number_test.go +++ b/Algorithms/0414.third-maximum-number/third-maximum-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0414(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0415.add-strings/add-strings_test.go b/Algorithms/0415.add-strings/add-strings_test.go index 616922ab6..89adeda0a 100755 --- a/Algorithms/0415.add-strings/add-strings_test.go +++ b/Algorithms/0415.add-strings/add-strings_test.go @@ -38,7 +38,8 @@ func Test_Problem0415(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum_test.go b/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum_test.go index f38a9c107..6131443cb 100755 --- a/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum_test.go +++ b/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0416(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow_test.go b/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow_test.go index 659f4f34a..ad3e39d1c 100755 --- a/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow_test.go +++ b/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow_test.go @@ -38,7 +38,8 @@ func Test_Problem0417(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go b/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go index 8c6bb6b9e..822185e23 100755 --- a/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go +++ b/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go @@ -38,7 +38,8 @@ func Test_Problem0418(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0419.battleships-in-a-board/battleships-in-a-board_test.go b/Algorithms/0419.battleships-in-a-board/battleships-in-a-board_test.go index 0415de618..205ae44af 100755 --- a/Algorithms/0419.battleships-in-a-board/battleships-in-a-board_test.go +++ b/Algorithms/0419.battleships-in-a-board/battleships-in-a-board_test.go @@ -38,7 +38,8 @@ func Test_Problem0419(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0420.strong-password-checker/strong-password-checker_test.go b/Algorithms/0420.strong-password-checker/strong-password-checker_test.go index 5ed400e20..6384abda0 100755 --- a/Algorithms/0420.strong-password-checker/strong-password-checker_test.go +++ b/Algorithms/0420.strong-password-checker/strong-password-checker_test.go @@ -38,7 +38,8 @@ func Test_Problem0420(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array_test.go b/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array_test.go index 361afeaa6..d9cd6de44 100755 --- a/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array_test.go +++ b/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0421(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0422.valid-word-square/valid-word-square_test.go b/Algorithms/0422.valid-word-square/valid-word-square_test.go index 42fa17b00..f475026f9 100755 --- a/Algorithms/0422.valid-word-square/valid-word-square_test.go +++ b/Algorithms/0422.valid-word-square/valid-word-square_test.go @@ -38,7 +38,8 @@ func Test_Problem0422(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english_test.go b/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english_test.go index 4ece4670f..9d79556d5 100755 --- a/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english_test.go +++ b/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english_test.go @@ -38,7 +38,8 @@ func Test_Problem0423(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement_test.go b/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement_test.go index 004c6a507..0cbfffccf 100755 --- a/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement_test.go +++ b/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement_test.go @@ -38,7 +38,8 @@ func Test_Problem0424(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0425.word-squares/word-squares_test.go b/Algorithms/0425.word-squares/word-squares_test.go index 38e9858ec..224623bc7 100755 --- a/Algorithms/0425.word-squares/word-squares_test.go +++ b/Algorithms/0425.word-squares/word-squares_test.go @@ -38,7 +38,8 @@ func Test_Problem0425(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0432.all-oone-data-structure/all-oone-data-structure_test.go b/Algorithms/0432.all-oone-data-structure/all-oone-data-structure_test.go index da85f4af6..751716ada 100755 --- a/Algorithms/0432.all-oone-data-structure/all-oone-data-structure_test.go +++ b/Algorithms/0432.all-oone-data-structure/all-oone-data-structure_test.go @@ -38,7 +38,8 @@ func Test_Problem0432(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string_test.go b/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string_test.go index fe85556ca..59c9517be 100755 --- a/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string_test.go +++ b/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0434(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go b/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go index 612380bb3..1da399e7f 100755 --- a/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go +++ b/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go @@ -38,7 +38,8 @@ func Test_Problem0435(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0436.find-right-interval/find-right-interval_test.go b/Algorithms/0436.find-right-interval/find-right-interval_test.go index 572936f7a..acc3d9489 100755 --- a/Algorithms/0436.find-right-interval/find-right-interval_test.go +++ b/Algorithms/0436.find-right-interval/find-right-interval_test.go @@ -38,7 +38,8 @@ func Test_Problem0436(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0437.path-sum-iii/path-sum-iii_test.go b/Algorithms/0437.path-sum-iii/path-sum-iii_test.go index 2e55e0534..6b70712c8 100755 --- a/Algorithms/0437.path-sum-iii/path-sum-iii_test.go +++ b/Algorithms/0437.path-sum-iii/path-sum-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0437(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string_test.go b/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string_test.go index 78cf6f033..e01b2f52d 100755 --- a/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string_test.go +++ b/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0438(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go b/Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go index e810b633c..245abc774 100755 --- a/Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go +++ b/Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go @@ -38,7 +38,8 @@ func Test_Problem0439(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order_test.go b/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order_test.go index 04c56acd7..1054ba8dc 100755 --- a/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order_test.go +++ b/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order_test.go @@ -38,7 +38,8 @@ func Test_Problem0440(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0441.arranging-coins/arranging-coins_test.go b/Algorithms/0441.arranging-coins/arranging-coins_test.go index 37d9c171b..3c40b825f 100755 --- a/Algorithms/0441.arranging-coins/arranging-coins_test.go +++ b/Algorithms/0441.arranging-coins/arranging-coins_test.go @@ -38,7 +38,8 @@ func Test_Problem0441(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array_test.go b/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array_test.go index 43d048e3c..cf363d128 100755 --- a/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array_test.go +++ b/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0442(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go b/Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go index ab583b2c9..b77792d37 100755 --- a/Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go +++ b/Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go @@ -38,7 +38,8 @@ func Test_Problem0444(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii_test.go b/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii_test.go index c65d8433b..dc5ac3a17 100755 --- a/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii_test.go +++ b/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0445(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence_test.go b/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence_test.go index 32bf9e778..9ff43f9fd 100755 --- a/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence_test.go +++ b/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0446(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go b/Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go index 2a162f32e..a21b830e2 100755 --- a/Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go +++ b/Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go @@ -38,7 +38,8 @@ func Test_Problem0447(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array_test.go b/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array_test.go index ca4b7346e..934c43321 100755 --- a/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array_test.go +++ b/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0448(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst_test.go b/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst_test.go index 44147e907..a3cdb52e1 100755 --- a/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst_test.go +++ b/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst_test.go @@ -38,7 +38,8 @@ func Test_Problem0449(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst_test.go b/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst_test.go index 14b18edf9..ad19d2226 100755 --- a/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst_test.go +++ b/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst_test.go @@ -38,7 +38,8 @@ func Test_Problem0450(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency_test.go b/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency_test.go index 319f7dc63..dbdbb6cd5 100755 --- a/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency_test.go +++ b/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency_test.go @@ -38,7 +38,8 @@ func Test_Problem0451(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons_test.go b/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons_test.go index 8197421ae..e35e30f88 100755 --- a/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons_test.go +++ b/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons_test.go @@ -38,7 +38,8 @@ func Test_Problem0452(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements_test.go b/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements_test.go index b89b4e495..23b5610b1 100755 --- a/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements_test.go +++ b/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements_test.go @@ -38,7 +38,8 @@ func Test_Problem0453(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0454.4sum-ii/4sum-ii_test.go b/Algorithms/0454.4sum-ii/4sum-ii_test.go index a01377c13..bc30e110a 100755 --- a/Algorithms/0454.4sum-ii/4sum-ii_test.go +++ b/Algorithms/0454.4sum-ii/4sum-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0454(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0455.assign-cookies/assign-cookies_test.go b/Algorithms/0455.assign-cookies/assign-cookies_test.go index e0724e0da..951a9fc99 100755 --- a/Algorithms/0455.assign-cookies/assign-cookies_test.go +++ b/Algorithms/0455.assign-cookies/assign-cookies_test.go @@ -38,7 +38,8 @@ func Test_Problem0455(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0456.132-pattern/132-pattern_test.go b/Algorithms/0456.132-pattern/132-pattern_test.go index 3b88e40f9..5baee386a 100755 --- a/Algorithms/0456.132-pattern/132-pattern_test.go +++ b/Algorithms/0456.132-pattern/132-pattern_test.go @@ -38,7 +38,8 @@ func Test_Problem0456(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go b/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go index ed19b7ea4..278890ccf 100755 --- a/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go +++ b/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go @@ -38,7 +38,8 @@ func Test_Problem0459(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0460.lfu-cache/lfu-cache_test.go b/Algorithms/0460.lfu-cache/lfu-cache_test.go index e66fd0b23..20548d853 100755 --- a/Algorithms/0460.lfu-cache/lfu-cache_test.go +++ b/Algorithms/0460.lfu-cache/lfu-cache_test.go @@ -38,7 +38,8 @@ func Test_Problem0460(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0461.hamming-distance/hamming-distance_test.go b/Algorithms/0461.hamming-distance/hamming-distance_test.go index a65033a39..e1e19e9a1 100755 --- a/Algorithms/0461.hamming-distance/hamming-distance_test.go +++ b/Algorithms/0461.hamming-distance/hamming-distance_test.go @@ -38,7 +38,8 @@ func Test_Problem0461(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii_test.go b/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii_test.go index 8bb536cc5..0399f99d4 100755 --- a/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii_test.go +++ b/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0462(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0463.island-perimeter/island-perimeter_test.go b/Algorithms/0463.island-perimeter/island-perimeter_test.go index 388242c95..462620df2 100755 --- a/Algorithms/0463.island-perimeter/island-perimeter_test.go +++ b/Algorithms/0463.island-perimeter/island-perimeter_test.go @@ -38,7 +38,8 @@ func Test_Problem0463(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0464.can-i-win/can-i-win_test.go b/Algorithms/0464.can-i-win/can-i-win_test.go index 13cfd7809..a83b8318b 100755 --- a/Algorithms/0464.can-i-win/can-i-win_test.go +++ b/Algorithms/0464.can-i-win/can-i-win_test.go @@ -38,7 +38,8 @@ func Test_Problem0464(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go b/Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go index 6968c3700..a53169a8b 100755 --- a/Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go +++ b/Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go @@ -38,7 +38,8 @@ func Test_Problem0465(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go b/Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go index 62ef5fad6..b78372b1a 100755 --- a/Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go +++ b/Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go @@ -38,7 +38,8 @@ func Test_Problem0466(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string_test.go b/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string_test.go index 6e4daa542..e1219950e 100755 --- a/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string_test.go +++ b/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0467(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0468.validate-ip-address/validate-ip-address_test.go b/Algorithms/0468.validate-ip-address/validate-ip-address_test.go index 107aa7bfb..2ce18c980 100755 --- a/Algorithms/0468.validate-ip-address/validate-ip-address_test.go +++ b/Algorithms/0468.validate-ip-address/validate-ip-address_test.go @@ -38,7 +38,8 @@ func Test_Problem0468(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0469.convex-polygon/convex-polygon_test.go b/Algorithms/0469.convex-polygon/convex-polygon_test.go index ad98df240..839eef2a5 100755 --- a/Algorithms/0469.convex-polygon/convex-polygon_test.go +++ b/Algorithms/0469.convex-polygon/convex-polygon_test.go @@ -38,7 +38,8 @@ func Test_Problem0469(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length_test.go b/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length_test.go index 46ccb9c31..46c4bb175 100755 --- a/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length_test.go +++ b/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length_test.go @@ -38,7 +38,8 @@ func Test_Problem0471(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0472.concatenated-words/concatenated-words_test.go b/Algorithms/0472.concatenated-words/concatenated-words_test.go index dd2e4215b..266cea68e 100755 --- a/Algorithms/0472.concatenated-words/concatenated-words_test.go +++ b/Algorithms/0472.concatenated-words/concatenated-words_test.go @@ -38,7 +38,8 @@ func Test_Problem0472(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go b/Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go index e96432f47..82a509d0c 100755 --- a/Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go +++ b/Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go @@ -38,7 +38,8 @@ func Test_Problem0473(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go b/Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go index e3007c4a8..940e99e1b 100755 --- a/Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go +++ b/Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go @@ -38,7 +38,8 @@ func Test_Problem0474(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0475.heaters/heaters_test.go b/Algorithms/0475.heaters/heaters_test.go index 011047874..ad088f44d 100755 --- a/Algorithms/0475.heaters/heaters_test.go +++ b/Algorithms/0475.heaters/heaters_test.go @@ -38,7 +38,8 @@ func Test_Problem0475(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0476.number-complement/number-complement_test.go b/Algorithms/0476.number-complement/number-complement_test.go index b39c78127..14afa3ad9 100755 --- a/Algorithms/0476.number-complement/number-complement_test.go +++ b/Algorithms/0476.number-complement/number-complement_test.go @@ -38,7 +38,8 @@ func Test_Problem0476(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go b/Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go index 11bc46ac8..48c15c401 100755 --- a/Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go +++ b/Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go @@ -38,7 +38,8 @@ func Test_Problem0477(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go b/Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go index 62c49ad5f..e488676fd 100755 --- a/Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go +++ b/Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go @@ -38,7 +38,8 @@ func Test_Problem0479(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0480.sliding-window-median/sliding-window-median_test.go b/Algorithms/0480.sliding-window-median/sliding-window-median_test.go index d0dd1a14a..809d1a14d 100755 --- a/Algorithms/0480.sliding-window-median/sliding-window-median_test.go +++ b/Algorithms/0480.sliding-window-median/sliding-window-median_test.go @@ -38,7 +38,8 @@ func Test_Problem0480(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0481.magical-string/magical-string_test.go b/Algorithms/0481.magical-string/magical-string_test.go index 3a21483db..be89a1148 100755 --- a/Algorithms/0481.magical-string/magical-string_test.go +++ b/Algorithms/0481.magical-string/magical-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0481(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0482.license-key-formatting/license-key-formatting_test.go b/Algorithms/0482.license-key-formatting/license-key-formatting_test.go index 7239b5854..721ebdee7 100755 --- a/Algorithms/0482.license-key-formatting/license-key-formatting_test.go +++ b/Algorithms/0482.license-key-formatting/license-key-formatting_test.go @@ -38,7 +38,8 @@ func Test_Problem0482(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0483.smallest-good-base/smallest-good-base_test.go b/Algorithms/0483.smallest-good-base/smallest-good-base_test.go index 5e20f6cc9..e1415a5ae 100755 --- a/Algorithms/0483.smallest-good-base/smallest-good-base_test.go +++ b/Algorithms/0483.smallest-good-base/smallest-good-base_test.go @@ -38,7 +38,8 @@ func Test_Problem0483(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0484.find-permutation/find-permutation_test.go b/Algorithms/0484.find-permutation/find-permutation_test.go index ad065086f..b9321964a 100755 --- a/Algorithms/0484.find-permutation/find-permutation_test.go +++ b/Algorithms/0484.find-permutation/find-permutation_test.go @@ -38,7 +38,8 @@ func Test_Problem0484(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go b/Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go index 016bea594..193d4a537 100755 --- a/Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go +++ b/Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go @@ -38,7 +38,8 @@ func Test_Problem0485(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0486.predict-the-winner/predict-the-winner_test.go b/Algorithms/0486.predict-the-winner/predict-the-winner_test.go index 8ad5ba84e..64a881e70 100755 --- a/Algorithms/0486.predict-the-winner/predict-the-winner_test.go +++ b/Algorithms/0486.predict-the-winner/predict-the-winner_test.go @@ -38,7 +38,8 @@ func Test_Problem0486(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii_test.go b/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii_test.go index e2c858c66..31f949851 100755 --- a/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii_test.go +++ b/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0487(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0488.zuma-game/zuma-game_test.go b/Algorithms/0488.zuma-game/zuma-game_test.go index c36198966..4cc823011 100755 --- a/Algorithms/0488.zuma-game/zuma-game_test.go +++ b/Algorithms/0488.zuma-game/zuma-game_test.go @@ -38,7 +38,8 @@ func Test_Problem0488(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0490.the-maze/the-maze_test.go b/Algorithms/0490.the-maze/the-maze_test.go index 7ada18060..981a8f469 100755 --- a/Algorithms/0490.the-maze/the-maze_test.go +++ b/Algorithms/0490.the-maze/the-maze_test.go @@ -38,7 +38,8 @@ func Test_Problem0490(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go b/Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go index b55f2ae0e..99a3cd1c8 100755 --- a/Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go +++ b/Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go @@ -38,7 +38,8 @@ func Test_Problem0491(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go b/Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go index 561f5bd99..be17eb600 100755 --- a/Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go +++ b/Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go @@ -38,7 +38,8 @@ func Test_Problem0492(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0493.reverse-pairs/reverse-pairs_test.go b/Algorithms/0493.reverse-pairs/reverse-pairs_test.go index 17c05246e..5681dacd0 100755 --- a/Algorithms/0493.reverse-pairs/reverse-pairs_test.go +++ b/Algorithms/0493.reverse-pairs/reverse-pairs_test.go @@ -38,7 +38,8 @@ func Test_Problem0493(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0494.target-sum/target-sum_test.go b/Algorithms/0494.target-sum/target-sum_test.go index 7279f9a14..71fbf4c9b 100755 --- a/Algorithms/0494.target-sum/target-sum_test.go +++ b/Algorithms/0494.target-sum/target-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0494(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0495.teemo-attacking/teemo-attacking_test.go b/Algorithms/0495.teemo-attacking/teemo-attacking_test.go index 5ba655b99..40f2c0024 100755 --- a/Algorithms/0495.teemo-attacking/teemo-attacking_test.go +++ b/Algorithms/0495.teemo-attacking/teemo-attacking_test.go @@ -38,7 +38,8 @@ func Test_Problem0495(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0496.next-greater-element-i/next-greater-element-i_test.go b/Algorithms/0496.next-greater-element-i/next-greater-element-i_test.go index a4c02a39d..91ae0377d 100755 --- a/Algorithms/0496.next-greater-element-i/next-greater-element-i_test.go +++ b/Algorithms/0496.next-greater-element-i/next-greater-element-i_test.go @@ -38,7 +38,8 @@ func Test_Problem0496(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go b/Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go index 6bfacb8de..31a936557 100755 --- a/Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go +++ b/Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go @@ -38,7 +38,8 @@ func Test_Problem0498(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0499.the-maze-iii/the-maze-iii_test.go b/Algorithms/0499.the-maze-iii/the-maze-iii_test.go index 1054d4da1..076aac302 100755 --- a/Algorithms/0499.the-maze-iii/the-maze-iii_test.go +++ b/Algorithms/0499.the-maze-iii/the-maze-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0499(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0500.keyboard-row/keyboard-row_test.go b/Algorithms/0500.keyboard-row/keyboard-row_test.go index daa4ba59a..0df184b7f 100755 --- a/Algorithms/0500.keyboard-row/keyboard-row_test.go +++ b/Algorithms/0500.keyboard-row/keyboard-row_test.go @@ -38,7 +38,8 @@ func Test_Problem0500(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree_test.go b/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree_test.go index 4b76c85ff..d59cca225 100755 --- a/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree_test.go +++ b/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0501(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0502.ipo/ipo_test.go b/Algorithms/0502.ipo/ipo_test.go index 7d788d148..effc988c1 100755 --- a/Algorithms/0502.ipo/ipo_test.go +++ b/Algorithms/0502.ipo/ipo_test.go @@ -38,7 +38,8 @@ func Test_Problem0502(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0503.next-greater-element-ii/next-greater-element-ii_test.go b/Algorithms/0503.next-greater-element-ii/next-greater-element-ii_test.go index cf197ed47..da0e71016 100755 --- a/Algorithms/0503.next-greater-element-ii/next-greater-element-ii_test.go +++ b/Algorithms/0503.next-greater-element-ii/next-greater-element-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0503(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0504.base-7/base-7_test.go b/Algorithms/0504.base-7/base-7_test.go index 8b2cebdc6..0ffffae91 100755 --- a/Algorithms/0504.base-7/base-7_test.go +++ b/Algorithms/0504.base-7/base-7_test.go @@ -38,7 +38,8 @@ func Test_Problem0504(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0505.the-maze-ii/the-maze-ii_test.go b/Algorithms/0505.the-maze-ii/the-maze-ii_test.go index d3adbe30c..dbce268f5 100755 --- a/Algorithms/0505.the-maze-ii/the-maze-ii_test.go +++ b/Algorithms/0505.the-maze-ii/the-maze-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0505(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0506.relative-ranks/relative-ranks_test.go b/Algorithms/0506.relative-ranks/relative-ranks_test.go index 0cd5659f1..eb2ff6600 100755 --- a/Algorithms/0506.relative-ranks/relative-ranks_test.go +++ b/Algorithms/0506.relative-ranks/relative-ranks_test.go @@ -38,7 +38,8 @@ func Test_Problem0506(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0507.perfect-number/perfect-number_test.go b/Algorithms/0507.perfect-number/perfect-number_test.go index 95535acfe..bca144f87 100755 --- a/Algorithms/0507.perfect-number/perfect-number_test.go +++ b/Algorithms/0507.perfect-number/perfect-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0507(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum_test.go b/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum_test.go index 028f9b1e9..0975449f4 100755 --- a/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum_test.go +++ b/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0508(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value_test.go b/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value_test.go index 4ede16845..e544a33c3 100755 --- a/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value_test.go +++ b/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value_test.go @@ -38,7 +38,8 @@ func Test_Problem0513(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0514.freedom-trail/freedom-trail_test.go b/Algorithms/0514.freedom-trail/freedom-trail_test.go index 39ccabfe7..8067e0c87 100755 --- a/Algorithms/0514.freedom-trail/freedom-trail_test.go +++ b/Algorithms/0514.freedom-trail/freedom-trail_test.go @@ -38,7 +38,8 @@ func Test_Problem0514(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row_test.go b/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row_test.go index d5c446359..2f4ecc536 100755 --- a/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row_test.go +++ b/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row_test.go @@ -38,7 +38,8 @@ func Test_Problem0515(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go b/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go index 492dc80ea..291131a48 100755 --- a/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go +++ b/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0516(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0517.super-washing-machines/super-washing-machines_test.go b/Algorithms/0517.super-washing-machines/super-washing-machines_test.go index b40fdbc66..7d4c618d0 100755 --- a/Algorithms/0517.super-washing-machines/super-washing-machines_test.go +++ b/Algorithms/0517.super-washing-machines/super-washing-machines_test.go @@ -38,7 +38,8 @@ func Test_Problem0517(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0520.detect-capital/detect-capital_test.go b/Algorithms/0520.detect-capital/detect-capital_test.go index 2988a129d..60b81c020 100755 --- a/Algorithms/0520.detect-capital/detect-capital_test.go +++ b/Algorithms/0520.detect-capital/detect-capital_test.go @@ -38,7 +38,8 @@ func Test_Problem0520(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i_test.go b/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i_test.go index 3bb0b5f92..9b97424dc 100755 --- a/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i_test.go +++ b/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i_test.go @@ -38,7 +38,8 @@ func Test_Problem0521(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii_test.go b/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii_test.go index 4abe6cd47..20916f33f 100755 --- a/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii_test.go +++ b/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0522(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go b/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go index 9cbcea886..6c4aff5ed 100755 --- a/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go +++ b/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0523(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting_test.go b/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting_test.go index a34feb04b..0abb97d80 100755 --- a/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting_test.go +++ b/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting_test.go @@ -38,7 +38,8 @@ func Test_Problem0524(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0525.contiguous-array/contiguous-array_test.go b/Algorithms/0525.contiguous-array/contiguous-array_test.go index 06e683aa5..41350c072 100755 --- a/Algorithms/0525.contiguous-array/contiguous-array_test.go +++ b/Algorithms/0525.contiguous-array/contiguous-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0525(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go b/Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go index d22b6cade..f93977b27 100755 --- a/Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go +++ b/Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go @@ -38,7 +38,8 @@ func Test_Problem0526(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0527.word-abbreviation/word-abbreviation_test.go b/Algorithms/0527.word-abbreviation/word-abbreviation_test.go index 498c696b7..9a8869d9a 100755 --- a/Algorithms/0527.word-abbreviation/word-abbreviation_test.go +++ b/Algorithms/0527.word-abbreviation/word-abbreviation_test.go @@ -38,7 +38,8 @@ func Test_Problem0527(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0529.minesweeper/minesweeper_test.go b/Algorithms/0529.minesweeper/minesweeper_test.go index 370b892eb..8127e4bd2 100755 --- a/Algorithms/0529.minesweeper/minesweeper_test.go +++ b/Algorithms/0529.minesweeper/minesweeper_test.go @@ -38,7 +38,8 @@ func Test_Problem0529(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst_test.go b/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst_test.go index 4c139b0a6..511113b67 100755 --- a/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst_test.go +++ b/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst_test.go @@ -38,7 +38,8 @@ func Test_Problem0530(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go b/Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go index 33f2ff565..3b472f9f4 100755 --- a/Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go +++ b/Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go @@ -38,7 +38,8 @@ func Test_Problem0531(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array_test.go b/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array_test.go index b66eab800..7aa7e636d 100755 --- a/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array_test.go +++ b/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0532(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go b/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go index 5f36d2a18..a03093650 100755 --- a/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go +++ b/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0533(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl_test.go b/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl_test.go index eadd2f70e..adfd154b6 100755 --- a/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl_test.go +++ b/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl_test.go @@ -38,7 +38,8 @@ func Test_Problem0535(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string_test.go b/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string_test.go index 3a6ef9752..1ba52d041 100755 --- a/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string_test.go +++ b/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0536(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go b/Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go index f5c428ea6..2b3caf510 100755 --- a/Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go +++ b/Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go @@ -38,7 +38,8 @@ func Test_Problem0537(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree_test.go b/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree_test.go index 0bf76772a..5aa07012f 100755 --- a/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree_test.go +++ b/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0538(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go b/Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go index 042283977..e52e8fe6c 100755 --- a/Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go +++ b/Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go @@ -38,7 +38,8 @@ func Test_Problem0539(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array_test.go b/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array_test.go index a9d8b7dd8..a298db054 100755 --- a/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array_test.go +++ b/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0540(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go b/Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go index 12b285912..d8351ba91 100755 --- a/Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go +++ b/Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0541(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0542.01-matrix/01-matrix_test.go b/Algorithms/0542.01-matrix/01-matrix_test.go index 747db451a..220de8db5 100755 --- a/Algorithms/0542.01-matrix/01-matrix_test.go +++ b/Algorithms/0542.01-matrix/01-matrix_test.go @@ -38,7 +38,8 @@ func Test_Problem0542(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree_test.go b/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree_test.go index ec677ccbc..ed8835cda 100755 --- a/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree_test.go +++ b/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0543(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0544.output-contest-matches/output-contest-matches_test.go b/Algorithms/0544.output-contest-matches/output-contest-matches_test.go index 2621570d2..461a86f36 100755 --- a/Algorithms/0544.output-contest-matches/output-contest-matches_test.go +++ b/Algorithms/0544.output-contest-matches/output-contest-matches_test.go @@ -38,7 +38,8 @@ func Test_Problem0544(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree_test.go b/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree_test.go index 12a55e1a3..d4c0b6f98 100755 --- a/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree_test.go +++ b/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0545(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0546.remove-boxes/remove-boxes_test.go b/Algorithms/0546.remove-boxes/remove-boxes_test.go index 7f21df181..cdd70c929 100755 --- a/Algorithms/0546.remove-boxes/remove-boxes_test.go +++ b/Algorithms/0546.remove-boxes/remove-boxes_test.go @@ -38,7 +38,8 @@ func Test_Problem0546(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0547.friend-circles/friend-circles_test.go b/Algorithms/0547.friend-circles/friend-circles_test.go index 18ebe53fa..45c71e796 100755 --- a/Algorithms/0547.friend-circles/friend-circles_test.go +++ b/Algorithms/0547.friend-circles/friend-circles_test.go @@ -38,7 +38,8 @@ func Test_Problem0547(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum_test.go b/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum_test.go index adf9d872c..0b91fc6f2 100755 --- a/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum_test.go +++ b/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum_test.go @@ -38,7 +38,8 @@ func Test_Problem0548(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii_test.go b/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii_test.go index d7c8fcb2c..a3f029d7d 100755 --- a/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii_test.go +++ b/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0549(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0551.student-attendance-record-i/student-attendance-record-i_test.go b/Algorithms/0551.student-attendance-record-i/student-attendance-record-i_test.go index 612b68560..2c096e3e7 100755 --- a/Algorithms/0551.student-attendance-record-i/student-attendance-record-i_test.go +++ b/Algorithms/0551.student-attendance-record-i/student-attendance-record-i_test.go @@ -38,7 +38,8 @@ func Test_Problem0551(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii_test.go b/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii_test.go index 7900a61fc..c4210a840 100755 --- a/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii_test.go +++ b/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0552(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0553.optimal-division/optimal-division_test.go b/Algorithms/0553.optimal-division/optimal-division_test.go index 4f1bbfcd6..5421b45f8 100755 --- a/Algorithms/0553.optimal-division/optimal-division_test.go +++ b/Algorithms/0553.optimal-division/optimal-division_test.go @@ -38,7 +38,8 @@ func Test_Problem0553(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0554.brick-wall/brick-wall_test.go b/Algorithms/0554.brick-wall/brick-wall_test.go index 7c8b6914e..957c747cd 100755 --- a/Algorithms/0554.brick-wall/brick-wall_test.go +++ b/Algorithms/0554.brick-wall/brick-wall_test.go @@ -38,7 +38,8 @@ func Test_Problem0554(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go b/Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go index 4aeea4445..cdc4d1fff 100755 --- a/Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go +++ b/Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go @@ -38,7 +38,8 @@ func Test_Problem0555(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0556.next-greater-element-iii/next-greater-element-iii_test.go b/Algorithms/0556.next-greater-element-iii/next-greater-element-iii_test.go index 46ff68a44..12c71e87a 100755 --- a/Algorithms/0556.next-greater-element-iii/next-greater-element-iii_test.go +++ b/Algorithms/0556.next-greater-element-iii/next-greater-element-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0556(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii_test.go b/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii_test.go index 3feae3653..f36a8eb88 100755 --- a/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii_test.go +++ b/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0557(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k_test.go b/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k_test.go index 942c1f834..d83794094 100755 --- a/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k_test.go +++ b/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k_test.go @@ -38,7 +38,8 @@ func Test_Problem0560(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0561.array-partition-i/array-partition-i_test.go b/Algorithms/0561.array-partition-i/array-partition-i_test.go index 6d3d475fd..582a0aa6b 100755 --- a/Algorithms/0561.array-partition-i/array-partition-i_test.go +++ b/Algorithms/0561.array-partition-i/array-partition-i_test.go @@ -38,7 +38,8 @@ func Test_Problem0561(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix_test.go b/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix_test.go index dbadcdb64..84bcac36c 100755 --- a/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix_test.go +++ b/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix_test.go @@ -38,7 +38,8 @@ func Test_Problem0562(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go b/Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go index 70575d573..258ff0727 100755 --- a/Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go +++ b/Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go @@ -38,7 +38,8 @@ func Test_Problem0563(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome_test.go b/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome_test.go index 281873591..636dde43b 100755 --- a/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome_test.go +++ b/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome_test.go @@ -38,7 +38,8 @@ func Test_Problem0564(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0565.array-nesting/array-nesting_test.go b/Algorithms/0565.array-nesting/array-nesting_test.go index 6ea015bb4..bb987add8 100755 --- a/Algorithms/0565.array-nesting/array-nesting_test.go +++ b/Algorithms/0565.array-nesting/array-nesting_test.go @@ -38,7 +38,8 @@ func Test_Problem0565(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go b/Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go index 5f84b5631..52d546b86 100755 --- a/Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go +++ b/Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go @@ -38,7 +38,8 @@ func Test_Problem0566(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0567.permutation-in-string/permutation-in-string_test.go b/Algorithms/0567.permutation-in-string/permutation-in-string_test.go index 124390c12..bfc518a81 100755 --- a/Algorithms/0567.permutation-in-string/permutation-in-string_test.go +++ b/Algorithms/0567.permutation-in-string/permutation-in-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0567(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go b/Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go index 90c7577f7..f04b253c8 100755 --- a/Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go +++ b/Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go @@ -38,7 +38,8 @@ func Test_Problem0568(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree_test.go b/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree_test.go index 6a295ae6c..2b57419a7 100755 --- a/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree_test.go +++ b/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0572(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go b/Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go index c1b9698c4..683fd8a56 100755 --- a/Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go +++ b/Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go @@ -38,7 +38,8 @@ func Test_Problem0573(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0575.distribute-candies/distribute-candies_test.go b/Algorithms/0575.distribute-candies/distribute-candies_test.go index 8a6ee950a..f0c9b545e 100755 --- a/Algorithms/0575.distribute-candies/distribute-candies_test.go +++ b/Algorithms/0575.distribute-candies/distribute-candies_test.go @@ -38,7 +38,8 @@ func Test_Problem0575(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths_test.go b/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths_test.go index dacebabf5..ec7f83cad 100755 --- a/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths_test.go +++ b/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths_test.go @@ -38,7 +38,8 @@ func Test_Problem0576(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray_test.go b/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray_test.go index ea7b82fe3..74b8cf1e2 100755 --- a/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray_test.go +++ b/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray_test.go @@ -38,7 +38,8 @@ func Test_Problem0581(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0582.kill-process/kill-process_test.go b/Algorithms/0582.kill-process/kill-process_test.go index 788947890..bee3a0bd1 100755 --- a/Algorithms/0582.kill-process/kill-process_test.go +++ b/Algorithms/0582.kill-process/kill-process_test.go @@ -38,7 +38,8 @@ func Test_Problem0582(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings_test.go b/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings_test.go index 951772c91..17ff0d184 100755 --- a/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings_test.go +++ b/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings_test.go @@ -38,7 +38,8 @@ func Test_Problem0583(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0587.erect-the-fence/erect-the-fence_test.go b/Algorithms/0587.erect-the-fence/erect-the-fence_test.go index d8861e299..ee051a2be 100755 --- a/Algorithms/0587.erect-the-fence/erect-the-fence_test.go +++ b/Algorithms/0587.erect-the-fence/erect-the-fence_test.go @@ -38,7 +38,8 @@ func Test_Problem0587(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system_test.go b/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system_test.go index b873f984f..52e9c5ccb 100755 --- a/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system_test.go +++ b/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system_test.go @@ -38,7 +38,8 @@ func Test_Problem0588(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0591.tag-validator/tag-validator_test.go b/Algorithms/0591.tag-validator/tag-validator_test.go index 1bb7c0624..435e194c4 100755 --- a/Algorithms/0591.tag-validator/tag-validator_test.go +++ b/Algorithms/0591.tag-validator/tag-validator_test.go @@ -38,7 +38,8 @@ func Test_Problem0591(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction_test.go b/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction_test.go index af18df44c..9ffe07593 100755 --- a/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction_test.go +++ b/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction_test.go @@ -38,7 +38,8 @@ func Test_Problem0592(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0593.valid-square/valid-square_test.go b/Algorithms/0593.valid-square/valid-square_test.go index 502afeeab..0ca73bf5d 100755 --- a/Algorithms/0593.valid-square/valid-square_test.go +++ b/Algorithms/0593.valid-square/valid-square_test.go @@ -38,7 +38,8 @@ func Test_Problem0593(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go b/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go index 975512454..85e5396f0 100755 --- a/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go +++ b/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go @@ -38,7 +38,8 @@ func Test_Problem0594(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0598.range-addition-ii/range-addition-ii_test.go b/Algorithms/0598.range-addition-ii/range-addition-ii_test.go index b41a5a439..8a76025e7 100755 --- a/Algorithms/0598.range-addition-ii/range-addition-ii_test.go +++ b/Algorithms/0598.range-addition-ii/range-addition-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0598(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists_test.go b/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists_test.go index 43540e37c..8507cf839 100755 --- a/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists_test.go +++ b/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists_test.go @@ -38,7 +38,8 @@ func Test_Problem0599(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones_test.go b/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones_test.go index b1a1687e9..63e6a7655 100755 --- a/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones_test.go +++ b/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones_test.go @@ -38,7 +38,8 @@ func Test_Problem0600(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator_test.go b/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator_test.go index 6e56ed61b..9bf79cc80 100755 --- a/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator_test.go +++ b/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator_test.go @@ -38,7 +38,8 @@ func Test_Problem0604(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0605.can-place-flowers/can-place-flowers_test.go b/Algorithms/0605.can-place-flowers/can-place-flowers_test.go index 660302242..3e226c1a5 100755 --- a/Algorithms/0605.can-place-flowers/can-place-flowers_test.go +++ b/Algorithms/0605.can-place-flowers/can-place-flowers_test.go @@ -38,7 +38,8 @@ func Test_Problem0605(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree_test.go b/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree_test.go index 660814526..e0f633340 100755 --- a/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree_test.go +++ b/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0606(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system_test.go b/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system_test.go index 8dcd3c4e4..b29fd990f 100755 --- a/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system_test.go +++ b/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system_test.go @@ -38,7 +38,8 @@ func Test_Problem0609(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go b/Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go index d4e2a7884..6fdc60f56 100755 --- a/Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go +++ b/Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go @@ -38,7 +38,8 @@ func Test_Problem0611(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string_test.go b/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string_test.go index 49f6bfac5..66bc7b37f 100755 --- a/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string_test.go +++ b/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string_test.go @@ -38,7 +38,8 @@ func Test_Problem0616(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees_test.go b/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees_test.go index 5a7ed960e..ed23278e1 100755 --- a/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees_test.go +++ b/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees_test.go @@ -38,7 +38,8 @@ func Test_Problem0617(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0621.task-scheduler/task-scheduler_test.go b/Algorithms/0621.task-scheduler/task-scheduler_test.go index 7a600ccd6..f6ee0f2be 100755 --- a/Algorithms/0621.task-scheduler/task-scheduler_test.go +++ b/Algorithms/0621.task-scheduler/task-scheduler_test.go @@ -38,7 +38,8 @@ func Test_Problem0621(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree_test.go b/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree_test.go index 01af59632..35a404cdd 100755 --- a/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree_test.go +++ b/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0623(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays_test.go b/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays_test.go index 9272d290a..44d4e4506 100755 --- a/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays_test.go +++ b/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays_test.go @@ -38,7 +38,8 @@ func Test_Problem0624(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0625.minimum-factorization/minimum-factorization_test.go b/Algorithms/0625.minimum-factorization/minimum-factorization_test.go index 070c52132..2e1902f8f 100755 --- a/Algorithms/0625.minimum-factorization/minimum-factorization_test.go +++ b/Algorithms/0625.minimum-factorization/minimum-factorization_test.go @@ -38,7 +38,8 @@ func Test_Problem0625(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers_test.go b/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers_test.go index 539ab9eb0..dfc945ce3 100755 --- a/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers_test.go +++ b/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers_test.go @@ -38,7 +38,8 @@ func Test_Problem0628(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array_test.go b/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array_test.go index 27d735ffb..d500ea0dd 100755 --- a/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array_test.go +++ b/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0629(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go b/Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go index 4b1386452..a7df9c8f4 100755 --- a/Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go +++ b/Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go @@ -38,7 +38,8 @@ func Test_Problem0630(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula_test.go b/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula_test.go index 9baf704cf..4b739be2a 100755 --- a/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula_test.go +++ b/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula_test.go @@ -38,7 +38,8 @@ func Test_Problem0631(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0632.smallest-range/smallest-range_test.go b/Algorithms/0632.smallest-range/smallest-range_test.go index 18f125395..d68882071 100755 --- a/Algorithms/0632.smallest-range/smallest-range_test.go +++ b/Algorithms/0632.smallest-range/smallest-range_test.go @@ -38,7 +38,8 @@ func Test_Problem0632(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers_test.go b/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers_test.go index 05c3f67cd..2a03f82f2 100755 --- a/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers_test.go +++ b/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers_test.go @@ -38,7 +38,8 @@ func Test_Problem0633(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array_test.go b/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array_test.go index 2f2489c18..840a17178 100755 --- a/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array_test.go +++ b/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array_test.go @@ -38,7 +38,8 @@ func Test_Problem0634(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0635.design-log-storage-system/design-log-storage-system_test.go b/Algorithms/0635.design-log-storage-system/design-log-storage-system_test.go index 8a7d19604..23699a9b0 100755 --- a/Algorithms/0635.design-log-storage-system/design-log-storage-system_test.go +++ b/Algorithms/0635.design-log-storage-system/design-log-storage-system_test.go @@ -38,7 +38,8 @@ func Test_Problem0635(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions_test.go b/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions_test.go index 69a9f5891..809a885d6 100755 --- a/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions_test.go +++ b/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions_test.go @@ -38,7 +38,8 @@ func Test_Problem0636(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree_test.go b/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree_test.go index 80678a26e..f078f10c6 100755 --- a/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree_test.go +++ b/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree_test.go @@ -38,7 +38,8 @@ func Test_Problem0637(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0638.shopping-offers/shopping-offers_test.go b/Algorithms/0638.shopping-offers/shopping-offers_test.go index 59182f917..5cb3bad88 100755 --- a/Algorithms/0638.shopping-offers/shopping-offers_test.go +++ b/Algorithms/0638.shopping-offers/shopping-offers_test.go @@ -38,7 +38,8 @@ func Test_Problem0638(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go b/Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go index 7d7ac615b..206a57dc7 100755 --- a/Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go +++ b/Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0639(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0640.solve-the-equation/solve-the-equation_test.go b/Algorithms/0640.solve-the-equation/solve-the-equation_test.go index bcbf9fed3..0ab728052 100755 --- a/Algorithms/0640.solve-the-equation/solve-the-equation_test.go +++ b/Algorithms/0640.solve-the-equation/solve-the-equation_test.go @@ -38,7 +38,8 @@ func Test_Problem0640(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system_test.go b/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system_test.go index 6f0b69930..0eb94139c 100755 --- a/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system_test.go +++ b/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system_test.go @@ -38,7 +38,8 @@ func Test_Problem0642(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i_test.go b/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i_test.go index 7a88048a3..c29da67c9 100755 --- a/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i_test.go +++ b/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i_test.go @@ -38,7 +38,8 @@ func Test_Problem0643(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii_test.go b/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii_test.go index 8cab9a56d..cb2fe8d4e 100755 --- a/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii_test.go +++ b/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii_test.go @@ -38,7 +38,8 @@ func Test_Problem0644(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0645.set-mismatch/set-mismatch_test.go b/Algorithms/0645.set-mismatch/set-mismatch_test.go index a95c78348..8aba6754b 100755 --- a/Algorithms/0645.set-mismatch/set-mismatch_test.go +++ b/Algorithms/0645.set-mismatch/set-mismatch_test.go @@ -38,7 +38,8 @@ func Test_Problem0645(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain_test.go b/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain_test.go index b8ed71731..4500555c9 100755 --- a/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain_test.go +++ b/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain_test.go @@ -38,7 +38,8 @@ func Test_Problem0646(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go b/Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go index 4ae2abe90..767d195fb 100755 --- a/Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go +++ b/Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go @@ -38,7 +38,8 @@ func Test_Problem0647(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Algorithms/0648.replace-words/replace-words_test.go b/Algorithms/0648.replace-words/replace-words_test.go index afde01687..9593d297d 100755 --- a/Algorithms/0648.replace-words/replace-words_test.go +++ b/Algorithms/0648.replace-words/replace-words_test.go @@ -38,7 +38,8 @@ func Test_Problem0648(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go b/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go index de3cf5610..aa7b831e4 100755 --- a/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go +++ b/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go @@ -38,7 +38,8 @@ func Test_Problem0433(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0457.circular-array-loop/circular-array-loop_test.go b/Draft/0457.circular-array-loop/circular-array-loop_test.go index 8b5bef1e2..86db0b59d 100755 --- a/Draft/0457.circular-array-loop/circular-array-loop_test.go +++ b/Draft/0457.circular-array-loop/circular-array-loop_test.go @@ -38,7 +38,8 @@ func Test_Problem0457(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0458.poor-pigs/poor-pigs_test.go b/Draft/0458.poor-pigs/poor-pigs_test.go index 897a1721c..f59d4f68d 100755 --- a/Draft/0458.poor-pigs/poor-pigs_test.go +++ b/Draft/0458.poor-pigs/poor-pigs_test.go @@ -38,7 +38,8 @@ func Test_Problem0458(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0518.coin-change-2/coin-change-2_test.go b/Draft/0518.coin-change-2/coin-change-2_test.go index fff5f0064..f0be9fcd5 100755 --- a/Draft/0518.coin-change-2/coin-change-2_test.go +++ b/Draft/0518.coin-change-2/coin-change-2_test.go @@ -38,7 +38,8 @@ func Test_Problem0518(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question_test.go b/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question_test.go index a8c98c945..6cdfc1965 100755 --- a/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question_test.go +++ b/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question_test.go @@ -38,7 +38,8 @@ func Test_Problem0578(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee_test.go b/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee_test.go index 89646889d..823a8cdda 100755 --- a/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee_test.go +++ b/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee_test.go @@ -38,7 +38,8 @@ func Test_Problem0579(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go b/Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go index e6f18f727..1221351f6 100755 --- a/Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go +++ b/Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go @@ -38,7 +38,8 @@ func Test_Problem0603(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Draft/0626.exchange-seats/exchange-seats_test.go b/Draft/0626.exchange-seats/exchange-seats_test.go index 196d2229c..c39f62a0e 100755 --- a/Draft/0626.exchange-seats/exchange-seats_test.go +++ b/Draft/0626.exchange-seats/exchange-seats_test.go @@ -38,7 +38,8 @@ func Test_Problem0626(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%v", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%!v(MISSING)", p) } } diff --git a/Helper b/Helper index 4a5401a94..889cb9855 100755 Binary files a/Helper and b/Helper differ diff --git a/README.md b/README.md index 14f024d7d..9e344eca3 100755 --- a/README.md +++ b/README.md @@ -7,9 +7,9 @@ ## 统计 ||Easy|Medium|Hard|Total| |:--|:--:|:--:|:--:|:--:| -|**Algorithms**|5/155|7/303|2/115|14/573| +|**Algorithms**|5/155|8/303|2/115|15/573| |**Draft**|0/2|0/5|0/1|0/8| -|**Total**|5/157|7/308|2/116|14/581| +|**Total**|5/157|8/308|2/116|15/581| ## 已添加的题目 @@ -29,6 +29,7 @@ |12|[Integer to Roman](./Algorithms/0012.integer-to-roman)|☆ ☆|44%|| |13|[Roman to Integer](./Algorithms/0013.roman-to-integer)|☆|45%|| |14|[Longest Common Prefix](./Algorithms/0014.longest-common-prefix)|☆|31%|| +|15|[3Sum](./Algorithms/0015.3sum)|☆ ☆|21%|| ## helper文件夹 [helper](./helper)会帮助处理大部分琐碎的工作。 diff --git a/helper/problem.go b/helper/problem.go index 881779434..7962b6e44 100644 --- a/helper/problem.go +++ b/helper/problem.go @@ -103,8 +103,9 @@ func Test_%s(t *testing.T) { for _, q := range qs { a, p := q.ans, q.para - - ast.Equal(a.one, p.one, "输入:%s", p) + fmt.Printf("~~%v~~\n", p) + + ast.Equal(a.one, (p.one), "输入:%v", p) } } `