From 95b8e893c5b3315ae3800d592c5493b83ac3bd4e Mon Sep 17 00:00:00 2001 From: aQua Date: Fri, 28 Jul 2017 16:23:40 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0helper=E5=8A=A9=E6=89=8B?= =?UTF-8?q?=E5=92=8CREADME.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../0016.3sum-closest/3sum-closest_test.go | 5 +++-- ...ter-combinations-of-a-phone-number_test.go | 5 +++-- Algorithms/0018.4sum/4sum_test.go | 5 +++-- .../remove-nth-node-from-end-of-list_test.go | 5 +++-- .../valid-parentheses_test.go | 5 +++-- .../merge-two-sorted-lists_test.go | 5 +++-- .../generate-parentheses_test.go | 5 +++-- .../merge-k-sorted-lists_test.go | 5 +++-- .../swap-nodes-in-pairs_test.go | 5 +++-- .../reverse-nodes-in-k-group_test.go | 5 +++-- ...emove-duplicates-from-sorted-array_test.go | 5 +++-- .../remove-element_test.go | 5 +++-- .../implement-strstr_test.go | 5 +++-- .../divide-two-integers_test.go | 5 +++-- ...ng-with-concatenation-of-all-words_test.go | 5 +++-- .../next-permutation_test.go | 5 +++-- .../longest-valid-parentheses_test.go | 5 +++-- .../search-in-rotated-sorted-array_test.go | 5 +++-- .../search-for-a-range_test.go | 5 +++-- .../search-insert-position_test.go | 5 +++-- .../0036.valid-sudoku/valid-sudoku_test.go | 5 +++-- .../0037.sudoku-solver/sudoku-solver_test.go | 5 +++-- .../0038.count-and-say/count-and-say_test.go | 5 +++-- .../combination-sum_test.go | 5 +++-- .../combination-sum-ii_test.go | 5 +++-- .../first-missing-positive_test.go | 5 +++-- .../trapping-rain-water_test.go | 5 +++-- .../multiply-strings_test.go | 5 +++-- .../wildcard-matching_test.go | 5 +++-- .../0045.jump-game-ii/jump-game-ii_test.go | 5 +++-- .../0046.permutations/permutations_test.go | 5 +++-- .../permutations-ii_test.go | 5 +++-- .../0048.rotate-image/rotate-image_test.go | 5 +++-- .../group-anagrams_test.go | 5 +++-- Algorithms/0050.powx-n/powx-n_test.go | 5 +++-- Algorithms/0051.n-queens/n-queens_test.go | 5 +++-- .../0052.n-queens-ii/n-queens-ii_test.go | 5 +++-- .../maximum-subarray_test.go | 5 +++-- .../0054.spiral-matrix/spiral-matrix_test.go | 5 +++-- Algorithms/0055.jump-game/jump-game_test.go | 5 +++-- .../merge-intervals_test.go | 5 +++-- .../insert-interval_test.go | 5 +++-- .../length-of-last-word_test.go | 5 +++-- .../spiral-matrix-ii_test.go | 5 +++-- .../permutation-sequence_test.go | 5 +++-- .../0061.rotate-list/rotate-list_test.go | 5 +++-- .../0062.unique-paths/unique-paths_test.go | 5 +++-- .../unique-paths-ii_test.go | 5 +++-- .../minimum-path-sum_test.go | 5 +++-- .../0065.valid-number/valid-number_test.go | 5 +++-- Algorithms/0066.plus-one/plus-one_test.go | 5 +++-- Algorithms/0067.add-binary/add-binary_test.go | 5 +++-- .../text-justification_test.go | 5 +++-- Algorithms/0069.sqrtx/sqrtx_test.go | 5 +++-- .../climbing-stairs_test.go | 5 +++-- .../0071.simplify-path/simplify-path_test.go | 5 +++-- .../0072.edit-distance/edit-distance_test.go | 5 +++-- .../set-matrix-zeroes_test.go | 5 +++-- .../search-a-2d-matrix_test.go | 5 +++-- .../0075.sort-colors/sort-colors_test.go | 5 +++-- .../minimum-window-substring_test.go | 5 +++-- .../0077.combinations/combinations_test.go | 5 +++-- Algorithms/0078.subsets/subsets_test.go | 5 +++-- .../0079.word-search/word-search_test.go | 5 +++-- ...ve-duplicates-from-sorted-array-ii_test.go | 5 +++-- .../search-in-rotated-sorted-array-ii_test.go | 5 +++-- ...ove-duplicates-from-sorted-list-ii_test.go | 5 +++-- ...remove-duplicates-from-sorted-list_test.go | 5 +++-- .../largest-rectangle-in-histogram_test.go | 5 +++-- .../maximal-rectangle_test.go | 5 +++-- .../partition-list_test.go | 5 +++-- .../scramble-string_test.go | 5 +++-- .../merge-sorted-array_test.go | 5 +++-- Algorithms/0089.gray-code/gray-code_test.go | 5 +++-- Algorithms/0090.subsets-ii/subsets-ii_test.go | 5 +++-- .../0091.decode-ways/decode-ways_test.go | 5 +++-- .../reverse-linked-list-ii_test.go | 5 +++-- .../restore-ip-addresses_test.go | 5 +++-- .../binary-tree-inorder-traversal_test.go | 5 +++-- .../unique-binary-search-trees-ii_test.go | 5 +++-- .../unique-binary-search-trees_test.go | 5 +++-- .../interleaving-string_test.go | 5 +++-- .../validate-binary-search-tree_test.go | 5 +++-- .../recover-binary-search-tree_test.go | 5 +++-- Algorithms/0100.same-tree/same-tree_test.go | 5 +++-- .../symmetric-tree_test.go | 5 +++-- .../binary-tree-level-order-traversal_test.go | 5 +++-- ...-tree-zigzag-level-order-traversal_test.go | 5 +++-- .../maximum-depth-of-binary-tree_test.go | 5 +++-- ...rom-preorder-and-inorder-traversal_test.go | 5 +++-- ...om-inorder-and-postorder-traversal_test.go | 5 +++-- ...nary-tree-level-order-traversal-ii_test.go | 5 +++-- ...sorted-array-to-binary-search-tree_test.go | 5 +++-- ...-sorted-list-to-binary-search-tree_test.go | 5 +++-- .../balanced-binary-tree_test.go | 5 +++-- .../minimum-depth-of-binary-tree_test.go | 5 +++-- Algorithms/0112.path-sum/path-sum_test.go | 5 +++-- .../0113.path-sum-ii/path-sum-ii_test.go | 5 +++-- ...flatten-binary-tree-to-linked-list_test.go | 5 +++-- .../distinct-subsequences_test.go | 5 +++-- ...g-next-right-pointers-in-each-node_test.go | 5 +++-- ...ext-right-pointers-in-each-node-ii_test.go | 5 +++-- .../pascals-triangle_test.go | 5 +++-- .../pascals-triangle-ii_test.go | 5 +++-- Algorithms/0120.triangle/triangle_test.go | 5 +++-- .../best-time-to-buy-and-sell-stock_test.go | 5 +++-- ...best-time-to-buy-and-sell-stock-ii_test.go | 5 +++-- ...est-time-to-buy-and-sell-stock-iii_test.go | 5 +++-- .../binary-tree-maximum-path-sum_test.go | 5 +++-- .../valid-palindrome_test.go | 5 +++-- .../word-ladder-ii_test.go | 5 +++-- .../0127.word-ladder/word-ladder_test.go | 5 +++-- .../longest-consecutive-sequence_test.go | 5 +++-- .../sum-root-to-leaf-numbers_test.go | 5 +++-- .../surrounded-regions_test.go | 5 +++-- .../palindrome-partitioning_test.go | 5 +++-- .../palindrome-partitioning-ii_test.go | 5 +++-- .../0133.clone-graph/clone-graph_test.go | 5 +++-- .../0134.gas-station/gas-station_test.go | 5 +++-- Algorithms/0135.candy/candy_test.go | 5 +++-- .../0136.single-number/single-number_test.go | 5 +++-- .../single-number-ii_test.go | 5 +++-- .../copy-list-with-random-pointer_test.go | 5 +++-- Algorithms/0139.word-break/word-break_test.go | 5 +++-- .../0140.word-break-ii/word-break-ii_test.go | 5 +++-- .../linked-list-cycle_test.go | 5 +++-- .../linked-list-cycle-ii_test.go | 5 +++-- .../0143.reorder-list/reorder-list_test.go | 5 +++-- .../binary-tree-preorder-traversal_test.go | 5 +++-- .../binary-tree-postorder-traversal_test.go | 5 +++-- Algorithms/0146.lru-cache/lru-cache_test.go | 5 +++-- .../insertion-sort-list_test.go | 5 +++-- Algorithms/0148.sort-list/sort-list_test.go | 5 +++-- .../max-points-on-a-line_test.go | 5 +++-- .../evaluate-reverse-polish-notation_test.go | 5 +++-- .../reverse-words-in-a-string_test.go | 5 +++-- .../maximum-product-subarray_test.go | 5 +++-- ...nd-minimum-in-rotated-sorted-array_test.go | 5 +++-- ...minimum-in-rotated-sorted-array-ii_test.go | 5 +++-- Algorithms/0155.min-stack/min-stack_test.go | 5 +++-- .../binary-tree-upside-down_test.go | 5 +++-- .../read-n-characters-given-read4_test.go | 5 +++-- ...given-read4-ii-call-multiple-times_test.go | 5 +++-- ...th-at-most-two-distinct-characters_test.go | 5 +++-- .../intersection-of-two-linked-lists_test.go | 5 +++-- .../one-edit-distance_test.go | 5 +++-- .../find-peak-element_test.go | 5 +++-- .../missing-ranges_test.go | 5 +++-- .../0164.maximum-gap/maximum-gap_test.go | 5 +++-- .../compare-version-numbers_test.go | 5 +++-- .../fraction-to-recurring-decimal_test.go | 5 +++-- .../two-sum-ii-input-array-is-sorted_test.go | 5 +++-- .../excel-sheet-column-title_test.go | 5 +++-- .../majority-element_test.go | 5 +++-- .../two-sum-iii-data-structure-design_test.go | 5 +++-- .../excel-sheet-column-number_test.go | 5 +++-- .../factorial-trailing-zeroes_test.go | 5 +++-- .../binary-search-tree-iterator_test.go | 5 +++-- .../0174.dungeon-game/dungeon-game_test.go | 5 +++-- .../largest-number_test.go | 5 +++-- .../reverse-words-in-a-string-ii_test.go | 5 +++-- .../repeated-dna-sequences_test.go | 5 +++-- ...best-time-to-buy-and-sell-stock-iv_test.go | 5 +++-- .../0189.rotate-array/rotate-array_test.go | 5 +++-- .../0190.reverse-bits/reverse-bits_test.go | 5 +++-- .../number-of-1-bits_test.go | 5 +++-- .../0198.house-robber/house-robber_test.go | 5 +++-- .../binary-tree-right-side-view_test.go | 5 +++-- .../number-of-islands_test.go | 5 +++-- .../bitwise-and-of-numbers-range_test.go | 5 +++-- .../0202.happy-number/happy-number_test.go | 5 +++-- .../remove-linked-list-elements_test.go | 5 +++-- .../0204.count-primes/count-primes_test.go | 5 +++-- .../isomorphic-strings_test.go | 5 +++-- .../reverse-linked-list_test.go | 5 +++-- .../course-schedule_test.go | 5 +++-- .../implement-trie-prefix-tree_test.go | 5 +++-- .../minimum-size-subarray-sum_test.go | 5 +++-- .../course-schedule-ii_test.go | 5 +++-- ...-search-word-data-structure-design_test.go | 5 +++-- .../word-search-ii_test.go | 5 +++-- .../house-robber-ii_test.go | 5 +++-- .../shortest-palindrome_test.go | 5 +++-- .../kth-largest-element-in-an-array_test.go | 5 +++-- .../combination-sum-iii_test.go | 5 +++-- .../contains-duplicate_test.go | 5 +++-- .../the-skyline-problem_test.go | 5 +++-- .../contains-duplicate-ii_test.go | 5 +++-- .../contains-duplicate-iii_test.go | 5 +++-- .../maximal-square_test.go | 5 +++-- .../count-complete-tree-nodes_test.go | 5 +++-- .../rectangle-area_test.go | 5 +++-- .../basic-calculator_test.go | 5 +++-- .../implement-stack-using-queues_test.go | 5 +++-- .../invert-binary-tree_test.go | 5 +++-- .../basic-calculator-ii_test.go | 5 +++-- .../summary-ranges_test.go | 5 +++-- .../majority-element-ii_test.go | 5 +++-- .../kth-smallest-element-in-a-bst_test.go | 5 +++-- .../0231.power-of-two/power-of-two_test.go | 5 +++-- .../implement-queue-using-stacks_test.go | 5 +++-- .../number-of-digit-one_test.go | 5 +++-- .../palindrome-linked-list_test.go | 5 +++-- ...n-ancestor-of-a-binary-search-tree_test.go | 5 +++-- ...t-common-ancestor-of-a-binary-tree_test.go | 5 +++-- .../delete-node-in-a-linked-list_test.go | 5 +++-- .../product-of-array-except-self_test.go | 5 +++-- .../sliding-window-maximum_test.go | 5 +++-- .../search-a-2d-matrix-ii_test.go | 5 +++-- .../different-ways-to-add-parentheses_test.go | 5 +++-- .../0242.valid-anagram/valid-anagram_test.go | 5 +++-- .../shortest-word-distance_test.go | 5 +++-- .../shortest-word-distance-ii_test.go | 5 +++-- .../shortest-word-distance-iii_test.go | 5 +++-- .../strobogrammatic-number_test.go | 5 +++-- .../strobogrammatic-number-ii_test.go | 5 +++-- .../strobogrammatic-number-iii_test.go | 5 +++-- .../group-shifted-strings_test.go | 5 +++-- .../count-univalue-subtrees_test.go | 5 +++-- .../flatten-2d-vector_test.go | 5 +++-- .../0252.meeting-rooms/meeting-rooms_test.go | 5 +++-- .../meeting-rooms-ii_test.go | 5 +++-- .../factor-combinations_test.go | 5 +++-- ...der-sequence-in-binary-search-tree_test.go | 5 +++-- .../0256.paint-house/paint-house_test.go | 5 +++-- .../binary-tree-paths_test.go | 5 +++-- Algorithms/0258.add-digits/add-digits_test.go | 5 +++-- .../0259.3sum-smaller/3sum-smaller_test.go | 5 +++-- .../single-number-iii_test.go | 5 +++-- .../graph-valid-tree_test.go | 5 +++-- .../0263.ugly-number/ugly-number_test.go | 5 +++-- .../ugly-number-ii_test.go | 5 +++-- .../paint-house-ii_test.go | 5 +++-- .../palindrome-permutation_test.go | 5 +++-- .../palindrome-permutation-ii_test.go | 5 +++-- .../missing-number_test.go | 5 +++-- .../alien-dictionary_test.go | 5 +++-- .../closest-binary-search-tree-value_test.go | 5 +++-- .../encode-and-decode-strings_test.go | 5 +++-- ...losest-binary-search-tree-value-ii_test.go | 5 +++-- .../integer-to-english-words_test.go | 5 +++-- Algorithms/0274.h-index/h-index_test.go | 5 +++-- Algorithms/0275.h-index-ii/h-index-ii_test.go | 5 +++-- .../0276.paint-fence/paint-fence_test.go | 5 +++-- .../find-the-celebrity_test.go | 5 +++-- .../first-bad-version_test.go | 5 +++-- .../perfect-squares_test.go | 5 +++-- .../0280.wiggle-sort/wiggle-sort_test.go | 5 +++-- .../zigzag-iterator_test.go | 5 +++-- .../expression-add-operators_test.go | 5 +++-- .../0283.move-zeroes/move-zeroes_test.go | 5 +++-- .../peeking-iterator_test.go | 5 +++-- .../inorder-successor-in-bst_test.go | 5 +++-- .../walls-and-gates_test.go | 5 +++-- .../find-the-duplicate-number_test.go | 5 +++-- .../unique-word-abbreviation_test.go | 5 +++-- .../0289.game-of-life/game-of-life_test.go | 5 +++-- .../0290.word-pattern/word-pattern_test.go | 5 +++-- .../word-pattern-ii_test.go | 5 +++-- Algorithms/0292.nim-game/nim-game_test.go | 5 +++-- Algorithms/0293.flip-game/flip-game_test.go | 5 +++-- .../0294.flip-game-ii/flip-game-ii_test.go | 5 +++-- .../find-median-from-data-stream_test.go | 5 +++-- .../best-meeting-point_test.go | 5 +++-- ...ialize-and-deserialize-binary-tree_test.go | 5 +++-- ...-tree-longest-consecutive-sequence_test.go | 5 +++-- .../bulls-and-cows_test.go | 5 +++-- .../longest-increasing-subsequence_test.go | 5 +++-- .../remove-invalid-parentheses_test.go | 5 +++-- ...t-rectangle-enclosing-black-pixels_test.go | 5 +++-- .../range-sum-query-immutable_test.go | 5 +++-- .../range-sum-query-2d-immutable_test.go | 5 +++-- .../number-of-islands-ii_test.go | 5 +++-- .../additive-number_test.go | 5 +++-- .../range-sum-query-mutable_test.go | 5 +++-- .../range-sum-query-2d-mutable_test.go | 5 +++-- ...o-buy-and-sell-stock-with-cooldown_test.go | 5 +++-- .../minimum-height-trees_test.go | 5 +++-- .../sparse-matrix-multiplication_test.go | 5 +++-- .../burst-balloons_test.go | 5 +++-- .../super-ugly-number_test.go | 5 +++-- ...nary-tree-vertical-order-traversal_test.go | 5 +++-- ...ount-of-smaller-numbers-after-self_test.go | 5 +++-- .../remove-duplicate-letters_test.go | 5 +++-- ...ortest-distance-from-all-buildings_test.go | 5 +++-- .../maximum-product-of-word-lengths_test.go | 5 +++-- .../0319.bulb-switcher/bulb-switcher_test.go | 5 +++-- .../generalized-abbreviation_test.go | 5 +++-- .../create-maximum-number_test.go | 5 +++-- .../0322.coin-change/coin-change_test.go | 5 +++-- ...-components-in-an-undirected-graph_test.go | 5 +++-- .../wiggle-sort-ii_test.go | 5 +++-- ...maximum-size-subarray-sum-equals-k_test.go | 5 +++-- .../power-of-three_test.go | 5 +++-- .../count-of-range-sum_test.go | 5 +++-- .../odd-even-linked-list_test.go | 5 +++-- ...ongest-increasing-path-in-a-matrix_test.go | 5 +++-- .../patching-array_test.go | 5 +++-- ...der-serialization-of-a-binary-tree_test.go | 5 +++-- .../reconstruct-itinerary_test.go | 5 +++-- .../largest-bst-subtree_test.go | 5 +++-- .../increasing-triplet-subsequence_test.go | 5 +++-- .../0335.self-crossing/self-crossing_test.go | 5 +++-- .../palindrome-pairs_test.go | 5 +++-- .../house-robber-iii_test.go | 5 +++-- .../0338.counting-bits/counting-bits_test.go | 5 +++-- .../nested-list-weight-sum_test.go | 5 +++-- ...with-at-most-k-distinct-characters_test.go | 5 +++-- .../flatten-nested-list-iterator_test.go | 5 +++-- .../0342.power-of-four/power-of-four_test.go | 5 +++-- .../0343.integer-break/integer-break_test.go | 5 +++-- .../reverse-string_test.go | 5 +++-- .../reverse-vowels-of-a-string_test.go | 5 +++-- .../moving-average-from-data-stream_test.go | 5 +++-- .../top-k-frequent-elements_test.go | 5 +++-- .../design-tic-tac-toe_test.go | 5 +++-- .../intersection-of-two-arrays_test.go | 5 +++-- .../intersection-of-two-arrays-ii_test.go | 5 +++-- .../android-unlock-patterns_test.go | 5 +++-- .../data-stream-as-disjoint-intervals_test.go | 5 +++-- .../design-snake-game_test.go | 5 +++-- .../russian-doll-envelopes_test.go | 5 +++-- .../design-twitter_test.go | 5 +++-- .../line-reflection_test.go | 5 +++-- .../count-numbers-with-unique-digits_test.go | 5 +++-- .../rearrange-string-k-distance-apart_test.go | 5 +++-- .../logger-rate-limiter_test.go | 5 +++-- .../sort-transformed-array_test.go | 5 +++-- Algorithms/0361.bomb-enemy/bomb-enemy_test.go | 5 +++-- .../design-hit-counter_test.go | 5 +++-- ...-sum-of-rectangle-no-larger-than-k_test.go | 5 +++-- .../nested-list-weight-sum-ii_test.go | 5 +++-- .../water-and-jug-problem_test.go | 5 +++-- .../find-leaves-of-binary-tree_test.go | 5 +++-- .../valid-perfect-square_test.go | 5 +++-- .../largest-divisible-subset_test.go | 5 +++-- .../plus-one-linked-list_test.go | 5 +++-- .../range-addition_test.go | 5 +++-- .../sum-of-two-integers_test.go | 5 +++-- Algorithms/0372.super-pow/super-pow_test.go | 5 +++-- .../find-k-pairs-with-smallest-sums_test.go | 5 +++-- .../guess-number-higher-or-lower_test.go | 5 +++-- .../guess-number-higher-or-lower-ii_test.go | 5 +++-- .../wiggle-subsequence_test.go | 5 +++-- .../combination-sum-iv_test.go | 5 +++-- ...mallest-element-in-a-sorted-matrix_test.go | 5 +++-- .../design-phone-directory_test.go | 5 +++-- .../insert-delete-getrandom-o1_test.go | 5 +++-- ...te-getrandom-o1-duplicates-allowed_test.go | 5 +++-- .../linked-list-random-node_test.go | 5 +++-- .../0383.ransom-note/ransom-note_test.go | 5 +++-- .../shuffle-an-array_test.go | 5 +++-- .../0385.mini-parser/mini-parser_test.go | 5 +++-- .../lexicographical-numbers_test.go | 5 +++-- ...first-unique-character-in-a-string_test.go | 5 +++-- .../longest-absolute-file-path_test.go | 5 +++-- .../find-the-difference_test.go | 5 +++-- .../elimination-game_test.go | 5 +++-- .../perfect-rectangle_test.go | 5 +++-- .../is-subsequence_test.go | 5 +++-- .../utf-8-validation_test.go | 5 +++-- .../0394.decode-string/decode-string_test.go | 5 +++-- ...th-at-least-k-repeating-characters_test.go | 5 +++-- .../rotate-function_test.go | 5 +++-- .../integer-replacement_test.go | 5 +++-- .../random-pick-index_test.go | 5 +++-- .../evaluate-division_test.go | 5 +++-- Algorithms/0400.nth-digit/nth-digit_test.go | 5 +++-- .../0401.binary-watch/binary-watch_test.go | 5 +++-- .../remove-k-digits_test.go | 5 +++-- Algorithms/0403.frog-jump/frog-jump_test.go | 5 +++-- .../sum-of-left-leaves_test.go | 5 +++-- .../convert-a-number-to-hexadecimal_test.go | 5 +++-- .../queue-reconstruction-by-height_test.go | 5 +++-- .../trapping-rain-water-ii_test.go | 5 +++-- .../valid-word-abbreviation_test.go | 5 +++-- .../longest-palindrome_test.go | 5 +++-- .../split-array-largest-sum_test.go | 5 +++-- .../minimum-unique-word-abbreviation_test.go | 5 +++-- Algorithms/0412.fizz-buzz/fizz-buzz_test.go | 5 +++-- .../arithmetic-slices_test.go | 5 +++-- .../third-maximum-number_test.go | 5 +++-- .../0415.add-strings/add-strings_test.go | 5 +++-- .../partition-equal-subset-sum_test.go | 5 +++-- .../pacific-atlantic-water-flow_test.go | 5 +++-- .../sentence-screen-fitting_test.go | 5 +++-- .../battleships-in-a-board_test.go | 5 +++-- .../strong-password-checker_test.go | 5 +++-- ...mum-xor-of-two-numbers-in-an-array_test.go | 5 +++-- .../valid-word-square_test.go | 5 +++-- ...truct-original-digits-from-english_test.go | 5 +++-- ...st-repeating-character-replacement_test.go | 5 +++-- .../0425.word-squares/word-squares_test.go | 5 +++-- .../all-oone-data-structure_test.go | 5 +++-- .../number-of-segments-in-a-string_test.go | 5 +++-- .../non-overlapping-intervals_test.go | 5 +++-- .../find-right-interval_test.go | 5 +++-- .../0437.path-sum-iii/path-sum-iii_test.go | 5 +++-- .../find-all-anagrams-in-a-string_test.go | 5 +++-- .../ternary-expression-parser_test.go | 5 +++-- ...-smallest-in-lexicographical-order_test.go | 5 +++-- .../arranging-coins_test.go | 5 +++-- .../find-all-duplicates-in-an-array_test.go | 5 +++-- .../sequence-reconstruction_test.go | 5 +++-- .../add-two-numbers-ii_test.go | 5 +++-- .../arithmetic-slices-ii-subsequence_test.go | 5 +++-- .../number-of-boomerangs_test.go | 5 +++-- ...ll-numbers-disappeared-in-an-array_test.go | 5 +++-- .../serialize-and-deserialize-bst_test.go | 5 +++-- .../delete-node-in-a-bst_test.go | 5 +++-- .../sort-characters-by-frequency_test.go | 5 +++-- ...number-of-arrows-to-burst-balloons_test.go | 5 +++-- ...imum-moves-to-equal-array-elements_test.go | 5 +++-- Algorithms/0454.4sum-ii/4sum-ii_test.go | 5 +++-- .../assign-cookies_test.go | 5 +++-- .../0456.132-pattern/132-pattern_test.go | 5 +++-- .../repeated-substring-pattern_test.go | 5 +++-- Algorithms/0460.lfu-cache/lfu-cache_test.go | 5 +++-- .../hamming-distance_test.go | 5 +++-- ...m-moves-to-equal-array-elements-ii_test.go | 5 +++-- .../island-perimeter_test.go | 5 +++-- Algorithms/0464.can-i-win/can-i-win_test.go | 5 +++-- .../optimal-account-balancing_test.go | 5 +++-- .../count-the-repetitions_test.go | 5 +++-- ...ue-substrings-in-wraparound-string_test.go | 5 +++-- .../validate-ip-address_test.go | 5 +++-- .../convex-polygon_test.go | 5 +++-- ...encode-string-with-shortest-length_test.go | 5 +++-- .../concatenated-words_test.go | 5 +++-- .../matchsticks-to-square_test.go | 5 +++-- .../ones-and-zeroes_test.go | 5 +++-- Algorithms/0475.heaters/heaters_test.go | 5 +++-- .../number-complement_test.go | 5 +++-- .../total-hamming-distance_test.go | 5 +++-- .../largest-palindrome-product_test.go | 5 +++-- .../sliding-window-median_test.go | 5 +++-- .../magical-string_test.go | 5 +++-- .../license-key-formatting_test.go | 5 +++-- .../smallest-good-base_test.go | 5 +++-- .../find-permutation_test.go | 5 +++-- .../max-consecutive-ones_test.go | 5 +++-- .../predict-the-winner_test.go | 5 +++-- .../max-consecutive-ones-ii_test.go | 5 +++-- Algorithms/0488.zuma-game/zuma-game_test.go | 5 +++-- Algorithms/0490.the-maze/the-maze_test.go | 5 +++-- .../increasing-subsequences_test.go | 5 +++-- .../construct-the-rectangle_test.go | 5 +++-- .../0493.reverse-pairs/reverse-pairs_test.go | 5 +++-- Algorithms/0494.target-sum/target-sum_test.go | 5 +++-- .../teemo-attacking_test.go | 5 +++-- .../next-greater-element-i_test.go | 5 +++-- .../diagonal-traverse_test.go | 5 +++-- .../0499.the-maze-iii/the-maze-iii_test.go | 5 +++-- .../0500.keyboard-row/keyboard-row_test.go | 5 +++-- .../find-mode-in-binary-search-tree_test.go | 5 +++-- Algorithms/0502.ipo/ipo_test.go | 5 +++-- .../next-greater-element-ii_test.go | 5 +++-- Algorithms/0504.base-7/base-7_test.go | 5 +++-- .../0505.the-maze-ii/the-maze-ii_test.go | 5 +++-- .../relative-ranks_test.go | 5 +++-- .../perfect-number_test.go | 5 +++-- .../most-frequent-subtree-sum_test.go | 5 +++-- .../find-bottom-left-tree-value_test.go | 5 +++-- .../0514.freedom-trail/freedom-trail_test.go | 5 +++-- ...ind-largest-value-in-each-tree-row_test.go | 5 +++-- .../longest-palindromic-subsequence_test.go | 5 +++-- .../super-washing-machines_test.go | 5 +++-- .../detect-capital_test.go | 5 +++-- .../longest-uncommon-subsequence-i_test.go | 5 +++-- .../longest-uncommon-subsequence-ii_test.go | 5 +++-- .../continuous-subarray-sum_test.go | 5 +++-- ...ord-in-dictionary-through-deleting_test.go | 5 +++-- .../contiguous-array_test.go | 5 +++-- .../beautiful-arrangement_test.go | 5 +++-- .../word-abbreviation_test.go | 5 +++-- .../0529.minesweeper/minesweeper_test.go | 5 +++-- ...minimum-absolute-difference-in-bst_test.go | 5 +++-- .../lonely-pixel-i_test.go | 5 +++-- .../k-diff-pairs-in-an-array_test.go | 5 +++-- .../lonely-pixel-ii_test.go | 5 +++-- .../encode-and-decode-tinyurl_test.go | 5 +++-- .../construct-binary-tree-from-string_test.go | 5 +++-- .../complex-number-multiplication_test.go | 5 +++-- .../convert-bst-to-greater-tree_test.go | 5 +++-- .../minimum-time-difference_test.go | 5 +++-- .../single-element-in-a-sorted-array_test.go | 5 +++-- .../reverse-string-ii_test.go | 5 +++-- Algorithms/0542.01-matrix/01-matrix_test.go | 5 +++-- .../diameter-of-binary-tree_test.go | 5 +++-- .../output-contest-matches_test.go | 5 +++-- .../boundary-of-binary-tree_test.go | 5 +++-- .../0546.remove-boxes/remove-boxes_test.go | 5 +++-- .../friend-circles_test.go | 5 +++-- .../split-array-with-equal-sum_test.go | 5 +++-- ...ee-longest-consecutive-sequence-ii_test.go | 5 +++-- .../student-attendance-record-i_test.go | 5 +++-- .../student-attendance-record-ii_test.go | 5 +++-- .../optimal-division_test.go | 5 +++-- Algorithms/0554.brick-wall/brick-wall_test.go | 5 +++-- .../split-concatenated-strings_test.go | 5 +++-- .../next-greater-element-iii_test.go | 5 +++-- .../reverse-words-in-a-string-iii_test.go | 5 +++-- .../subarray-sum-equals-k_test.go | 5 +++-- .../array-partition-i_test.go | 5 +++-- ...-line-of-consecutive-one-in-matrix_test.go | 5 +++-- .../binary-tree-tilt_test.go | 5 +++-- .../find-the-closest-palindrome_test.go | 5 +++-- .../0565.array-nesting/array-nesting_test.go | 5 +++-- .../reshape-the-matrix_test.go | 5 +++-- .../permutation-in-string_test.go | 5 +++-- .../maximum-vacation-days_test.go | 5 +++-- .../subtree-of-another-tree_test.go | 5 +++-- .../squirrel-simulation_test.go | 5 +++-- .../distribute-candies_test.go | 5 +++-- .../out-of-boundary-paths_test.go | 5 +++-- ...rtest-unsorted-continuous-subarray_test.go | 5 +++-- .../0582.kill-process/kill-process_test.go | 5 +++-- .../delete-operation-for-two-strings_test.go | 5 +++-- .../erect-the-fence_test.go | 5 +++-- .../design-in-memory-file-system_test.go | 5 +++-- .../0591.tag-validator/tag-validator_test.go | 5 +++-- .../fraction-addition-and-subtraction_test.go | 5 +++-- .../0593.valid-square/valid-square_test.go | 5 +++-- .../longest-harmonious-subsequence_test.go | 5 +++-- .../range-addition-ii_test.go | 5 +++-- .../minimum-index-sum-of-two-lists_test.go | 5 +++-- ...-integers-without-consecutive-ones_test.go | 5 +++-- .../design-compressed-string-iterator_test.go | 5 +++-- .../can-place-flowers_test.go | 5 +++-- .../construct-string-from-binary-tree_test.go | 5 +++-- .../find-duplicate-file-in-system_test.go | 5 +++-- .../valid-triangle-number_test.go | 5 +++-- .../add-bold-tag-in-string_test.go | 5 +++-- .../merge-two-binary-trees_test.go | 5 +++-- .../task-scheduler_test.go | 5 +++-- .../add-one-row-to-tree_test.go | 5 +++-- .../maximum-distance-in-arrays_test.go | 5 +++-- .../minimum-factorization_test.go | 5 +++-- .../maximum-product-of-three-numbers_test.go | 5 +++-- .../k-inverse-pairs-array_test.go | 5 +++-- .../course-schedule-iii_test.go | 5 +++-- .../design-excel-sum-formula_test.go | 5 +++-- .../smallest-range_test.go | 5 +++-- .../sum-of-square-numbers_test.go | 5 +++-- .../find-the-derangement-of-an-array_test.go | 5 +++-- .../design-log-storage-system_test.go | 5 +++-- .../exclusive-time-of-functions_test.go | 5 +++-- .../average-of-levels-in-binary-tree_test.go | 5 +++-- .../shopping-offers_test.go | 5 +++-- .../decode-ways-ii_test.go | 5 +++-- .../solve-the-equation_test.go | 5 +++-- .../design-search-autocomplete-system_test.go | 5 +++-- .../maximum-average-subarray-i_test.go | 5 +++-- .../maximum-average-subarray-ii_test.go | 5 +++-- .../0645.set-mismatch/set-mismatch_test.go | 5 +++-- .../maximum-length-of-pair-chain_test.go | 5 +++-- .../palindromic-substrings_test.go | 5 +++-- .../0648.replace-words/replace-words_test.go | 5 +++-- .../minimum-genetic-mutation_test.go | 5 +++-- .../circular-array-loop_test.go | 5 +++-- Draft/0458.poor-pigs/poor-pigs_test.go | 5 +++-- .../0518.coin-change-2/coin-change-2_test.go | 5 +++-- .../get-highest-answer-rate-question_test.go | 5 +++-- ...d-cumulative-salary-of-an-employee_test.go | 5 +++-- .../consecutive-available-seats_test.go | 5 +++-- .../exchange-seats_test.go | 5 +++-- Helper | Bin 2564560 -> 2564560 bytes README.md | 5 +++-- helper/problem.go | 5 +++-- 569 files changed, 1704 insertions(+), 1136 deletions(-) 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 4a5401a944a3075f1de3a5e0e699bef91fbe2054..889cb9855b00694a2774c1649ec20ffd2e02f24a 100755 GIT binary patch delta 67872 zcmZ^s2Y3`!*Z6Zcb(0O*$;@s-3CUmxRZJ9AkdmcHk&*}sK}we1NdyHHA)_cAf|LV@ z!YWb}A(1km2pI(hMM)GD6outQ1wly^DN6aDnR91$H~IeG^L+2mbI4HzvZv2KHYi!;g!*B!}7)1UiS0OE7@}*(^{X_tDzS%`vF^6LLBCO zZEh{In7GqBmp^*i$-Z4)&_9bU-}z?$8R5*kyxvp0Y>s0)zkX_LE#}?XcHHy?c6I0O z8Jpu-&z*zkjtXZtcOF_WM_~CoyRS>C&${jOejwY}z@0Dce~+>0JF^aC*x1UQ1Im`$ zY#%+be8}A7ospju+1Rw5uN?kJX8U$_{;i?J-r70tKb778T3sRRuY|lKeNX-7|nKV7Ax`>Y_YW$lO;x(scvkM@x0BICT$z_!N7UHBvV{ z#qQYHba;CR8^(Ttn4zpIdjWEWvJ|!yCJki`SZ8(FP_~va4Vrt|c-Bf??PYO{HBmPX zV;gNTr+-YqVRU^9IV0KPn64yctG|q7Q<<>5)F}HDw)F?S9iOPsU4^TsZq3W;EZCexbv`aNRH(!^nwDV|Ua>lh~ASb`D-EWIwYH)#sjO`y<-? zc}$NTk$z$D?(nb+$)ALUU0ALd2IcsIYdWE3VdU*^>V&;qmat@7R2UZNjC@Zmn8vbW z*nYKiHXFm(V`?3RjjkONzQt(AEttQSy$~~Nvms4WYrV!Ejbf|SCw#2egSNzu>c;Px zt&y#M7j?@Wwl#uHQ6CSt4bNf6)jfS}yX`jNSC}~1R+n8>=MT0GiAiesvu<}i)AQ%B zZi@*E_ZG8fBC0><9IKlWmQoS*hxnW_vH%CLUHl zoMl@T&VE!Mf6=z8mMvl){9cR`_YyQ%W;@>DsksSZqY|zh$tt@P-R*7}+JSB}kr764 ziz8Dm>A@JJo14@1ZH?H$$w7Ot_q7qf8-R(rAQ zb;w?8%Z?dA(qMJoTHA5PZmR><+2%9$g?jFFTRX-UL)v;<89Sl+*W1>{GM_s09UF*j zt12C^JsHhDhw+DPd1$kT58Jv$vOa39FKh$i+z(Emp2?=3(XlXIR%d=^OA5CO>DJ8wd*{uc+IT!rcy5rXId0yhk`|2+l^~{n$wu*(m$~PKflz z;q7ef8+BOI@LuCtJGEqGc+Ys2t=@h!Jg*kJruHulU+lIe&s2Z?Ec}CLHbV6s5BD%z z;uQ6KdH5HMbx}*c4o`_oYBVa|C_Ie{*Re1%ag=)gr|@|UZE@n6@aXu|8?C5{F&Abn zzH`@ba^IefH6{hlp3l|gm&3y&*)@Qw@Mi1-^^>ab*PK|yP+P=_XjT9%V_w3>MfuYDYQZb~5`3vfD(A#<{+wO++8#WAU9w zORA%uX%yKfoJ~^iYZkew9$M9RT_c;bHfngc$n40Nn`azoASr*TkM)Z5&13oS$G4FK zvHQAx7b&y9)p6fNc4W2~4{ZNF@=5!aY)4o^3+-76)}M@Yhdbk!s~IOFyVgSIG3nRH zbLngm+xy9tGXh~GxB=(ZJ_Oqx? z3AX4?>Y4ANQX*Nodi%$ypQG4KIDIZ^2g_9#{V(e3Ft$!r9*y4I+}*qst#qL)#Xw3e z1Fh~t`zg_@+~;=0h9&HA{a_&FYect&tv*qIpAvm4@}9Bp=wi?Gm~QhIrLSh_?H9Uw z8DS~y5ea)*^?_e!L_<=Otwt`gft1<^%q4cKy5hO$M{2R3)be@JxW0V|U%wqa39IGV z6y32tR&&mw=qu^$lsffd^gWCnhSk4EFJ~UL`K9P5a4@nk7h^CA7ynD$+PGVk*{wgR z8!kuJXY6P7;2+T&!r4b^epU3*NbH-Y*Q3|kSU2_X&FI56wm@BYEBcji_V@0@m{#%Z z54Br-%&+n6QT4vMF%oXb)Xw!{lESgjL8&pHJ8W)AZQML&enay)xp z{rW;oe;fN7nqG=&&GOU{moPqS3(B7{&#+(B>wm`dX13@owQFTe3S%eLkySAr7(1fA z{a4JJjJ>ROyBf0|9Ti;oC+2JRB7Ar)X0a`zG4!||Gm344((5skSx=B}ATGnQ8!_8i zFUY<~AwzZ|btSYOU7xO*Y&M?S91GA{>{Q^X=`IZ0u{b+++Wg zu}uJ-?8Djp@Lwl;I<8e|o$cEal8ejrj+>KyK{uPl`_n58wo=sdeeGu=*&6jwo?ekB z)MT$+V63m&beR3$C^klIIM!Z=vB8i%&VG=+w`aWF5zfx4@ssShcj&J^JK26AhP|N< zoo+vBvqfxzrqA2!vG1Vk^H~2a>d5Eq<09BZwS2aHcx>I;OJj_MT3?-SFVX+I#gS)I zbm_X*Yozx!|+Z%+VSGiqmzru>tKbG0g+t|D6*DJ8D?dHC$ zH%Z^+e)-c4vdB5BBQVI=Oy^nJ9j10vK-)|mw$2_Cj*fKvdaUUob^dz$lQHOm&u&I> zJ>1bz2=%rgI;m~8*k?0a_%rH-qg%`!$>6Y4zMTd$PX33%l$hn%!mnKmMxg zTS%?w)@|X0^v2y@I+XcIw}qY4voChI3wL(eYh%pUAZNGTrSCL#Ow%F3bGz-WpwDi! ziw+dt8cy%F_p&Wt0J*5QJ!8-XPwugIvV|{z*Y?=ow{@LwD47ByRQpcbxARE+Ol`5( zek^aY45yFTC$djA_xREtfyVM!g?)24ZYBOcVedH@%_RH&*tFhgyxyYN zKiOb4M~TH@?+D{xjNQgos>v_K{xpGsdhJSVk9usQ>T$#kjo1BT?YNgC*$}l+YTPl# z_NiCX;y!qQJ*)2M7xz~LyQIFE7v~8_>pDLu&Jn>*LsfoU3fm3|-nfcX$A`N6(8n(^ z`8ti?(XVah`2DQj^~SZuqlntJAg*6HmbGk3Ts~v}gTJQ6?O+e6Z$1-OKgK3$@bL?A zf7?>aRCQKdY$on!Ki(dZxg+?i_)h@ z(gZ3p*y?e$@7=fp!IqZ{WrD+n`^O)hj{mWr;h^Af)*#4_$$n1Mq)xgor_IF(pkHfDG93yRBF1CY$dmQ(%dtt*p zjuUJEJd^Ht2zM>-r919nBcLMP(JUaz4IPcxAksYy6B}Z>Gw{Uqqt*l`+ngAJQtb{k-D6Gz+V@h-jLF|e$$L&Rmvn3+A`!zPYL8+;=fs&1ck zPVW|uNAIA?Lh;^*dzv~XpcgD|iup?tyx-K()>cb`%BEP+iy$>~$ii{a$mP<9JoAI_ zXfwxf)(qZhhKXWDIM&SZ0K2`axg%Y#T60WtATcz_cC~+V$6UrT;LN?4CQ<;_!jXaH z8logXj~0$YwkMr%_FhLS24~*qcq9Ckgh=paJ5r(YKF2WIzqLqt3Z`Z{w%ZzzXk)dY zOP1q3TaS2BHv#E>RKMvUQGxUKJKnL?k0bFmlstfgb}E*{y>R;h$J@5VSjcIGq7pAitd>ZB++M_ubtH@ZamG&vrwZ zE^oTS<(Hu-+p!I2?7bex!;EcKM|E@@)z_fR&W;wW1q|)%Xn?E0i=7=1#r~((dCYOm zg{KL@>&Qw>t@EY61T0Fwp_|m=c#(@?#(EcjRrOABjE-b8;plY7ZuXTrdxqn`WLyTG ze--mQuD_gHK6oN)z`$G9g`g4GXQU%21dYIskdB}b zGy*$HI)Xyb2<&sx5fp+(U|*1qpb#_yJ4QN!LeL28OVSY(f<|Cpk&d7cGy*$LI)Xyb z2&|lR1cjgxSOw__3PB^VuSrKx2pWNXLpp*&&XashabOeQ<5tyHJ1cjgx*g4V>6oN)z|05kiA!r14o^%9-pb^+F zq$4N`&4W6oN)zS4c-t2pWM^l8&GdGy?Y|53PB^Ve@RDB z2pWO?M>>K+&E26oN)z;iMxd1dYHVNJmfz8i7TUj-U`U11gKEb&z45v}hv^ zi=n6lg`g3bopc0+pb=Os=?DrzBd|Eq5fp+(U=Gp|6oN)z@uVXt1dYIIk&d7cGy+Q? z9YG;z1m+|iK_O@aCXkMx5HtcyBppE^Xapvbj-U`U0+UEbPzV}o! z8i6H|j-U`U0!to!8iCa#9YG;z1eQWNf*{(h+=8rqK7y_g6SPI? zEGRnKf*)ZEi-V5sY7Notr=1bX+EWT0`Jj;`cQ67Kf}h~YHUfPF=Am>1jUacVbOb-a z(}~jQ*Z{1v0k019)g;MX3`rsQ37$tWupE3kaHZ*rI0RlDm`+C-$lVZ?pdf5v@o=u2 z(K1hWBaTnU1z(SJYmH25!jQ4@hNL^gPJ;D{6C;fACT`~=SkBhW`+BMr$*&YRhJa@x zq9gcpV0n`e>%gm{H)uMrXC@m^2!4X6zzFmaSfL?#2^v9un$i*c1kV&oM_^Ma9YG_= z&rmuYJ;1MHJb0cp;M0NioQ4<%UL80R1bMn4DFi>kGs6h<>F5vaIYcISb-W0g4s74^ z1{59hz)zBArV;2Puon!;t0MKf$wt(h=B7N=MKL@+wM4@Dn^h=?H8!r6Xtrc@3o__;tJqp0x&iI>rNg z&48Dn5#)77phEEL*bko94fqJ`4V2n~SI2nJNRrnZfeOK|V>@^@81NC8&xqpHu>>@d z$Mv%8qI)b0z*-GgM>>Wx+ z&?>lN9hO}LEcX32!4WR2c;vh5=uwVN^0H3p43W>K>2-2PVf^v zJ1IGV?V{uajUex)bOb-avxm|Vm`dpg8bRJm=?H#;XCI{_un#C5K_kc?QaXa4;Mq^< z2<#(DN6-lJ0ZK>k6Fdhg9f6fmI)X-!HA+YD6FeVNIs*HI(h)R*e2CH!`~=ToN=IOy zQaXZ0kUyhz1V6!Zgwhe%QC(8KM`@?&`GS-LcFd5x1dSknX#^?+Kf&`Ar6aK8l#ZYo zP~~zo5wsEcYn&3e{UpfWkVKGAkVKHbC5a$^M-oB)o+N^Nk|ctBiX?*k14#t=N0JEg zX_5%?Pb3lKpGhLfXGkK*XLU*SoyASNzJ2kd*dDy+4EPD&|B*!So+pXm{e>ig_g9h# z-rq`wy@SiC z>~E3?>?%nF_76z}c8w$gyN(iWTy@}ze1miZc9SFm`%ih|1{4AdN2whsI#3ru5`jgML|{=Q5m+=y1QtUQf!RqSuvn6G zUeop2<$W+9$*Owd|lMh6PS}E9fN@h2y6p^C6Z3Z6Tn20#Dw*j zT$T)I1h31GnA?Dl;7KwhKS4=0B)PT$jo__=(xbrY8i787ryfdZ_By(Ol43xvZv<*O za7|4`v;&rA1p0K8fJa6g0YAbPfqU@=32(5~Am4+bMWE?e3*K}D_FY3nd%Wa83@lF}=m_49hQvA{us?NR zJv$rl6O=B7BtL3EGoX6ACXnOlMk%^e3WCyuQanZ}2;QEC#CjR<>F|K3H=;ZEbzlwq z7?5)eXgWOL%{3(UxFPunp1ww)pP=+JB>4#h?lN>>x+jf5)*sOmd^$RSXMh1eLCHf2 zr@}zQlc4Fqo_tD&$_7ybJ%bYtVkjG8KqDwa4at*FIxp#T3Iy|6^L7**TY@M6O$WAqsR2*10k+J5Mo?ZQ-Ez{cK#T!R$8(^pB;6{+9AIEbnvTAptVRq2 z&l)3;twnSIO$V0u8Ui=h>qz&y0ga%%VMw0!q}xC`g5o3Ho1}Y-bOdE1O5MTpHUbxk zO^9}&>A-q!CfybUTFh1h+SY_KSWn+O2<)DB5%_`NHpG+Qc@N?6cD@auRSv;zn%?;xTFC}jw|Akq-%vp+_(1NjrgC}4*WgTb!@XZ~RWzE2G(pBeBT zL39PrQN%ouKQ{u|7l>ZqCuqk|dJ24BB0Q?{6?PWp<|$9OtD{1P>iHU#*d_7_6x)OR zEusU+-x+b_?+GUny+A&Nz$*TL7zFZg=S- zS4j3$CZyW1t=_+Md4Q_?t#gCwyQ;HT)&9}BLiJzM*->RTbZ$}Qn>w*K{x!U#s{E%j zPt|S_*&U+iuEE`klhlmJ!ik;;q7upVQCuIx^>(h0<@z|TkLUVYT%W-8POeYndQoRv zRgs9Ai^!6Qo@AXPRi(C0tbQGxvs6}(>r;qIedkbyAA9>#bz-w+o$Xa$1D#K+EZsR< z|H@ryNMwz4u2Pl8NSiZOwKa9lV)&)A(o9#3SJ}Npr3IHWb+%WPES)$`59r*eDlK)E zsO&+V&#KBpT;JNcUXSN%<2Id@PjmeKux{npBlF&NI5+`?@m~Kk!o(pL1vgo1psN)`|JN<2)FF9nN+*QzOyP z#LM>TFRYgWT&XU!TksX_C!f+n%CcDr}V)D~R|pYcv;>}@f5 z(#Ym%jSF-(X`a^L!hz+#y!>{XhR;%D`wOuz#Ol8~ojatxpblxD`1DqL`J=gdNLV>! z{hKJltb5&d_~*C8=h2lFUP#pMKPxUIj)of-6I0-ci;110%jz0GPKC@jQrxgx4=E3X z)Q05W6SM7QJD$|L^Zj3aM%=5!}`7TT`;jK@ui?H$o(rZ37mf= zK5XA;bqj{|2@*^HPD}>vuf&If!r0#-QH)#){tn3nll2cuAzTefF*a1xLdDwuU|MSg zVa7k$_<(rvpTx;QqW2p1#i43_kp}*2iR}#*SRkzC4LHJC30|AHLwJ~1eH(Ae5mgQs&oH4a@10$o#UMnAp9y37Q+)IAm1qt2(nfT8*M*p8CjMf_74)53F1)uRo*)- z;ie$253*NZBBmY0N8ls~qPWz)*Xkk^)8MEmPELy8CUcBiVdDixMIpCUMx9m1>PJI? zB$n9gS%%-lCC(N$m|ldBem?ATp)sUcRn2pYlkNNYfDeKSx41bd4%jO2aq<)=ix1m7TbZI_v^~cXJ+)CR7(o461f{jb-|RQ|eC-ClI%skQyxIk$ zC{_-5>xyUWm%EWz4&Cd86s^_6ECV&kN)d-9TJ_{vC;zLynIc|e!f9>}Wz#9Q%j(ut zaWfM}@bCg2Uaop&aVZlP@$PUuN%3*Fa*sHa35WQ6FvIt%h3R4vOKi+LIfol(vZk(W zC`K`1=JS-npcjb))Y1&`3eJo?k}IDgI=89sHx_F#;VMs1Zzd^Ds1;4bK1?VcNpkiG z;%YUknV4V`2JsTh`S1=;$`wFSOjZYh~Fn#-j?@}^IdrHKJg9V;TaVD z*sH_~YF4JW!xpqsUA!OrJK!Dj9>B?$%nk7*oYKV=md)n1#IZ8V+6EQ6XgaTQC~YOW zVQ4F{d(aHQus%Ve{Xwz6P-2cfuk1{<@IkQ=OBz%yd|ic6X>hjANLD|4NEBFN^`wpp z_4kLx7B$m0|2imb*EX0oDZMZC!7k1Ve_B!MsS6(wZ!_TrpR5yj2PA{sK}=Eiv=ax` zRN{`UgE)-|`FyMkI9ID%v&HpHaL%IgPP{MX90J;9AwdJfihK~EVNj%9I@3)(*_4zrv6vJF2N!9h6qsF)WtP35jQih)_{ z)5VY!!J@BQNMyNtNMv7kaduEz6q6vkhnSzR!CVHZ5m4ABLxN9wh$HQp+&>gU)?=91 ziU|826Q{)%@Tr&F7uxg`X9@XyYL;=1fulWfDY9HJ?<4%8p%+#xV0?0KaYvANsy7xD z(0cn|CGsT=B`!u-U>%Uif}KIX9|VkBiYP z$x6!gjTe$-6+Mzs7smA!Kdn)HyeH}>&J{Ab$z*f4Q3R*@i3f!h+(~SiLl$yG-TH)h z#wM)beQfR%ieb$Fthu=#D2LoUoXi1HL$StQ757mCaUrtm3>5>#$xd@pn>GmEE4cd{ z`IPvSU@a-Ub%&thDe;QE9`C*lQ1zgzKKwRF^a_>So1Nv}tX$0-ted=5C7wmh5_oZl zc);4>bmlXE1>_FJCApIS)^aLEoduWA%pdSgDw=Dv5o zdUUkdl?5LH&PYj+IaVx6Ud`)e8ie#Z84Ub)t$rOiH&(nOY~x06+Ux+eY8)<+Nr$T0 zQsYHrv)=alyqzE}7TR(@Y3_H^z&jC*GuhlU@K)rgS(9*6D4Z~N1w8ybB^8-N$jjsspRJpLBEDb`<31`4y1$6+&*A%aT%2AMj|cVL(U;KUnnqg&xpT1K3w(Tf z!qGY6bz#FO>a6MfV9;Exco~OND6Vc&aB(i?9mbb{sd!V4o7X_zh4ZmPEVl$zx@bBs z^yUln_L#j#H2}?n_X%+e#lhBL%S@0BzK^j}7A+Ld2Y1RLJ#3MRH9Y54RVc=dPGa>b?l_|MSSIdag4IN`ED%37SBIc2Z4Vrnt*BD*)aAsalN%> zHs*dP6Kb#1S6kjfJjSoX(VJsh0OY=oc}SMOJ@vW>LfH`B+M&cPs`3V|yFyQMLFfHn z0BhEx-IzBj6QFQIh_|-;P_&EPoZel{sfCVnH9<#rX zK~Kk^EkneFyMElx*=n$__@%J&y&ksRjjgi^zO0xnD=!$)P5ITmNl?eaOu0^ zZ^_l|VBKfjRy>KR$#7(wSe_KYPr6&oo%9|f3MgIhTJ7Wa#B27FF_h>mXxqgriN&Vx z!+$)yr(37v5^K%RNTr0t{7(w5mTW3Uhz%4IXWld;$CrS ztZCJ4dqIy9sSd2$C$6xpgWvUp%>&N|A&#o*195TNeNgO?#XQ%3+N1*C9N# zgoFjJqDC$srKH9{k59!}LCvlB6c@5U>kB`_$r>W2!hPK`qM-f}@o~Y)JwzpUblIRB zK~E5fpLaB*FDs7XM%fwx@O+LwC?IN|<0iB*H+KAh^b0K7noRh)JzlibJ0?yL!uYH< zy+C8g`URJbZO6o2_Aowui(u@RXu;NDgL~Nls{EChWD8p5J>}>Vti2!~2y~C-Xi+oy zYPJoOijWOICQ63(-EqS+;A^oswuJ9S(gwlWkz%SUe1jGhYi@%wbKvuGF%>)~#HG#w z+;^J04iFlmKe={7d``H*XWLXh+j^?Xw|LMEIx?{D@lLM#9G(O7zZb8^nkR|m9S^gi?Wd2a*nUOX+I67S+gi0L7D%QwKjAMyIg3^u#C8_YP3Jz(xl%OL9~ z?4Ke&>^b27NnD?h&#j?+urW!%*CWFXS9+kay!*5G%>P#%2RUc(?$o+r<~5lI6=!hw zm`|C7Ie8yXR}0VLIw@2RrI{GUeg8?d)UPiQTlgWah_hU+I47nu!MyD=J3a^4d0dvR z@(tJoSaTjXbj__To99nlFg(BDQX0d@C7-+B9JT5fu>%X5?X7=9vkqA5*55E=^FkUw zTeyH?z}KC+5VCPBT!?eEc~3m7EVvjlrwcc_3`HEI{4Nd`I&-Tq59sCUvfr^?c8BS6 zVc#X3O@Ufeb#b|%_hr1Ls1`Q6CyvO8%i^FK%PAg@|G-f;r{D>=`A5jE*2r@EpW?8@ zYWuvfm_^XwiukGBIx0ie6-;VHgJlZ-*_O8}#fA1FzOlt^coo{v4c_DX;bIkbjJb4d zgBgE?PXE6{cAJVW23!Zbijf0ng!#H?O==MSK`#^{Cc%b(@WMIJGwhl;JHb4(b*60x z}wbY5q3^v^>@ zymYt5o;FAI*OJitnA3F^*qzw&v)oy)eu12GW0>!hj>n$mzB?=rn*M_KK{EwuTTsDS ziJ_HFM9-@wN`0*DMJC_Zw**;~jwghTrre9@TnnYSc>RzhNlMTR^-0oPp@d%rZ+Vpx zj8R*=q{+dayVNc93G&VU$Mii$lGHD#b~BQ&hfPm&3ohznz?bADhlod$aqI$qqOhJM z!l2sH1goR)_P(~H3O)HUY+i~VQP$kA-008mS9$w z)M(h4A`J>Uk=g5GvcT~B>W5g3kcy(|Q_!YUG1Gv^(j>fgG!OP*lo2mW!-Jw2VT)yH zO7*am1~uco-avXjsE_1(&~VHSb#ga?w*&X!q_mtTc+x}Wh*98|>C$lPFu|4Cf|>ZfV?c}`=FMzzCXmDYxm;>HKZKgur1GoqTYMRwj znk^LYEQ|P-?<8m~^&z$Fdp0F2MYbI7b7X z0pEf|XxmAeDp)50UhNg2b;5BqbJzyLemp>xb`Dv0bGu+~t>)u%fuC1az`iaxY?iU{ zs_jy>NA>l`Y(W`Z?5eN4{BEZ)PrVw(c9Xuh_WtIp?gq&1F0Bu$&du)9Qla{-Ne-;( zfkUv3uVrPNThzSAq`BcimhG8_3l{4Wvc*`2qL9glp))s@8_*<2x|?X$(zJ*O724!V zcY^j%p2wxhiPpOr-@-|I;N!=oJ2gzWv0Bkr_aRmvfxlnKD&&14WRdVcfjyPO{ZkpO zpIro;C zAPkf?Cpq|J$mYdIyk_JJ6$8+{lnla6>hA-kO_qV0!;H(qQ#exQ*^2Me@e4W6An7;D zo1ErrRX$Yp!6&l*gC!-&tVcfI-#E8YfhE&$?~st=ii5-<(zDh&zYUfh!{?HH(=rl3 z9U?7DO5=8EeX4NEN-wEXhDwovy%63O%ZQVo9;U0OhD)27u#R`Hc{PdO;*3NS5sLYIJUf(z zu^6_F!uerZnmIrE!LrfP!5U*%1l}>|S+fr+9r<+S%Bw{3$c=$ zq2k!_($K`Kd_P}lTK)$3VZ3xLsBdtejra4z(N3;TkOo;JZ=MVAYnO>Q|18(Uy+$S6 zoG7hN%H&rAW1gp8NUo%@EPg6OQa_m_wXy}xB~~a+tMM2it%U`J(jIGrTEP4B2;@GE zTLaUdmVqz@Q=1)T-UG&*QrAwAo~?PEeLVAk1a)0^~l6_HAX$n==NwPm`8f zb7>oQ{^!?Ib20~EbHb-fE>^>R7D1C4xad^BN@@(HGtlE%j)a$!28GX|?VU9*iJ|H_ z98vR#iZ4H>ajFzNFYOg(ayPN!E$Z2a)z&kmMl9Ca$8~^#&*L@joEM}yg7swtFQx!0 zX5n6?`7CLLeHS13lTi92W`1^-R2 zvIw;mG*!z?Ku|E_dPVrFl=qa7jiCG@8m)O%aRQdT7;=EC{Sr=GtBp|jQfP0zgnrQ4 ztne!A1!azOH@TR*Bhx)4AE1tdWfN0HxH1^8g+8B@8V3hnmewYx@x7#ZhqwPz9$B88 zT3em}iZr+8NRI(|9Mcdo+DgbZUL`d%03}eh0_&d7tsB4H zT8X1^gqMaNdapvevaW7m-zs!syWXUB52zyURdYew91-lI*5MeMRWAp;%1VLa=g?}> z)=3U{Z=KXBsM&0tz8JkO<%fpVhx*T>H+}teyb`FE)q(tsIFR2!6AyGAzWw41d_x+M zU_~aYz`yH_k5Y;2rQSjqU)#e*QpNEBX1#PhDEGn*xP+N+cWHcSDu;_3aH|+_HkuD( zh4H~ppa*B%iO4yI||v zn7!p7K-m;>EJ4u)^*2icYmD@Mb^d1Q`*7=?&-5CN)xvkt#|cIJ?xTe7n(^zQZPNGn z&7bLXVEzugD+-9lN%Zy(sZ)*RYYXI-NM~vUr-7#w=SLuis?z_%*PVqK@8fM#AQrBb zcnPr+mq{nTuTP&vBZA+!?36xZ*4yzIShG81`O4da1(>&MbNF5m|F+5=eF9qT@~I&! zy0AB-N7w8{>kRa_uuqztV2Rvla);xq_SSvaJp(LP+d_y~_xR$e@DjvibG z66U2w!s-LkJZoRKADSG*Y|NVN=My^{wjRXOfoU=LDOefqqpDX4zpc~sgM@~@wz>{q z1~qAY;tA7J@QOH}hQ~jamIyPspE0kK#;8>vOKQzy;uzR>C}idG9LAdfbB}5I>CRAk z7|&eQpV_7Y`vR|*zWh}BBFGbXuS)gcqtB#;)*X)7iA5kBm1;x$BAk-X9g$uM8nE0W zk__1+@%=38C@zk3%)>Z$lUG&ksDy7k=F3YF-+Xsgu?G0YbC$=;Nt-q8WVnIJ%(2h$fu<9#mT#e_Z&LA8|M_&CE>H;WVp-1@nxHK&2du;zDeM*(% zMN2l{bWMeQ<^RVzumuV$(E9{NKKEL#p<*G@Dt=kJ*FHsfHfz8->fy zgcH&>{Ehpvh5A=$-%6{4EWF}dX>?+_dEt@AGcSN1-$}pPcbQuZX#G9Ti_ZKts~ooK z;uhZZ^59p?f zctOV?_eWf5&DYQgaPvnr!Kqfx%4wW2b9h$f>s&uzKS{@H1kb^TM(obO3aR~!E2Ly@ z82GFxgS<0X;z_IF?5y5!GZqw{)sO1d?Gf{1O9M-rF}92RQa@|gTJKT#-7ifF>TvW; z!I!`l=g>`>TM2X1p09s#?}ADHlNQ)l^S;2}+MY*y&m2udWWMxf!m{(&TJy2mJjIkl z;V&4xm#<`PU!qiJA@^5&-Pkac#LJNPo3tZn`zc(&4!yzqqKIG16~M9!=rc{r+6LZ> zID#>J`JAr$FX|J>vQwVA0B-({ofGJ*!b{k2D;8j1jTWq@O`d22T13Y@EwUJ=IdD^Mq2XjLD6KfdN4XC({Td+X)Y`ue%_yYGH=KD5&e{~lx9jy`NL$+(B$8|i&AZs&M&BIk^ z*veejgLVX2cKqV_pv~nCn#2AG?2|qd@NKM9xa$e4)6D6MZ%ulqVFWvT8tz&fl(Hfc zfA3Wk;R=2~#@uk8@Jiz6Ba!&?wJDLVCqlz&o~>{)N4b{P7)iW|)q~9uG%JPHAMJvm zJhNh4(}KiOT?}+AHhWr)%}b?Tq6?1iz*nMg?XH)Cl6zxa!5gQF*pN19aoFtqIBa&n z0bp2gfgXnoJ!_yB9GHP+AW-4JFB*o$yGGUM>=RIW6X(t!@vgUmk{cuRUM<&CL198d zP?K`Fi`lEL!C*Z6@(EkQ{VVB>Y(&udVs!vE^F@Eob2QeUL`{*RX*8H7|4fG)77c>x*SXx6FP!nV_;be zv|95K;~3vi&C`P=n0TM-e|B?2KLPSGUHEC8)z$t??CNU12FeQ2P^VQ%PP zZjCNl)dQhZh&W#t%}rBh{PWJ(hk?lWL8ktI=o)I3x`jK+5|F#NJ_{-pzgi3FD1F_3 z;n9#)#s6qX(Rp2Q+|5hM95~h01vR>H1paYoEXIt5Uwd^AX)AuN8f@N5kB~~-?12+0 zFqUH<3(?|dD3fcvL8s|2RnvO9^8PPP9k|&u#GZ0{g%n@WOP}zjy#tC3VODR~z@RXH zZ!Fa8@0PT>06veU!mK{7VKpX8f&RD_{Jox%6S8@z%K1NhO4@Wh$j-@i^|W4UoqS!w zOQqb9{#*8VNSB~k4;uCj@hV2xN({4X;4;7Eo1<3sbu|ip9+sa78R0cg1oww3Kk0(V z=ned@Wt5@ghZ9e^X5wGP${pmwuSe?8zxuufWG@=~SA$$V?Aa7K48sOv!_%xN%XG2W z64?+GomS*RU97Ba=I7VN0xNRvP+e<@nl2VtX|wXN4LOz;3zFcYd^F^8D-7$0QLGeL zHT>Aci%~MID8ev|vcVFueiFPs45Or3$=Gm=5@togO1falaI}^pE3C?hVx_>E;-ngZ zxfEGp{t=i%pVRdoWr-$WR$&5Nr9ED-oRy?e;3;rDC!e884VMfI# zj>dSIR$A;`3Ep@fx9rzOV|ATYWTOckPUDxH)5f@b(IqqhAb;4fF0>iz`qdUz4;qYf zZBHmR^WrgZHN)Eg`KQA3Clt{h(oz`s75{@8LFQJ+)(@>({g(50~{S z4xssEHhx?3D)vag|DhJYg;Vh7{@Kf2*+Jg`VZ3Bmt1GrIceM#hQMDX1u$;D@UozbL zJKpp!TH)#$6wki`%MHZKU8x(f<#&y8zgdZglR%WLRUuXLZ%VEQLte~i29>Kqs#dr; z8GnVLD`o*!&Du+W2I!vy`N_@P_$Ij8RZzX${FiWa9BZ(;fqwC>2`SvD-v=+@J3`c2 zoN0l0MteW{GgX3@*Shf2MXN>rwU|LjyxQ>eYp&p55?8!dGfJ&WeDWBxPG2*vth99@ zU6=KGNY|mZF3g^T7ndKt?&=a$B*v=^4c@>FZ6GTgE&O*jtMK}B-5ajXL7ii?<8BpN zW9)iY`=AuL>#J8XdDY8U*oE~Wb@XfqF{{!IA>C)xv9m9vhmGpJ?+fV>;msO_!E-O; zThF#PLyU>Nh4BI-YgGQee{lc4`Yo(gU=gc&OFx>K9m&_4Oqj7zKMk0{U<~e>w_Wj& z`L?TDP!B3^hqS_oH~1Bt18JK=;uUVH8Sk}MG7`bH8CQouJ-u6Sc9p%7;e_Rz^-XMO z4bpDltf{pn#Jn&?jp>;(HzO8qZ^4`c=9Rk@yFZYhri+1cv)&1@7#yp*uHb@2l@qszG)vna(yXi2=Ha|OSmMeJ?xCHo zd!WV5l>1>)DON2gMX76jP=3oM=&gL;wIC=8o9Gr-j!WwTV|VHs9BUM{otQKvCmAw# zyV}E%U9N|N@(QY6 zj7k2%2RPcjKL{CZ-v=S(8u8xw5WjEg@S&@FP=_u1ux7k^(O6LP{UM%1*&kvRRr@hn zpxcf5z4%dxCHp_B9;FT(j7hV@%mX2Q1r0GcD^HoL0gOKwGF7#MxQh+gAV$GGb-)D5 zLNYKcwAqpj2MpHGumfgVs)fXB@^NS`x^cE2RsTN7IfMps_ham)K#{qhgjgtAyae%w zTnmHxz;_5Yu7T2W4~I--oD{hKGp`&V>r>az1grnZTEM?l|77A**CRm@t3K0@RiA~- z_`=Vy=7GF0O0eVc9tkO_LKm%)@UK{gXiIf5pp`!l(JuSkHM!<2@g%0Dz`bAK${VPI zF}+^b!vdMz{30YXj3UC!V|Y#vL^*W~qXdnlJ_eJoG-wEWe#J}1Enm7C2SwIOT{3A? zzjAr1Cp++W$_S|Z3fG80_MYP*m&E8R?or#8yB0+TMpmu(*0m$DdS*p(+FQ`)bg&7i zzSH^zTA;F7zq(pLpY<6H!2YwVYamBZ&bgYC;^aBpm>vAtl~p}i<@$^VVBi^?$^jEI zk{ODav)GDi1*LVZ@6iiNf-`3^ziP=0tx?(=e%Jlg(`H|9&`eM3hHmFvnW1UdSC72p zdIJ&0{SSR$pdU;B7jjR8E$rF8s>?*25X({_VOOR8HPi zeC!C()`6z?r^Uhx|F}M}-|9?vI%UAF<3t>E&9%;M{UroFY==9nb=$Q+=m~f09UPm$8Z6w!aSgnCVE@#CiJNh) ze&?=hRzR^b%Z)cS*2^bL)c0*8;ebMe| z_5tRrf}Y~HAVb1Tm&VTHmnmV{@Q&R*%O1wB#7?SNv2MH$v4#x1aqb=VmgXZWU{Q6| zmJWAw7WBrCaq7d|c()?Nm{EyK zCb*a4U+d!U&^`Hk0zU6L-DeWd@|$k+-pTnaoDv2bhD@a%Hx1lg ziSFx(PHs_Va2TeR+@IPX=HG|l_jTy|YW!&*e4uu_*9SeOvLyFVdjWqjnV^nMa^rLh zn(E1DCuO_}8=y&T_YUDkwJyQW)@q~qSYJq}rFGo>S@6WK=N@fuYrZk)JvKX3tONI? zxF-g30J%Q)znbFqhKAvNoE7-Omei%=}HCrsk$%@7taHLz!&#Vw&Ez z&SvdFZh%b>G?m@scEkDx?!3^j$@UU{{fl3h-QzwJ^aAKj*E`274=x&_SwSdl=ni(c z6&dbi*wF{~g0UIy;G?oP1A8anm@!`P_Q2DqW-jBm;XT3+joiVTVl1r=^vXrg*Q>ER z_{8RGj2Q%6Ic^9gxVH&L30i2HxPy;2{wCNj0d4oDAzIwh)P{$fxdr&9sk=*1JiPV@ z-l6%LVLJl32+c9mKs8V+!P58e=(@hS+f!p#xZyo~lZ(IC{fJP+{c_{kG!3q*dH1?I z;NOr@xCecU*iYTs!rdqM*JLcyJvYc>Ez88}1%9_IWVxpandYaJJd<>FO_rX?7H&)1 zpz3~{Ej_ujz(0QWfEyPnz9d|DiHgpK)-BQg1CM~L6_y!PB~z29pbc?RpPJverfHVA~<=< zZ2m@E0At&@RqNha;$P(8U&njIjVrQc!2U;c)8k@e$Zd;apx#6 z@N`G_0qd=#Ewt{0Jz30O0Pz>)oiML7-rypb(HX0i#$D%muy=8PZ!hPA-&wub#eHA! z`=s0rJ^fUEuU-jSH>_p>UxjwT{O*`_;E$_j^}xQY4KZN7&#yoK91rDYo)ySIHsLo4I-u$A^v^bX}r|e zJvgXHZ$DfS@AP#K3=In&M1Mal_k`6uW1qmB_gmscT@18$?2{-4x-z#v?ne5%y9LF- zpxM=HcDcWMP*7Oz0QY3!1b@jd;@=_R&n^bIKNHIN#B0e1pbWO=xep4rxD}bP%VEYq zT>eh-VDppQv(Wk}47Tda=TAA@#NeQMmkx4|uCblSh9-k?YFfR@6XOQ>3x3>@k5veKvQm|gRj6K8C5-iAS!Sl@M-?T|WEj@0dKK`8 zWy7!vIebdx@DDh`rosEe-FxgY)*#A*ar-xKgnNTfJ#Hqn9*H^szq+miK8oV|XD=b- zLdhNFb^`?N*n=d}5{iH#Bq|Cv5=ALe5~YQjC`u;@H6TbL<$+QXMVbf+A_vkEMVgdE zQ9@6wpa{uNRKUXjJG-;(&Oe_|*qis>ym|BH&6_u~vol_9Nm|FpsU#zyb$x@QrhO_K zfu3dTq4c~2#uX!6A+&m=YqiO5B#v@rQkOJf&yI4X3b|A=3L|=-G*>FcjK=7AJk2!( zcOn&~xp3CzX#B>`;?d|VdQ3s_V_@)xi`zVg`9s~{BgX=33}INYGY@cBtTQimWU!<$ z{8d`9$>S~95+t2^C*_Sj$Jcd&>v5ZDinJgD9bpdN*teDJuRxyG+?2;s_A5}6(edM7 zMb)x~s6)zF++X9`7~Yzd8q)$!!Oq883~z3HsdCY)R)y(l&Z@&@U8 zK9>U#v~x^LDR}{OpksL^H-z2Q1-k}+`+s3vmj z&}tV)C5uqI+I(_^^OF{%B%O+~=c2MF7rAOv;+sGibmx$)SH;^-`-Cd&tZ(WP*9O59 z`gq<#l$)4`b~l<#ftBPTiZt2{up_46toki9V})TUOI;JfCvs!O4%YBxu5BihC|Ty3 zR8K##l@G{4lj(`&t_`NalJn`@YfW%W*16gAt2H;&h~ zp=g+=_2T?821K<$-R=c!L}Zgxu>C;ME2)1L%85Lx#1 zyIp7OkMeM@oCa(~3$EYeT4w6diJ!3HNbfvlpIG`=@4YZCV_?~{7ow)~fhFZ-Rg4^8 z;y#yXUg=2Pk6ea@mhHDV!mbBUgi&G+G zPB9wC;GA6otR;!2_|)~RsX0N?kWvofl-Jpxx}LV{2NjcoxbdlLV1Szl8bbp=bFHvn zougL27v1^H;_Z~I+qb)G(07MiPwSDKW>;5ziJ!a9+MG!|+|K3muwfK?)b*#+!6&v= zd<6@qJRfth^=-Y06#nCnqaKD09Xk#q*GQI8>=&$^c>B0{d-bBCFI+cua4AQRqM{QB zW3qU;34Ebw6RkRlG17>nQct;tI_?Xv*cQZuvY&J4)GQ@H<*%@JaBOV5uzwRN;1C43f9>=~&`d@a#sige6P0 zy5Ph`_@Hz?#ZIAfXI$n(!79H-`RT*eb}Z!2tCac;LI^D$FUChxsDlwNZALQSbhc$a zPq`}sApmEB#gKETs*ya#l17&paNg2Gj-9t)g^QR|j=kVoWSX=9*2mP~@s|+PPq^qx z6m{Keo@0zsA6i#}HNi_4vBafQ;LJuaF_M*+5V5^`$#uUeS_RC!3YK^ouF=iM`5@jz zRkZmsY(t+EQN|TiM;rckQsouPI3oOnVs=zuxz8BHGJb+@byvE~8*ipmqM?nUEBP~w z<2Al@;W#GU_MJbXzrOh`Ce?<=sQ%W{%@vZF-&sg1zY8R}SAvo3weKyfgrI9cm%hhv z>sKU*>(GloSXTNJ;{88>frZ%Y%pe+$WBL(OaDxQeu!K85K{R7-dd-?ly=uXpyJ{KV zQm>(-7(LYfGkS(m(B_|E`v&L4U%)Cz*W{jGEGF0cI;1j)_guG>8~>{%x!IcZ+<+Jr z-26&?$8Na#g*bz_hp6IDeB1Dw>ukN8IcjgaxLtiZHuxIda?J}o_iPXq{f_Ce|DODd zH02LOpjs`p4ek5L^CvoO6*o{f-T4zf+30V_ZbNY<)4GHDXgsjc^bf-I+9$B};o2Q^ z5I@9FhDf~|h$y>@u442ik4waxp1*KMTju9jnI8C;>vdgD?ZhOki2a3DF)~g0+x579 z5Pd0s=aEHae>3l)&jb_!o1JopQszIdu2zIagnwNHh!Vw} zb~}8+J$SBwZ+EXQ_lQ36HlHu7jz$5YagLO>-c*tojmNIm|Z4gor}}WUEjK_I>HDMbm4D!}P*54lAj; zhWMv5j4#Xl%_n;K_;^Z;B3Dguv@>O>YJeK9kl}FHEC(m>Q5omlh5>wn#~2#8l*+A8A|`NKIKj13x?XMD?4vE+w7sraWU{2R2=Q@e z6%P$c`EZa}^tn>DL!4xv$iq#1Cg2p0h$r~WGl`GMxA&=~6nulPC9=-BYxw?h zigg4rXQtX7`*^UMG}cO2haRafE_QC>26>gAiBamStS|Nx#E$%}W3Ra?o3I7e>@~@K z-W@_24aJQC$IhfstV_hJIo&s|Vo3)d%9F@0ibw2)dS^T*ibG8oHz{^pcnouxVUjq= zA93Os_AlO$#DOM6awODbbZ#UY(JztW)6Rrhs_+v(QJ-D#rI+}V;MB)DZZlUYu?hN8 z7Jspki|f)w5^wXj=wVz1V?S3_ka!${z>rFJgl}h*7-Dl4^5!e$v-nav)=WGbervf} zsAIcti(4EoIOlMc{>`7czS!nsAHmrxOC{X>nfg58TOf-!;lVjSHxDfP`xdkiI|qL5 z3-8tv9bp-d3K#J}w}LXFMRVL2KT^c0E-_+;X(vC;cCIjd~?N}|_iP_HG-1}=d+*{uc zdTPQy^V`Ii=yp>$B2G%rG%tZ@gmfetwPh#Mj`H=XwGl;jDzPW)i z5-{v0c85NVIj*A5%iYD7>^b_hMu83KA->`dy8)P9u%>c+XO)2ANRvkc$En4|CyGl< z-c2noQ5+qS&j&evq#X@8g{@n!JS@IxR^wx6yOxiLZ`=RY{iDj^5sadxe7FqaleqP& z6^?&Y{5Igj{Ul25`5(HxMZ#m^k#IwHI^I%jLN^{mk)_IVkUs^0M9nt6^T`x6*w2XQ~H#k%Z_N71LZu=d{PD5X9LURuNB z%!((`+l#sDi{mj*I%Pj4o^=#*F&%u11Z}_LcG1kI(NbHrPQ;g>b9}-xq7P1yn~c^} zh%~CRq%$iId zV8NcVCQ}Cj+n**Rx7W39aZ+TH%65flShk`9s;e*6^4$V-s1p&&id0ez>koZI( zs>tRMDSEJ&tbb{{ld=bkn0N8l7I7@um>LWb2L&GoO-~3uDifddM+_K&YWWeThk3A#XoP6qj07%b5g}6} zD*OuX_>YeSokh9;y1RA{PU{;bn!j>zrlC?s#HT2`*%?d{|CuP(q8({sThr2xg6)0= zrPUcNcJR-3GaMQnGg|EAk2pM9e83;pa!eqM#oYA981W%1v3VM)Nbt&`{MYsGyNURmrQ+v!A5yvzTHuxh&SE z{jb6-j1E+mB{rwV6UC=ZYhoD_p(cZYXA+#wt%+hclS&j==xDJXjd)GG&!2b%Lmd7O z1k9`+wR}A=$Ca~q3(|TFHW`e+9=&cw zKnG3f8p}~W!`ky0V)Ad0rSnXSa+Dn93_%QG^aVw#PPdrW7{ah|1u^tI>^c7yvJK4) z#Lhgg_K&)BBi{Sui?odd2Y5y$oLI3>T*%td%crLQSQgg%@x^e+ces8v=KP1la zFGHpib1eKki^P`Hc`mXUouYEC7)$3WVLe52#b{H10K)vHS&?PpJgXB}gnA@3$8cFW zPwZ@}Oxa=}{<(-j=&AW)M-xKf;=Y8ovrj;ghv!@DO~E$FVKVEskNV<`o^J6<_3z2( zf{Mk5EwJj;9n^dKnkl7A_LIm`q$jR9%Lenk@!X!}b+KSPaHTc>lVzZn4Go zp>|84uvlzCW3Rv@C%lO<#A3-YRQaaZ$K>;2&Mj%^6487Mcy=zvhD))YaJsYvgNET4 zfRL$Mu0;ocnQdIjTPx2JC@8R3t+0X>Vl-9cq54K&^1Kzu>Vvl|tg2U`ZWCHFU%nKg z8TPD{F>NV`4cD%~qS~lYh56&o_+==_s1}&Yv~QVzwVIQ>+*&w}5TZrPEvBNB@tZ=Y z+pbc#lohC(VZeZmv?gQe0TR2L>=Y!iG%gNdgkq-$2%W_6i`9g&!H^lcl4;_~K$$PB zw93pB_Sh;*2%;!)TL8>#qN+OI1}nn|A%RTOzr)(djkm@2CWJz~sDoymBi@1FMm7ao z)xo3qUI(3f2kypba|PRKwb;{Yr_q$Z8u7orhDor~77SK{|tv7>HG4H=SGV?E3j`E%;+vkwI19AR)!@i)&H; zu`9$gK1Lj37`DRn+mFH2Fl+_pcmjqE&m2zuc7drMcFQjDF@IPiA7F-PYPA^5YSSxr z2beTK*!;BH(k04vTUr;%<}~3~%@L>Xv6#Ms{cMk=?G;$7PXb{}t+0}VV)Tl=7C)T0 z*P=ItQ|2>>5*jhrTCvwscH*b-$b)Y{vWNCrJhGaNAry~XxDVM3+t#q5WZ!S`$jSRH z6$g8nF7CHDHYIQEoAAg_9e=2Q6+HFtbG$ z6pL+WNHJWYVa$M;k1l(QaEGGj1}U6$1ToSfi?L}bH)|NQC*|SonKh03(n2yoi8k{ ztuT0WzSw|VCs3Nb2@B_<6RaM()iPpKHx#ecESAgRH7Md1`UR$S z4mx-eiZZ;lPLX*^RHk;dDCQK3GECb{k!W&~3{F3vvUq5yw>dp|+S2_Lx-F+I9$L|H zol?u>4=}UcD5f}t{OGE~DbZv`9vrNu)l zu&E5@r}t9E1v9%^E4~5~0~!C7r9qK&)1I&3sVpRJ!XjM+#hvlb>!zVE!zRBNjR7Rr ziY+-~slCEEYXpd&`P$O;6-3f7AQoN+m*TGj%UC-MPWk$EjC|g2#MUNrRPx>!rme9p zvSLfVVGCpWVr}*%H1C_k!3wLrwW#k|urja;tINY-o%uIWQ1MxaVc323S<4!mR+&(m zRBj0sG(-)2FQqO!)S~KgLgyG2boQy zI%}=S^H@zWBvtZGVKBeCowLHSFTi4Bz{F=p)G>4E<$F*8kKVY zz6~qGLR)RRYQ@4BJoLaNcp4)I+QYm6fn;-9G6wSitf!fmfhxbnE0GHfp}fMFe;M7~ zsIP(zWh=!$Tt>WQR9Zp6Z0k|aD}ji^4Dr4dQGFGQtI=cNCu>w#a+G{8Hlse{;Ek}X zT#M2wER#{Cpt;wv_IS9$;_wti#W>A&TUJ`IWk2CHSex;{_W2b|b1I=u!!;{;@xBAq zs)Q^?K%pSM7>`*;!ng2@eu{YKTliuN%-jQ%yf1!dan}m$-d)yi>>WtycNV)BzPH%D zqKK^TEgl&#^O_ry9vatBtVzW?L~Kp`0WX{k%T}<1&tRvSV$X+vu=qelmij+hf(!+g z`wEr~C;Vs`_=n}a(Qp^pDy(mnl ze1pD_^B;(>Zv;y4)V~Vz$x7;1AEVR|3tltCWIr%$YZyU2a&mY*yu-+I}zs2#sDRtNw)JH~8VetR}Sgw%8h9Fp1_Pt_p5rD}X_Va@$hE z8%^udYj+@!vC4;In-mEo3cZVW;a&K~gQGOyu82>%r>bwp4oy*?6Up;8!t1twVc*aq zKiqnTyJvcB@4ScYDLwuX)AX~>wOu=gN_*OWE}+zoM*uGN$d znr^5s3PV{&`^MWP^S2@ktjS8dG{NcRyIi!J1S=>tT$*pc$hQ)mq3Uoc(|MHd&D_VI zRg_&zBD?mf+!^xJM!`n107-qDp>|u?CW@^iovo*TMaK8`1dXP8b)`4!l@3=;ppb7H zZBRrz>Pr7QQ}~A9n7Jx`ldmK~LfaZDO>H3I5ErNPvZ?9{>}GIu4cg(9hL{XhC9WrZ zWcvC`f&EiYn(YkZ71ZwI!CCtCr6ZBk%BXhi=M@+^0#k+ zOKOMHvp777e*>||cTAM_8vp=%~3yp zFplJA;1s^M^(fyVeA|~NOIK{pVcbdw@%?vaC>vh|I30XC9S`50D;Zdq%B=h$%sjHC4ApYZ|Alm9$}jEM0#)%+f0GdchL7O1!g=R#Q(1fHEPbR}4E9)cK!-QJ)=ut- zV&Vp>*aX~$E}hmlRBJXI=PT$W^)P>zdF_5E-q^;K+?hEnUNSzJ=?tDmJ=3~?Sg(n% ztc!$u)buntAAnZ0ZEag=!2?WZT>4_%ZNQpXS8&FIAU1|uB*hioq=bO$XLtINyGi(z z)ac_G55YLD>f2%qx=UV)>Ml)_^gY~~#?n+}Q1V6(w%~5WpnRgcG{@QZITfzmz+FYD zJzxueYYM0M1n7UPHehgW_$V?#Iv8*{tHV;rnnZYxMcN3$b5>CN!%*uo?nuYdxrZg6 zNi(Y+k@}gEDBVR7k4mW~*px?^h3R9t@Prge^?JgaX?s_TDfhq)nzYfq3J}ZqFxpoiR_K!Sgym{l-=83v`JQ} z%=?;!#~@@=dvqwtPfCMLD(QUqRM{KpC+ox{+14$JOE8+goJxo(qQQs$dY;wb-pMyqiws;B-;i; zO9mYf=Hp%vIyR)WFG9HnXXVuA+JmG)Ccm692=z(eUz*?+?7^sy@i`unA{7soM%jCD z(<=4F4`HKwYd#QTC+84JrfqxBk3SkJjnls_-Ab`3%qn!r%Tg@EN5K}UF&)or?w~oT zlKF^v=N1^T=^TM_4z_3-N{5C^kD3?( zam4g>H27xPS8I-mkn~dB1K7$zBc%Zm-}9lH-&jZ45z$R)ZJlTbwHXDs;O2TPrh-ux zbt!DdrAe*<>l;Mb$eY0jtO>s~oAM4O(MnD^%XG*Wy zZ*dzfro=4tMq`Rukd0njo+TydF?bevvf-kQ8h~WJeGqS?LB9A|xL?-P#$~fXUCbl4 z1WKMGZFjcju62$oUC>bf1J7nq`7z ztVG^EInorTo9_wJW^Y+)7rc=pz2)q}yQg;VT`uJ}hQs5zlKEl^AR1BJIV?>-nTJ?iF9p{$sR+Cb z&VvpE5p^j4Eh*(c5Vfh@QWjHa_0U=2J@x;G=(Eh4V>QG*vrHQ6&*kOi7|i`Rf43Yi z+7Fg_0fXV>6$p0y5WlVPCvHr02*Zbk4u?oLz%$&A%jtTmaj2Hnya-XLUS3Rw&1Uct?HB926|j)2M_&@eij!q!QXO#!cB z*ZB-)*t#blg`2u`K73R;9~gF0Y=N{fLc0u*AIGN-2mchnc^IdqOnDbB(loMD~9G`%T#Z8)-UU zC3yqflF^R1ZDzh{@d$U!%n#^Mam+p7(1=YIi^q8HCihiOZ92O}ilB-Qr7$|NN$O~d zPcZT~RY^LgVU@SfX32aiI~X*l^p_-T7{AoQPJ1^?=8g2oYnBtlnI<`bb<@qan&P~v z52WV;zD~i!>;o)_Xpuw~4~LQ%*iC6$!OIwVs<&D!EaO8omJwrlwjpU8+*0$*_-Og_dx#YY`0Cl%oh( zL%zfv=mAqVA2e+kn^H!P-BPMEceXkX zAN@pq#`ubMBe*fqdOl&31U_u%^3VUe_zFHjuo|Ai*LwXUMtM7!vRgVH;uhKc_iBkkH^ zX<)#z0nS@5Vao-#nNCw^(*Em|F6`vx^*REGzNq0Vloom;?C(we=kaX}l>>P?b zgyxLn!=;o(Zy%E0G&Md1GOv&zS)cZO4u@`-i{~(=y+$(ou*Iw6%$5f9&td7g2z>#W z+ek$eY-G|ADcLkjEIT5N6!n>{N*L5DM-8PMO;NcKN2RHzM#QxOEh+!)rmd*rm=r?Y zk4ff_v+|B1KsNee*W>7i+5*H*+H)Lr`<{o&IK$x!w%nsNEtP!%b-Vdzm4&q61h9oX z8Aq`vp~bP&)pjqYJtu+H4lu@-&!^C#*7F#skg89iAWe*`ly(~ZOA{lD&Yi|`Yz43D z(K#y1Qc5e8&PJ5-XtGM3Yf^4A*v#-U=?!~nrb>8}?v$ahUNh8W7s~q*l4;l&@_Z$= zYB=PkZE#ph*wC<)EL%v1t%fZ*#4(0azmgueujC7p#Z>f_)LNKFm%qXca1bBdc2d_f zQk?J>jXoniX1~f8<0jG`20cYTpF!VD=S3&cfUl)!;TC0ojWuc`qCEGtP zGP*?9Z$P^e2Qo=L^avNn(td-*RUB*i4J6CuErTE_Qa{29idy?A*E{8{|4THbE;`9x4YCtS&&37nt{eE^}jg<^VbqTEx!;^b>`lN#-V?7Q9XIhsugL>!!bXakEPo09sZ(TJ3EEKBHx-(>ZjSfmNo2SSv=z&FYUHWyl9OnCeiY(Y*#^KZDW;Hs4 zqJsUD;cwbbmq*i;*&y67U3LgtsbV(DIx$`DgL0L!rXFoko4U`CCqrzM)+{tW9t^PJ zjNdimS#^V&Q}txIfzLHlz9ZOzygp}^+(@uFnp2x>*=s{rehyEeKNYQ#8~PS!%g@^A zuQ{r0-SFiEKB?|D2mhroc@M0T!)W*%xecAdl?=2AzXUg>E`n6Q%#j`RHKVLM7yrew zUmfvFxT;9)8$4H@E}+AlpC|t>SSa?LTqutds1GZt*CJWMnb2UbG`8gU>_QGSN9hH_&BXO!}CIYT(=TfSWG zV59RVRMmvhWkRu!okVi{JF=ZdcfhwTzfOsAQQec!1Ylv*d!^F;OtbXd-WHK`m>_q> zN;!lk?``3vMXTi~nm;uPn-|%yO;e+s^c(w?u!^a0jog^VvtNVPps0vxz~-)zBPnKI z3l}A?0_=%>E$UMy`<2Fi#jn)ZubLKxW91lPKl@etZTvdAuSElT@NKZa#(s@qu=}Rt zX7-~i*{}UA8q)78fqjbol2_r^c=oH!JHTFk2b@#hksFa?HGbVCS)?ATfjGoq*M~O@ zqks3eh@e}Hcp_rbgJykKE6wcj9rjOM?(L0%wa`Ci#5Ckp6- zJ2%N^VJM3>qus7j;bt^^DSI@e8Jp$s&<@NQl$!y}BUC5=U-lNcl|bh|Ky_X`h>F$R z3Pn|YAV(s|cyO!SjMmPNilEU9nzU7Jf>OtAmG2kA^INGBZ$Cj*A3|N1+o8BiAIg7F z?hfee<~F%5EdJkZ@=QpUw*wSW3!~r>w#z%HcM;65@kcPf35D{rb&pC$<%QrCZ$!C* z?ZI8>YM~s}Y?B4&9nqnE+xy#h>N2de(rI>*w+Ov&6g^QS$3ia?i{ud~?t+@a1M5gT zOqD*lsnB7?Zdk;&U9vrtxnYL_Zb*%G%dKs0CDFh)Xt&%k zn3cX)mTAWU_@3i?1{a{!c9&^k}gh zExgYF%~S(VVB}tU7@D$m=tPT)A$L`=+#x*0tE#o;d8SqoZMmcbRb{?1UD0Of{Y*Vs z%5U5Ko#@{ZH1++g+R6C!}ACs>OxxORE z<*{tY9CQM*KaJ4~ofW^k)7B4U2W>ea$I$~@@$2Uka!Z=QhO?$8;fD*mdzD`e>4TCM z^{Aq|*Fgumd+qe^2Ds&MYolt>#*=bunEt;fXXvveE$N1p_5L!rVqJi&Xv&6f2nRnErHEq&UeHe6r=6+i5C z!@pPJVarcekadTrO-y}hY})uS%rtn0u8(+QZOJ{TFEte11dq<(>=Xmw*2}kVhpH+yYyO5Z(Q)y?#U{j zy(}xrMNtjuLQk&)LDBV|-s$0yRoqpF@kvM*JcS@z5MIJ3dBw!7938^ZgE(5^1EQAg z6%Oz32gkW($zHraO!9_B-u5eMC(jc{PDV2-$?LFJaG0AC0gDXsV^Q%D)?&4ATdOPUkIKTg3*o4^<1vr96gC@k77D z(Kz^!p?mq++!l^LO4SVA#Si@rM{gp}3qbGm>zDuI=uwpXg0~$)rEEr(;>YCanyQ4m zsfeKq{g|Y2^ggNtnpVDm4!M}a@B+Lavc&mW^S2zGK#4$8PCsPn0;iz5kPMck)UTc9 za&!e1Fmx41YyIP>g02YzDP!n_c4`|q9jcbEE9elQh5kV2C-WxaZBQ46F9g*9I=(;j zkW8uSBd@>rrZ9rC2YAKaS$y?|X9=o-qM5wfdd+*hxf^i!dt6N#y_duDsS@nqYwry3 zwu^+X)d-YlKTg$+5(k1Riv|qz4#haKXP~zoNiRZAhe6>)xfLY52(hZ7)T;1`23_Uo zpr%&%9S+au5mFp4HoTU`E*0z|9e&wbb2JuM5I4rOF?XQ+1)SZAc5<`qaEj5#Dt+j95jZn8a>h@6q1*HgwXm zu~23CI7ADMao(em>CLTD--=XOW9P>>R4UgG-L#R4#+u%EXaN3dJcO>GW8=}9`7Kml z3A}36oVbFV6TmCQ58b%2$_vBR1l0AYuV8}rW-z9ad9Q+6n?1sGm4COJs?-U-l2^SG zY?vX&zYay^)8^NaIg9L*V60hmXOed##44B!v997aChy~jMuaI~Snk)aowCZX!WTaU z4FgU^Q@u+f9ex(osf9|0b7H4~8CXw4#q%kCI+`9!E7O%mn=&1^I4S{<&At9N-FsPJ z%AV<+M3XaNw=-i^Hdu4YM4vAQ3_*SY`<c zf@h%&hnrrS1@a`yn}xb*^Qk1Rtahzc>S8Kk=wi3Ek^6CU1ywV2lAn2Ha&!WDW&@q> zC(34y#wATa)5_VX-dB2-Y?dXdnYF-wI68%jSeDx?OLQAmMht3zIdlE8Bva8Gkh$IN1rbM_Im~ z$ul3n-Sbg_6hHa~@RH2erc)xL$(aw)x^q||WdIhL@0Vp1N9R%jL#Oze&Qgv}qB4dq z^g|!y=zJ1#P~cTo;4d78!HK~p=fHFI&+)ox6Moqrj8{dhqCAEz2h1~)!yJAMK7+&E zbS?+&@gCV1pwr^@!vcsB$KNYBcn=cVtBjKY@&;O6IgLZ}E}DqM`f zE!Pj%g(?}Y0yq?QZ82(6=!<{To7tOU${|JZSs)7O*jXU3_E3&07V|JftKu&cHQglw bjj7pya_>k%D4t((&WpbmzLIk-BYOQGDEKqH delta 67769 zcmZ^s30zdw_rSTsIxq;sdv8DmVH9y!C@nP?#wBq}D9a@m#$79gw3IUCm6hfOxg0H1 zrYyBAA(yA-!YfNHOK7(&9kbH31hdpK{h#;FeQ(~t@BjaN{=aYMp1a?3&)wc&)d%ZX z75;yD6tmy$bcAUCclUND8^&1HimA3cS@sH_?M{1s_Px3)e}x~V;yjXySGYq_cdw!I zTBYs2&@r)W@QcnAmb$%(b7fr03u(@foJHZUHEk4Om}0(whwY|jAC;P(m)mz1 zZHi@Ww~u~)QYbsI{m=^woGg2L|81)py8W4bZ!i5^`>ZtQ*wDkGZBdY8Hq8_eG#cOSEM=jWl)m|z+ z1=%mzvZMNt)LmKllI=KSKPbc3*%mSOmU8A5TX)7DfwT>_O14AsZ?L@-&17Znn>G;G zB1Jr4dmxg%2@ic}8-X_a;fJ=IaMnR-@QH1BjLY>f^-MPPjE2RrOqu(&Eiu$yJ5?|L zx2dr1ge^B}4T+_2<%I2fwp6M5&UPe}?NiqNXnV0K>#wwBp=lAU35d{%J-3>vqRaN%6&1RN0_a)Bc#NJu3+n+A~y6*wnZ7$AoTTc_7K>_&~5BB zV>CK;Tjf)U!JI({ULNALtA|0RA^*u>bIS!ic#n0 zExmb5cXD5yj@Bmy&Ym}w6&FK8!`asWwV`d;OUehep)bc{5o2v(Uq-TA=olR~m4UK8 zI;?Lv%TvzAg^hNyP^FhU?7t+oAF{iKO~$#txocQe7zrb7S^4;4M&!R-Ojqejb&l2SrcfnJS@w0lvudr^4x-o1-8rGok zhhcZ)2#@`2_zmbeq^>x4Swycp7niHNK9(CfB0}UkQb7kP*aNk0f4ZnXC zJ`%ex=j(7c`$C!ab$BmkJC_abd=vhFePOmEB(A;sxCk4*4R?jc$IetTz76l!0G-G5 zU&7C%vxgxsCZY>#sw|F)n8Z>qNSL|4jIl><&kmCJud!Bss4H+(n!@6zE~Pj#TLQFWf8O3P-wV3qCXZmetATv2y|L& zS4BjIvy+PNrHFwJR-pX;MnuC%wi+VeiSV$tO8<8vjxe?u63QcP$BBG*dBlB*Y`pT) z;fUUGwqJWGr@oFz31{WXf8R&^7{N}!$ukk#SeCNnr-&=#*jz=vJ91N7m!kr$bg}eb zxrUTKbaXleJ!VF(cD=tXIwWqFv{y&UyNH~{onBLZn;Cf`yjlM@HE~dSRL-I$>1!Bz z`^8c_JuIaOB5qfw4)9A+BqZ9m=(#W*Dc3jax%{?SS@}fdT@BcNrD|a$u5T~H=dVXj z$7*@ri0st_tGVD%|$gS#ttY4e~&B+Wv?jtwUI}|v2R*mjeN<*S}Gr2kNnWarYVbWL_QbFzSx-% z)hU*Js^r8*{SwPEln#xfMBI=meUhURL$T0NsZk$0Y<~+%%eGPb!g137oE6n|Roo9n z+V~GbzodD~<4XI(Q6DhYSh;*8>Uacu3;f5Ul0$LlrQm-Qh2y|J_*GO*IP)okzK?n~ zmOZF^elBX5jeP;FFGO`=U6ctIFg{BL`H!f_*hk9MKcenowqG-qel<}kjO|t?)<*SY zY_szE<)~K~o2cYmiQ0gU3eNo%^*I{{@BJOM)ONN747eIKi7kPOt5GvpTX0`P9D~wp zQSY#JkbOPsCQhH8|3v+3XXBK+!t9+K7`HIq?qW|V3*+tg;Zg@D6YXc%`^v#2`(7LC z4No+-r!WcDG`9bWj-)u*z6V`%*A)8~joD|LeG zWB-V;=Ky-!$Fl_Zx3@hV*Q&HW_N{SA1yx$dEl5A7na$FD=`}h#d6l#G*-wSDBIVEs ztsASdP+ss=X0o-64CL{UBSq>mj=%lvOIR)9tu-xKnw2hW%U= zo2QJOV?S!MoqZizKWR^9yP)5bSpS8}#3$|3!q{M?YQBAZbmQyGqV$DYTb+N<|GWK> z$5S-v8|9uC>`#TpWo_3cYM=C$y322-e7DrzG!(tced7pw`xAbm64#nf&yw37nb7-if#dsHYo(uX!+O*blwHrOACLKl2` z6N>ZUriMI7-i&Cbblq&9&ul-Z?2;yk@Wf7gC+uBapGs&5CwJNh z+h)E1c^JcXKat%D5A3q{w*9mSUfyMY*VbZ@u4Z1CpxC$Db}l4wlhS^-{YIqi%y6Y` zrG1-&F*te5{s?<*(|}LyVQ3@+tL>XYaSQS1m-a!U(LAzmi%z=-jn-Qn{Riu=Pyx)sC>4aKrbXU60+_5oa;6|;>A%BzpXG>NiZsf72Riuu!a>!6~{ zi;2#}eeC=1#B68m8|Crxm_J*y70R^lWBw7*RwvfPpl8|w3u(-yRA54OxKVy#DZlo&%uEf+vCwW?FwOx`vC!8iuvCdAn zDfiuqDRA1lBtfOqA>qF9`*_Ds>;N2eI$XG*eeHC#4bK|cB3y53+6N21e=Ie7!QZoD z(HusZp(u>C3Imke6CKZm+Wu{(yw}Llmf^1STw@0wJCp&*js~H)N{>i&9JAR{Q{bI+ zM^oFs$uO{~Bg6K6vMw_PRyTFDv3=2)#BK0PQ^!P`hl?pt(9F?+#X?y#$Cs=#JeKab z6L%|br#qUlK2V+RXcLg!%^fXRH_|1+Bh4{g2)xqVQO(*bGcp{z7)ynWmX0*rO&8>} zbezOpVDna(T``Pq<>(eUP|_M61*I(=0xnnjjBE|>wQ}6ubi1glat`-N&k4mNch2I6 z(_7{|b13rz9`8kH*4ptfdcTs^nEw?4-fivZX8S{cn$}p+qae0%xSiVsJ(mmb@kATo z?lz9`EC$|egNc4ifMabOx3eEsw{@gzRcnh$)+YofS*8qY>v*2A2sqUa)BGF{ti2-x z%hkmz@i3shLMsZCmSDQrkhi4b@LONc6(l+Z=D&Zbm~{7tFZ)b{w%i(WF}g|K09*on3|@og8Vb z8V+@IyucnO>3%5ago84gq;9aMlVg$Xi6}}q0w&zyc-8htB;dDCa!02x(7C=xH}3Tg_sF@pg50%Wl}H4QElbP?Bi(98o<~-j;84QpYG#;2=;-}XrSY73C|Et zuOllV^`B#!<6n|~O*5#av43(gL|^4%zf`<49h1Y^C^$ODv6H={%rA2Mn}p8)$rmxt zZOZx=9X;dNLHN;!lj}F1vh`KRBcbR)8ol9I9mX6`@up)mZf)Y;a$G>qIt^~T>-dK~ zr(E6c5JJ(V#wZS_wna(V=jduoouU*Mj@^G<9}ZRAQMyqdzW+snV=HbcG3}K zf=XaJNJo$fDuL}J9YH3j1h$KG1eu@`m_j;&Oi&4IH|Yp6K_##~q$9`#mB99rjvy0M z0(*~i1eu@`*gnz`WP(ay`$FqL!!nV=Hb z`=let1eL%(ARR#_s04P1bOf2864-~NBgh1mz&;`!K_;jKc9?VonV=Hb5z-N4f=XaV zNk@1;jvy0M0{ez^ z1eu@`*teu3$OM(ZPLPfu6I25Gj&uZ>pc2^kq$9`#mB3Dtjvy0M0{ek<1eu@`*pH+m z$OM(ZPLYlv6I22_O*(>1PzlUWI)Y443G58%2r@w>u%AdrkO?Y*oh2PXCa47VGwBF2 zK_#$XNJo$fDuMku=AuN$OM(Zej^=0Ca451eu@`*d@{tWP(ayHKZfR1eL&QNk@ zuq&h^$OM(Z{vsVgCa47VH|Yp6K_#%Oq$9`#mB6l%jvy0M0=rH+f=o~e>>tt*WP(ay z|B{X%6I24bK{|p=Pzmfm(h+2WN?uu#$wWP(ayVWcC-1eL(TNk@uvpR&WP(ay4M<0j2`Yibk&Yk} zR04}99YH3j1m+|iK_;jKmOwg!Oi&3-ARR#_s01dGjvy0M0+UEbkO?Y*xkyKl2`Ygl zl8zt~R02yP9YH3j1lEvr1eu@`SR>LAWP(ayjY&t42`Yglla3%0R02yO9YH3j1lELf z1eu@`SSslVGC?Jw;&zC zNAMHeElEf45&Q&qE7B2s1V6#unsfvo!B23vAsxX-@Dto^Nk{Mz`~-J9(h+J8eu7|Q7ltM!`s3f_2>VY!BPw-^xfj$EBP&$H2aQC8g1V6#k zo6>102G&Q1R|EQLlH7fDNhbISp1U!y9DEvZrRj&*2wn}CPD2^Ea}ZS^BW$M~a3)7@ znWw)V$EV>4umQT{C8z}VKs`{_fL9tCPJ(BU9_S;m!Mfxns2Y}m`yM?|Cin@SA(W25 zaw#1_CAjk_U7kKJo_i?)f!#+5G!%nMl6xphO+Y62HM9fI{d!Cvfjyv0UV=(+57Pr> zf}h|SPU#421f?UW1oucvNAMFo4^lb;8%5~|s)l@UkEV14KfyDG(h=BLlsbY}LprD$ z&@}UP$Qqh}pCpeLrPkonkPU1cA`QG6aKs7j@wy}v`~=SgJmC`*fTS9$OJ#ZQ=kX>2&_<-yabitew5M?`~=TTN=IO`C>=p1 zxF4f*8d`&2!$9ynuEVDR>p2_I3%nX|Bna*~x+D|)1W%D3=+kf~uqP1l;MFh=R1Mg^ zCw0ggrhuO$&s;swM_^Csl2=0}s3f`P>47rAPw>pgz#Q;tz=r7Fb&+#Q#yj5;8{rN2y79h)9^5;B)MOp zbOb-avzXEm*b+)dP&Et$_fkryVLJFp@+{K>eFU~#m%Id(;4ZA zkhy&q_*1V5=w{K_$3XQ#yj5-~mcUU~4EHK_$4?QaXZP!_(k-Nrz9v zKwvNH@Dfyldz~IA6Z{(1f#($+J_1{hQZjfo3?>7Q#yiL-ryGYq*|c|y5FVb z1V6#EostvS4oXf?3GSVgj^HPFc2PP4Qz#ulCAfD}I)b0z*+c0FY%irFs08U9f5s7=?E&peTdQ#`~=U3 zl#akYqI3k6;66<02!4X+2&E&iqnf06kJ3)l^9d;l?3gZj2`a(;sU9d3`~=Tul#alT zQ#yjGLvdH3iJ*i$iKPXl)41r3Vt0u7%0yB^B^&><7pC6WlNh9m;3 zC5gZ;lSE*Dl0;xvNFuPmNFuPmNg}YTDB;Fc1Fp!|NJn7TNg}X+NFuO*Ng}WtBoWwu zBoWw6k~A~{c1x2KS%W6BIK6lcSiDV#OkklXrGTsfbzvkCSU5=p7C{n$MUq5dQ6v$V zog@N_CP@R95JM7yIY=U~SduiP0c(K3PSfB97KgysMGb9%#gn9=J1{2#+dyCmq|?v| zm_U*cw*iy8MI9=^E9nw*>F^OeiMr$`$Vs~7Zm2^gcpIUV0j#ke=p%TNQ9`rV&=TYn z9quN2psE4a)Ko+Yurxi;r=bKqZp3ErBW!1JFWxk6J(~mWW*C|es)i@Pn~uP~YmR7w zmmG-R;K|V8*MJ?+fU2=CrU^)$$uDdR=9=hZsczWuAehpY&wytw~bf_Adg1470 zvEB&mPYqblK05paxvws{@7AH}P`v%($noS*ivE;>AP=Av11SZ;J4lz!aUZt&cL zXa#-^Si>PY+_^eb4Q}w}=@PqFmwW`zeR`muAP?0g_x%XmWoW>359onx7@{rsG^B!O zxDG!-9)S{0g^`FmK-GXf`Je`cjiLs6M#mk*P&P(~N|49uk|&>ZUeamk3i3DvmNcGp z6A)RTYUmI0L_N?m34um6Sr1e-xIvzRKwF-QKtr9TL)C!k9zwJS&%+3;%Oj-IfMz>g zhi3+2A+Q2nQZ=Ay79!HY^Qa!kW+J+RssYo@(&2dw(G=L@x}*~1*`%AJgB6iZLpsP$ zAYK5^lZdUr=EfbgU5SGC=f)kt+Zg#N41Eqf^AP)h%}0C-ss<6{V#E&c$cQh2J&h;_ zRl{>2KZB?O&jQ3TV9)AM5w?ry2%f{dkAdfT46OvV5U~VQ4cNj(h!pU=fI!!{7||S5 z4Xr?4f@lVwrHB^5mLYOM)qt&EuESHJgO%z~3G$1iTS2;&h#XKgj0AZV=~g2q00Ui8 zHQWyJ8bmMftknbAONdlZHDGx!BXD!Qj&!f+PzmySUGi)oT^Z>JvX6AHlI}Iq5#)_1 zwF1xU2wWuIK%{`G0qePmbej=qFehqF=%Ms``D-d^p{H`u}x9jli(Ba;xgYDAcC#VWa{lK?d50v*H`ha&Yq9=IX zL*N&+`w$*r`w;`cui-XO4E zs1d!{9~zq}?n@+lYT{CD*jDdlP42A7e`+jNd{;CUDC%DtXDR-_H8xe)HH`}u_jQff z8~^CuQIY@E*hNuq5ZO(l=a$Z$ay+RSk%baHVMIBc>m#^6itFuMAI*KjTf$Ig0$%-rzRf)(FiJl~leHFQ(My!4#jbjv+%=IZmxk>z3hM#!*Q#E3<-5Q%H zzNQ-QRakobeC^wIxjB)w(D=9_w?x`%?24^*{5*!=H_L4_#XyC%Bg*Z$oT;&iB4=sD zak^dO0!8kqu|#2aXna7C@8tR}@f);wzOL~HHF~=d-90o8RQx?j_Ict@X?nRg(c72k z=|^<;*SJz)1LJS$@?M)zWk`HF9u#@&kh#rU!KTS-M;8-GgEdtZr9#Si=x*%v=Hj15x!uWQ77 z-i$vOh8@nf#ixd&p}Tj)$G(smZMS=8&T8Mc@GUBQ<>Kz;n6Mj^1Ji&Uze6c-aiQftZ(PCgLE$8Npw}E=MuF0 z&DwJblcP!+(+^F7?P!t&bIvDZN0w0#WUfzf!B^)Kdc*MZ3HT-NjwWHy<+p^M_Oby+ z*79!&GvW^Q<6=*pP@I{O42>@&^tI>oB~2Mjy^t`>lJ4k*gvl1M%f%pZ3yN`OAv{-q zW`+Q_{hn}7d>u^)_;xiB;I-cq23xYc{(Hh?XWf|jQ20l}hI+vT;J%cw+>&_DrJ(w> zs!5pP>@$S7au6qMsYy_h>IR>Fl+>_ccM}Pg)+Rh->4n0}35k$-Iia(Cf!Q+{HpC)U z|Cx{k{>uq>TEg6a21U_xDfu%f7fd$Hk|OI$P>MytqCZ&d@)xEx2NBl(g^dr0_P-Nm zSVS2`=f*mH5d!Qg_G{hX68w2e!UlU8jbKO_jJSr~eAaAw?KR9g$rPtv$ATA{wxyfx zr?+Lq!u9Lenh93LeEU9Lg=28ypM=@b!v|BhpBoG#|4o=4U3m}5S5Ur9Y6KVmO_=LE zJCp(!hZn8#jdya57~H`L}0CaQ451hfU2WDqGVe!s9m+-gFvS zEa^`nC#qLOzJr+i3{-en}VRsjS|kX=;Bd4?I@TQEj(wh97ysYxE?Lc zwunVB!fa>q6QteDxkF(Np#!swHkK&Bpjct3^X$_Ux8rK!Pz8(ql{t$?lU&7Xy%4s< z35tD?(Z}GA7ZRa3UKnmMR}7nMuQW|8&nXPEh!sv@to=*gJ0dhp5Ukd!CSclbd<1qw zmLM#*uQ9s_#WXlC2s0AT@}_U)HW>ASUQx*Fl+kGQu_lpFA`0d98)hZ?OTv6-vEfGe z;Ag`L32h<7j8)_kX4u#90q+L2E@6`;4__kIt-x%$GYKOHN~lc|8o@(%;M6Hk5<1({ z%}h}-*`8^N-i9dV4yS(2hw6sHul8^GY;6f@BQ&{OJ~?tHQLIdm8w;oG$8tz4hpEXy zMf;O6%Ro)?QiQPyW<7b<*RCt?rwD&D=RR%@WpgOEW6IG~VH0!q;o-SFyj+pp!gA(( zn0LoTZvVL4HWS7&=SD6Y;cJxAbRm&Bqj)E0@)5cQ7@h>x&4o+OQBP8t-MG1RR;n|E zOE@`3PFMN|=dR*Q~HE+VJ9fbAHq#}yG^+n<` z1MactcAS6Lc*}RgbxoXQnr%@>94@1*B~Yu0hW9Fm>P~_S=64eMTP6vH4Y7!=?huAK zON`;?l^vy&-hrMiv0I(+xz&25A-+pSlJe`Ff|J!tdJ!;b6QxBLRMt!H_}r3ya#t-% z*nQLwD>;w+VMa+--nvWpk2$~Pb9NA)kk14{_w#*@2>^fjB5S9=R%aFBV&7#_J2oPC82(L1<7 zUnzpUebH+M#-$=glwi!=!Z^Fpw@bj2gQIckZefIF%6j_Ya0X_us)<1r$Vr{T4G zVdNlTo-_La>XkCi95_EnIBc<{(#1kU_-Bw14JQW+qbzplxkuP$5wG8ag$1ls9)j&C z=F@5ruw3DJ`xI{BOQ19t)0#U!Q1h^iae2Z6!C~{AyZI2U5}ZYF8mXXL~6p~6AuthvW@k+={A8dy70m=SNxXv6NndkMFn&ps$T=rorUUiXbq z`=D^ieuGcdVsPFmHG#;{g4bEaU0Ee}W#vlIXf$(6l{~wJ6xcOJc+=e5r1N}cLE%_j zjzx1Evhs0Q0*z7gvDN{5S0|vg6?lbw`#E!Ccfu>oPWaMrRlK_A7QuI3T+Zf>6BgJ@ z_*m_R+BC@pRYe(L&}_UgI_?V3q=cqEUOQ(b!KU#-k$r*TlAzTDtU+LZi8YvEsb80g z!tBJl<9v=U<@>v5Gy?xbv_dlmc<;kn&6_Snz@ka02(;8W8TVdMe5{Sl?>goDWT78( znnxnuykfjq6_z{a@LC$CaRmxzUwRTpV58+aoxUr5+MJ>^7 z4!k|IIs34%)S1j3rLpS`0r?R$(rdw!JS0=en~s}9=MH0cz$Nn<+56v3w4K zEwiwL>Y7E4(*H4GzRiBoXg^fXMz3Hvi4e$}gTuQrmuBD~{23nZ?KT^2gTf-5zGWjx zTg<2LX2t%50M=b8MiXG)lfn{bOP-VAH40$FT;Y_{ICmH=>j?dy5)RsH%z~WruvQC< z1qn*$;U+JPuS=UDYku$?nUC6lA$g0j2@8xqf;<^3bFmm5WgrTM&4{~UM4@g3f3`OE zvhbAsG;d)DOnn;LpUF4vxEehp9Jln{`Df6A4O1U~EEp^h~fX#Jo@QwO}at7vjz}kay`K>=4r@f%63v4X=gH`vt8%M(^?V zs2;pfXtP)tZJx7?1ZkkYkDao0v2fPfDTlPMCBnu8!yJtGHE+O6ON8bypjSqW^5Rm# z#hmecFpSMYCU}<$>Bv1fGS|Cg$+sB`4laU?;5ZDOfq>+GYHuF+0cfnGkkR@f9*r*4qh8=czPm+%N=b`yS*goa?)cp5BvS=eAMlu_IT z#Y2~M+7io~SO&H0a119Hb^wL1U>;XY@%k$QILpTH){Z4ERDA1kv30gJR&hQGxv*yg zT90w7G6+h`f}D0MABv{Q;WtcJRKTV8e-%wFAYMn&to;r?2WKf2uW5eHFbSi-H$(MC z+=dtM{?6s6%(Jg3dtcY=q@&Rw-t2hrzkz<~G#5`A+fjVszzst#pJ@er!-U_1ZWa#4 zS8*@0gCAt@%$n+gySE4*J3I1C(lM^WE5J9k9x}U`7le0kZ=vrp$JPw4eoOc@sjex^ zJ_L3=-s1p3|2$vEH3@6IR=yZW{ zW}EN;OEA4FSJV{1fC}Mj`%q*4Le@Mn5whPE);J&LcQ2cH>B-9ZckxJBr*^73$-C(aX9)CH@HAI;%cjIov7@gf<--Cl?7&gD!37GNQ2iR7aQ;?>z4nLA4NvJt zsUiIEn&5yR-xr>?Ojx|x5aFp0gx;1FG4BxWlh1r0ObT|S8|;Q*4h7$b7$xCDJhude zS=UuPm;EWJQ84WzVVHfkA&TGfl!5OPEZUq^;2wbYF5Qj^58F?hTZxJ> zXtw!33t@2Vn6Sfsn%|@4!=g{oqnJkx?ru9Pp3j6tn`P1WR^g_{T%@@Lqo1rogBoR) z;;RnY{9~dd=+QqT66Sm^lq8iHOE>o`0w~aurc$BA)e3BVy%cI@O~*Q zkMGPqtFbfD(}C+N;R)xrd@c^8@#luJH02smT!cs=H72 zkB?Qj-8@=@vj&p|qSSVAiSS{Ku-Kl@59_#duSHAxmiPNQuwTYaxVasG zwU>ka!=FJLRG%gWe2e=EMh+Y+wrHZ+pOEzzx~U*B5i0+}3+h0xxc?UB#~Fvabbflx z%g2X>AstigaQtsP!Up_a-c=mczy|01Rh*{gS%X_~0Tf;nHYL^#KKC4rs-E|#dot`W z6 zo^<(5VXA$fX@Tq(4oqO&Sj z%hox|CW6y=83|nHov?{`IbO%dE`YV6;w{Vm)E6c`Z>e`yxM+R$^o5IH(Rw0KyP2Ei zW~hh|ty3y1QcKH+1y`|1ahQF$u}K0JCC+df3)o!lVLO5xB_6i4CC`pc3v|i}yEwyQ zO?lBl1y)A~73hfx67jy$S{=6ovkKG>vl8J_E{@!GhltOzX0>%iO00OFC9Eh`oa_wa zbvB0o5Y)zsx9aVFGZhvmqUSND>q=-9k1em{E_=>X>7WNfd`#YPU8KJKAtKC&8YCqA^#>p(t29pM*mg za2KV?xVxR(P<+_zFTC+@C@Rjjd`&hk(Kjo58i{y2RcY+p`GDa?L9%8Prk!Dq%PpC; zN(nLsvWr$-fqQ3S1G()_v?s0te(dI7b+d_QE5_wMxajbJF-+eCN zoB*v_ii&-s>G{sL#93{$0RPNmD{N5NWHP-PPMl7y#7oX2{QY49=SrovwTR~w!@rjS zYb*A%^kQDyprKJUF))rG94X1mlxx=%t5xb zwu4yz&LZu8e2kxviP;6L{Ai}Q!I{SAXgoi^_kp4;@f%A^M%)(U*8R8P1U06W;dF*V z(e2`KOHK1Siu0YhJj?vC)Tg__-%%T4b5c}yvJ5~ujJN~qlg(XEm2nXO_B+L^&MSP6 ze2s68Gr`$e++>a(es|hgoL|>8@RMQOiB0SxKA3cxPt0!I7;4_8I>E_2{0n`5brCOE zYJa|~ILy4D7|u76Qy}jyoKS($=-*A8U2iv50M*@afve&B>k`f+rL?=|C(P8mI@xf( z2QHJjhFjr>^AafSDQ+{*_;Y!Wom&R?W{dBbxfpZ39Go5;mCZcUGQMH^61I5Ib`6(r zAfbkey42Av04Hi$@aDcen zS@)(T6ZQ1PGI}S(B7zh001mjUOwrr>!k2|=Nd`+q09Ijj+FK%Max!my>7n}G!&qTBoX91s_ zm1C)+3gGA@oGFIE88f9LR7@5RT54PP6SkmaidbTrvb7~FVEaBw`@iui~)${c;;pn#vtJc4u3 zbW+?qR6)b(;)cX{eq)gHBz3{HOEi!r4`ztUPt(OtHp_f+7owjwrx(xYingx1;9#NX zGqBZ#mB8CleJGsQt}=X@ovL7QW!4t z2oye!MsDWGtC0g!XN$|t3AKbztV0{9J(;7hJvq`@ z*i#&2ofR?`)<+g6SlnMl4PMlCFBYTVQ#oj7=y@8A)wsgg0ToXN9qhV1gOk^6CX_xC z+-D24S{l0-UduJ$TY%@S0`8d%kBOIj3&f`I@$}Rf`0-isrKAx4HelT9t^0^N7ytf4 zYC~nqbK>*$$2bQ(3vpcv+|l?KVub>tcM*0(XYMb{;RK5Hda)&pcmbVm-OeqC>o15( zoUvsHp|^}=FmZ50$P$3$i)LPZJA!XYK%h~Tgp!6Lqel%nSil;tbMO@P_w(Eml8M25|W z@UuwGbecrvV{ugqTOmGNZ&oY>d4;&C-jEhRmz6jT+VY*q4!-`EfO8erJ)2uJe)P2p zM`JTD4L=uOjkaW7Ydi%7#dYC2fWrwfs!ZCYO>df z4)}DP*xS-<_d0D6dPU3+4r>BUo0^F5O6boAI3U8 zpYjUf-@}F|BVHB9vgmc(i(i}zBVR@55IYa=w9dXJ-mss2f>LaS^BeInlFjehR>INO zF?-V^fbWfx^F>Z56-4 zj|KTGFM}=H@ZKmO>c`QPa9Ba0qxSg7(bLcmIcTtAw@h;>}Z_99$;x zCSp6TkTv`?6*iCh20x71E*@s)qjL`I*%`EI745pjFhbT-uP$Fr507f+n21vi4Y zg}8a#eL!4j?vU0&|AUx~QL}Y?VyD5;gLoNfSPXtfR*A>dx>d>sRmJNsw~D^Dt`7gC zjVf+P*kO1IUXhwYc=Ua7nR68PGsc}#j^g}4RO+7TN5tpM zzA;i}YbiH4C-9R}Cij$ID*mG)KKvMOG5LJoovvUdaC212m&bBAs)-AEhnGW_Z&B>S zEvOu}e2eon$uKnh;UZdY;ER%q6S!ctf8(LzEVkBo)izEpY z8`DI2>Rf1e0XrwqSEU!Q;bttrzM5R`!;fMpx`?x&csSKBn_s_$DOta33#9Q&8KWvw zVCo;}T+Pc=UNqi&U&52584QINaW<%zux&?-#eqjH2Tu)-cUs^&wnm&09nTNFH-^Hv zT5(yzaKjvUs+vc^b{RcU4!`}Z;S}-t5&N^;oC$eAF23t5<{Pmz{>{rFrQ#oP2#YtSu`%~R z-GX;I88^fy63qhwFY8lnlck%4h&H{}UgnXG-5f?SHuA z3iQv>n>clkaGzm3YvV^+xA3CT97;Y`D_41?;}$dQ!le4=r*t^Vq^p)1<=OEAU4vi=OIHe5=CvM|Z|YK$4-#NhSA4@<)F zCvGdkrTc@!>Yt);_C`p{>y08_yhdWMF?vRQ%Ag`r0!yBGQPOOSSgnbHKE)Q#uD4C8 z(n^%z_%?hL`pYgoV@WPYOV%w?ZFEqZ{4v<<;uvgpV8&yZwLq^!LRT8-1qWteZd#z$ zfnPs89V<<$*UvlPdaPvKJnG}}X#?p&OKw?lmeyo)cd|y=gTZ*h<@2+I`_ew(aZ0D0 zVXMjOguF+bqhuvWsiF2X9=#YwND{8>d_K+syGv4>nS5%*^D|03RJ$bf0j5XMtM^Kx zG`?O+aT45|j^_1NlC;Wc{6;H>Z(Hza*HBt+-)gubINwm3;q1tF)W!r{ zpiFHfCF0NR_=eZ`E;biR8%qbB+57{XGR^|Un=HjK`#wIGN}wo3g1Ah+!g5oB;u#rD zpnDS>f74aK(I(RDc#&Vygz$H7koV#IpOh*+YMF8VR2=t8a|!jP1&@1Lkm2Aj0~*2l z{b+A5xTSl{pU|ztzu%(`x^eFTzNXTQxJtf06!VJ%Z-Mrf+f3SGiHM~q0ZW&LS@QCx zONZ;dmac;?%_V#^F)GR}^B7!jj#T1r=(ISVK(s+^dtWVMnG+AJRdUT=f86!<2vqOG(ksb(z2F5%36 zjAU>hN=;W*wv!zALxtcG#P5BlajXQ9m4a<0zF0*ZWCOuN(V-F9(Y;V&Ugp{e#+yAFNu< z+czMn5)B99L<)@MqJcqL{J>;Jz1QV5?O_Q9NhAK3rV%t89Ar<0gM*5%9jr}w?xAoe zGFWO3>+g|9TEf^6EY#?4k(L#}*Q``nKSUZ=Z^w|UJ(yWP$n)g}?Gv1N|HG%G&B4pj zjd{`_^8vPouX=b>bZ=1qRoolYB`79C-}{2RiXOHT!%Q1E#;@)sD9)i$3+t<|=l-A( z-gCdTKNQac5`;$<^S`K3S%kH`@}M*q{~%W3C<(s{X+(d0VLnjR+*w-*O~?8>r0wLd<0D@fhW_wUQFNGajua-%RG5 zphYo7tf>gEOu$_7&0N?-jFN3e(W|?3B5s8$%`mL42(gneEZa<`*LkTHmS)DoI!n-C zvV=doHN*6ZFP)6>;?1sO~LBc1UI4QN&Hk3rbxcX5>kNsz2=Q!yngYlB!B~9_!3aP6lg>xllU^;Cr zza(h)8(!aUT`3K+#ABp)ZjbD!gbo3X=deL z7u0omuLN}+Y8%7+1$cG&{VP&mOOY6_A@o|0JJ~>1I9m7*Y}Vp+=Dzh(A4})x?YLEo z*4TQ3)WedZa6{d8B&~iH3yUfXs-w3o$gHZ%g1S$y;{;z&59`(Y+!xd%S+CYB44!xv zZxWBa8e~lF*DzjSWcA8-_zO4gyI;dv1r{;qM(rqObR=JE;$iJZ?HFJLgFd)>UYBAa z_jM`9(u2O&gIb}-8~q&4f$TSe;+4KpKiM3u=*;V;mMm%iaq-|n@ zYmjygXHEOfLFR=i>P^p-=QE-qWeesUFt5Tb*!_Y0{F)djH}B0Li@~vK3}3#9JsOCD z1BS-(R?ukp-U`aaxfSaYm|gBoE(z9eMV}VPg}ohAUA>^_ckug^^=}6?t2Q`Z?Ezd# z_uW9NT>4H>v;6M_H7jo$W*=y@KJ5N&c)SYK%2SR}0u}Oqh~LHjun_0%sd6dL+C$r= zX3+k6%5AW$0;^_8QGs_Tf&3~S)>`?l^nxXd`w^G0YFb)fShQW+;FzQ6-;POxa&qIp zk}UOrb33HYmORlfiO|HBHUzSFNMTU2Q_42KlQ%X*P+?0O30-#u%|&@v{r2x)jFT}* z!P}02*%v8zJU8pb&Atk*W3Z*Vg}dwL)?o?W2-^1qHOspvD4srVi^J2R;GaFx-Io0H zN&ekl9PR0QgGO838&s|y@8kER7#RDW)Zfx!74OxLmmG-&4cZsvIehzqtirh;lLfk6 zuivZtgDjaHs2imb9E?h{!@2`OegzHDnw7UwY6^=F22EA}LEOa#Y!IX1o;qLxl|dQk z7TRW6h6A2b(Xaz%Rjmfa>;HamE}C)nnAD^L6dXbWN&Nu3DNtnL2SFB!7B51(L(*bP zAE<|L;~FTf@WY^qjFSTQf5tfr@;;Kr#+m)ckIeq%+IJ8iNq1QyI*(|_s>4AuzVtBG zJdhVgu{s`E69d}XV6FFPkhWSA&3b_6;~;It$I^`Yv&55-mI8x6!Id{qiax#eYhi)R z8XgPE45Q%3{KxQ|9*A;Xi((l`Z472yYT6vW{snIej(jS$v_$q-NN&>h{7mxHO?KeV zlnD@j9M_0I_TJ+`SHb8jnkl2Iq$S~jkyUEHlD37{&8*m+_8QDMX*B^wJ*nNC1uC2O zi_{*5Y{+N|t$vjH1#$%68L2HPuARY+*{L6;th&i+He}omPn^Q39569GnXYJg8e37P zptOEXJX%4CaO*VYS0|aS)k{0zmu{<@Hv4MRHd;KeBQkyv{yTm>s{A4C363Jd(o53ImUvk; z+9@~S!fNo^FYpMtwia(7%}ja4)+t>sOZayJ%ttXO{8PGRDW~WPK4}DL8$s*a(xTy& zzoZZBCykd+a9_oVIQMU9o!$Jy2wK=SXW2x$_NnBrKBD5ks@s*hFq_}LmvfdV75_^3keEJ~O6|@z!L}dPa}9_6Ry=C-;(A96sz)Fcw=L} zD!ZA>`t`vU<~kUN3xzh<^8fMif-^KImN(3m3fDqi)^DURtbWRTVBxOgmcI#=Wp^dR zU*WFB_H+EoxePo}E;qax;hJu_3Uo)hz|wLx(ly)O*?dgE6u(;R2{T^x^!5;siz za;*W@&3L%Re@rbI_iukRa6Rfg!oPtZ%0FNzR|?}?%keLF@u%jt{5=6*aGkDG36=b7 zBjft1<}t7(xPG*E=FxV;`2^Q3XZ94bm>b+eaF->xt|rt>3JyMvsU_D(_9Xt{2Yx$; zF0kI;`oTA7murLN>C~O*8f(wxFD8SOMTst)b(R^QgyvGlt56L68@jeRzcm(i-X-`+ zS|hX%^CJkQx{+%bv(Eoy*JOLL@y4L_*!*Cz5%f-RJrc+PJWa6wze#aq+Y$`Ea=smEu%aF|*h33*0ot?$#QXZd4sSO|jj9cDkFn@Kfcct`Wgu zGwdZi2mEZTnd_A0!B0-tdWLsF8Q7a^qES02ZSJx<-P#OS5^NiS`@z;3F6(hw&cLn- zIA@G!-6D8f)X(Lit$3I4PYaiIV~nLWg28#{{T^xQvYy)1mY6}no#UoZgu$&aie<5B z<+2`cSZnN;fOcx@AT4fd8p7~4E+_oi+SS(*53fF~yEL^8wj+>BR$I(8Pz}_Iu>5U2 zz8-Ar^3>ZImc5M+a_!o=?sDdH-yAicjQvZcsGX}P{#6R`w7qMH^|xZ~ zOxN=kzgCfn)eHPMIV;OG+ZoR@3E`Q9DSNWCOcruOT>{SAajLZCo&x_O+U@A#3iz^c zNf4O1qx>f$ z_r|@>-8$|=U_E+`6{#$ zw)DrW1AlZiZvggX74P|YU<0*+O?R_pAogWo2hwm5)?=kiCKRS@8KgOT%0qEQY%a)wca5@y6%KdJaPHtw`T6`a z2mBqyaMxjHIiGwYAAvGBIs&KHNp40)>~dH;64$@oJlOc&wh~4>h{0xs`2;G5hNEz& z5vX|eD6|1{KLMo^upPrkyEZ$`KIJKKgD?hD2F%4d3ZtGL<0?z2Tcw)E;l;78UG=iS z&pGlji@^6OPOocny;xPS$cwRzOb6k=+NsrPoNKeCaL;J1zsF-t-RSW!Vj{YsFm6G{gvY-v+lv7-@;q(-&?~JJ~Fa9f})l)H`YAUXd zx)Qjks_)MmKp9k+ahdl}(HY+$S}vfbW~PwkQdUrwyF#hC3#qvaR!p!HpJI=oU5D7G&S0s z4$B|H!}TI+`a0yP&P^AM^*SPs;pxfaQMHsoYE0=#<>Or&!>jWayY&(+o8a1Q-=o(p zc_KQB_Pi4d;?EFY`9#+bHfISRnuhTRwTmuKMx;EcduZZ(^x&taxW=1CR6VAmlTXn} z3Z^nmbJ?*IaT?sO58r$g^tCEwdtcEs*St_u$Vtw^Y{h5+&zq>?5PjrW`X&Oht~N@a z1+PySqVme5d$U|VlRoy&hPDjvi=TrQXv3{&6D2M|4L+IU`nYDHCNgh^8#y#}E@lwA zKa(&IRWXj;q|Zgx59hg-+e@^`0p-kdMNz-`u9fyOeVTG_J_OM2GR>#-1<-(w)m^1> zfhBw|cneML&}(d8h)n+e6-NseVp?Sgn7Rm5y|`g$yQLgdz6c%GEj|-kRRe(|Sr zGb-H6v;zxXgyT*n0;--pisSmAiZ8zCO`3l#hn)>CfT)kzJXyn_j4W{;vS_vi0o~Bwu z{&Mx%-M4zBi){AldYAX;YBo{jW51ItRI*FH%d1^ggG~|T<~q!tGWpCcll#MP%6W&4 z7r=ip*jOrjs(cg;0LHoR$RK=gsjyjGsG5mWWh4_)Sk&(seg zqY=eQS<;A)i5o1~0+uweD8rl=>;t9*H8!C%gZ+q2ATf-*bQ2gD>m7-kVX>BEV|uXJ zm1TvwX??D{D&=p%VugN?lcKhw*VENPrCTvpGbGL1>yn{sWP5*`YmSL7{v$TH_6ry2 zQ$B(uMkfNQdNg6XYlw;Elx<)cvcomOM3=P#(aSiz8DD^9kcaYJZU8AX?5<6}?RHI& zvUTTIQN?o&5^3WqA1=A{C&5<3ZBX>#J+AXkFCW%vODVWVSi$XetuVQC>Zhzn(%q-> zQ;Ua<*a!16`j*T4Fhxw_eM`ctsyM@asry}`d1)i-0CE{NT6w?{3i}>J5k`rnENS?3 zk3%4i)69tq4q32G3z5`9FV4!dWSZWcMirrr49@ckMf!81yienqz ze+E(IX+#X8$J%@b`Znf%o)TEWe!i2sKIN3a&?e~P08c48rZm39mdOWbIAB$ZsH0T| zXM4|rr8ey^p`x?sBG2n{uhesh>qfGiCG)kq;8sOMpd>z@#v;IZm-(hI;R4D}8mhKq zHh&gV)&-0qv_W_-^}UEX7{jIGNb0B8wGMBBFY%Hq5(5Cv1dAV+QB@;(lO+vznDUjy zJ8phu!FsM>AiwBq*CNw21+eE$4W4`z%W_MvxDrKO_gWAcsnmzo7hwVL-z!+s(kXBq zBbXRT;TpzfpIvpeH4Rn)Gp~B3BIyj`y?hzBjS@P34YpxS!*aesbu?Y9Afe3Ci+FxO zF=xxLyk~S_IX@u0CX~C(n{8H?qdD}Bi&v+RqP|6w8s-px9qzjQTX>}rFr436yj&r9 z_d5%T@O>c3gCcZgZ+~xD7zABy`uBVEw|+%}xCTx8pJj1RA-?)QFt8AtV;Mxlr0hCo z+y)60Vj1uJ0MU#Isr`l}nPpAhyJ6|&vTnjx3@2^+Bb>u1==hH?e}i-CPvEQ%v~mBV z#p*`ff>Z|a!jQt>9PqGZQDI#As?;RUGL|7_5q` z;qdjdsv>TajT~&$FVlwVe$)m zgt%06bBox9M0bpuH%E>xY1U+8uV%{aj|ng zH_Kvv(M7&bs4eyu#M=CIW0N^*JKUIW&0dw9X;$YJ^oKht;o$*O0SauYhI*tuU5m914D?*}y*W3|AQDU-5 zv5GI)>x$1i-EXRr_xe1IRmV)*&D)j}(_`%bvUv4V35*XI@fO!M_< zBt9=Vn`Eklt3Fqs+kBg4@eblR=NH7|e|z8N7!gP5^-T#}dIY$}aDoYZcsQDmcnc{f zRx}R)Q-_HzdcKL6Zt9(mHxVc4_YY{-A|akN73Vp$E5iQatFhGYhPyt6JS2{`2lZD) zO`<6eL2>%2QF1mD>(J6KFbQb=usG0U7C^XY$HQV@EAb>#GN&12@$wbHeEvM|i)t=n zUqc$Vc{hKCP<#snCGDOgZB_vPX~}BYQp|F$;vIm7OJTUB&VTqa)_lHHw}P_b#0Sm~ z{HVWY;5xJ+UOZvfOQHCd2zfJaxvS8+R^o(!Ol^Fg)*|A+o`IKzFWt0(m*`-8dkjWy z9I;l__A}nEu6ji5Q&SUBle}yU+1iTR1K4I$QCo3iz~xQ3G^HJ^UoVXdk;ABa1XID9-f`9{K_p!s4eVfGiINjh3Edf0)4!i6 zj*QIY-5tN9js~5^_N`@4h`1+2t1@pAH_m6F7rCNON>!P=pi9jkth!hkk1n$*CmyZ0 zVhO;9N?Aj2RUF0bGbm6o!wVNpG8Iuw8 zq^O>7|6Cpm9ef;=M0q{Mi;iqAW(AKswBw%JMeja~He2MU(&0YObD|GXk{gd!Ym7a9 z#T4S7=fxEPxNOQxLLWa}TfEo3HaS^bADP5U;P>xPNXI) zy*3bDL3sm3Ovbo_J6N(FwHYK12+W-x492?${U>9FYCQPAP?Zd|@;_1WArPl(ir7Q% zK_~NpS`$i5LA*DnKh9KWqL6C>uX$5p`g+YN{uR_gQvmL%dPSV%7_Od$3YyQKB-D^= zQCt;ID0P2TObYxG^wU*5b*b-YEVP%sD#n@0jvB(a>+PE}1U_r5AS4b)DEsRyj)XKG zDs~7M{vw1AWyaf0wRBwcISlk=RXrg%VkSOgMVPk>f)0mz&S6#euVJEjN0P!|#A~9l z(1z<)hKO}3{~TWR|M(h+EzTJ%w{ozA1Q<|D<{{@Lz?L&Xb6ijVjsu8$PW(?f+z*HQkkMznR5__!%=sl>RVXsuLJaxbwCYzek}}gFxS^|pbO`BJc#GG;)cA0=QqYpuA-Esx@&%amL%%~; zj`3h>U=znf*+v;iHl*V5qIr*aWv1AO9-AOOYg!x2nPAB#Oon;ao+x%SDMEoY9x2wO zxf8{QOl2sDxeRgrKM=61n$-1;z#QLPg!l9uC03^mR&4q-DC|DNK6t~TNu{6xlOUB* zK?Sxy0M^@Na7B|v4|N=af|g8%7>3mWVSb6Gu&QvWW>$@QPZ671t6!h~xQ)vA7{ZVs zD^sjbFW&(|oN7TR{64wE0tG`DCZ!!PA72-xT@I2N84pbsWOqvb}3|mtqfT7o<3)4}! zpJ-jvfM`1-u*qQZHECr4q5;{{MJL^zVKHx%(SX^#gL=>O*GmJs%Md<>@RRDL-^5xZ zW&mLrwIc4|uW-(=@Hb@3_z&#NuT+PKpdYMQG*2{zP4rZ!Ggrk3O3Jhd39R`oGF-!a zcqly!eT&i3m9s>gN&6ac_n)QEsryZ^GE}EvC%kE~P6c-5KVVPJve0EM7QOV*Eb%dG zY387>u!?iTXco*C+ga&kx;5LvFMXldn0n8F_ZV?km@77=d*!gJ(m7(R$qj%oziCzq zS}_;=jJkoJmy#NxTNLJ53QwG8i5p5@_f<4h({U*1`aFwqDcFwlnWVb41J;B#&j(Y( zvK80^8ID-75?q=ru(*MOExU^FFodktGnwfm}XSu6}#nFhRNsha{j%wT>k z-E5%+1|66qtD@ou3oQXkf#qMrr)x(oLJwhKd^+PF!Zuro#P;Wfo3}tHl@^*UVFu z9$$`ujA6+N@!I7eHe$H~i*BxtAk2q3lUG=(2BtDySz&2eC2yCvErlzvtqf*(LFL;_ zX5DmIttfLPs%4liU`;8zB}M@-T|Y!~X0RPhwhChN{eeo6tyjTtj3S{XnO3X{6!-5{ z7I9H6vvDe_JH6U6Kv7_st>D8Q)`;epc}lr!*MOg4ehO^bcd*NdwPGuO#G=;FGe#c~ zG2Yfl6-QwQB!i$G(vxx)0Bb>dT|@j5ItmI~L2NmdJuVX#o@@(zd%208Co z+7ih|l=(eIx_@1REOGBzoI=6Qde@>R1@_Z_z+PN$p-cUcNwwZ$u|lpz#R{v1xt46g zMp*3F|3RRCb1fE|mj^#oVs9FLnamalbL>@^wtf#x4HE!Unby5$F#&}x`Z`vOs=aR+ z$}5P3>u9$(-bcF`TngT|*sfB+gbyqx3RqLxejR}|KLF938hmK6T@agXS1I?`4=uI} zg~`-wL!jXMHu!7JY`cmQmu$4yt^)gm!Hk%y6xn|hSQ+-Gz_xW_o&6>;-X9UsSu@+N zn=NLmWLvx0-_{yYwJm|hnz<#=SOE*6SxYhCac{L4Ve(ds#UkmUueOSvOh&E15LoL_ z?`@WGl7iT>%|cwc&0>TKN!k;bG0rT*h$QN0Tt^P@n{Pj9zyc7B2$rtNYJ z@Q!TJ(`N(Tn9hjmc$+tAOLX2ozhb}T=!@Cv4 zLj{n^V31y5FU^;!dy+B&kk=3A(zu6S2t{H)srS z=)D^l9IV7d^QDi)hfM~jkZk!FvD1)Gfrak^%JtuRHqw||0fjb4q3$TzzzH3!!0 z0SfUupI|g-Si4e?Z8r)stX+XQo<{2J(NP&%q8ll#3B7_gl(N{S4uG;B81YaK9xy3kS6DT*7h~b`FHu&K2&< z4?s}E0>D(Je-2opoI+Rq4#M-OgO>2DAX?r*c)oDZ5}uuhEOxHcH207tJOkF0!VBRZ zhD`(3oMskUA~Rs-$gC9kVv!{>LuoSYDhiaj-e;CZK;6uCsp#+aXO_sUz+V2`5}B1E z_k9jlhUF=+r7yu&TO76wC=|rP!xl4DUyZEMPn` zXCAe1DL87eS|mNx;g}^PDljE7`;J-sRY8OoTZog3ExKYPD+gk>_D!*6ilAhjJzK0z zFCVu|uoc9X;})LjC5XwG#yP3+2@o4Gx#$EuA@hVKCIe=+RfQj>akXjK7szWEESNT; zeP37_S|J`X55#Rx21+$x0GbUGx@wer5;`TEwE`fou zgT6UsiOo92`qQE^ud7DgPopR!KAR~LO>vRIDg2BjC@Zj$3}ysn1$M#;Q`FnM#4_s! z%xv-siTihTMpuI(N}(MiC@V}~DYXP;1vcP!bw*c>E|sDhh8w_28qvdNE!M8&Saa4A zloePB5m(>q{&k z846PnnZsbgW52X`yn;v?0>qYE=yl4zw6J$x2o&x15N%Cu+Xbr0IF)}b>tdVVf3;Ds<>I=tfy}`~EUSHq1q# zd-N-;br^ywu+l_?|}(b7>KJ9WG!wlUR1_zv$qzGevJJ;lar@Oh)= z3brv@9S;2l<1C~43Ie8ElZO5W;yObdu_Bx|vB=tO6yjt|nT1vP_gMaZehfkqmXfQ{ zf-=i|R4M4gTUc+rUS^4U3ZiTbEU)^{P)^r!3%2qHtSB}g3+%X`!E{qORA+={B`;oY zpjzKT7SmXQY2%Brn1ZByi}2{Dh<)E$Mit;){lv(A9WK4}x~1bQy>6+I zqQvKZutXLGwmkr5eo3MzV$==P(lBL3jFUHD_XZ3WG1!z;vaR|@8&KrmM3ea$+}}4X z+D-h?qFp5G(}5o?U4;UR{>cJM{mD{G;dhwIwVy1tOs#;%5mReYuUnRgrtpI~niqi; zSm@7zu%SPTT})P2@H5IaYz@gqbYL<}6z|g_sQYcy*JvY!>FNux`%V9W`2BWZX+7_w z<3UD>!3NmSfYcH193KzzGpcMgHRA@53taWcX{E| z{a1^*DA*+rFqd2Vt7UYrAP&rc*5j_QnED&C8KGFgA{0MnvP%UvXeR5#euI}9_6x%? z+b^Sg+a0Tnhig#o?}76C{5xJ(8xy$1Kk!C=w*C?mS0cqw<~_VC8uthE5c(&iFxdmU zp={uvqWSdL-airJ4Su)|t3G{wS8Rq)(2M2^tcvd9UB5wxa$8Ws!Uhra_B{xsZ$)Gm zT`3Ys)c7yF+m`rNf=x8#FL8%6Y^wTp_yc}hKrc%C2MYwx{f+HFqy2ER8Sa7U)qMN| zY&aSGuQ(#$E35gw%l~2zqP-8_Ewjf5+6*DGSi9YZ?>b4a#nyTIyfndHT{{Uy$$~V= zp8KpS)*fG}AXODiJDJLDQifgs^am*-WCTkiOdKkMC42#nm)w(9hk&86(EwO{C@oYP zF1F!&{tEf?#vG+kDzU}7d`Cj1S@?DjKUhDTlB-G^13vPwiR@w0A=3xuOT$o>(Z0!c z$$Tngvo$G%OXHj&eBX-p@xMaK3YX^D_w&s`yU1Bh%5ZMtn=jY#X9?w1lgO@}i`zws z)lsmKEJ9M>MW}t?Yd-a;AziGgpB3Y~b;?Fis|aaH&HSON&a?Tx(BJauY=m^*nZURE zhNC&=k47 zbxS)U^%Ec5%u7OIYg22FG|?W%&p+&;0*@5c8eZiM>j#>?FR7jDY{CuFH&ZQ@&i zFZl{&=^LB#Np7Vb`F^@xl!u-F&I-QUE{;E&(1=)RhiQM1r-?M!v_EJ;6S$TUQJhUB z^D&q#B*R0vS5-VmzciJGnU1EWK7{Jr-~vwP0`Bn%4@*^T_TfCbOebe^w5D-~T6uHk z?D`&})D{x1k=OSGU2b8)_H7BQv7M>3C9rXP=Ux&e$H5^C*Q<5RT(TC-t? zujmn}v-$L;y&V*9?9)nb#{w2F87E`fgQro?1?@qs*Th%ZUTTL=`)P7gd)|ijB&$>zR)KJtu06I2 zb$Lb_Xet+?MbYUUn41+pBc)k|{J}&A`PQ5Ca`{EXZvDrY|Bvq_ zO?1xYM^jR`--gk>UeY&q-F&J1B^GITXLFMJzKr0ZeFMA?-Fq30XE4v{jhd$oRxM%x zk8#~e=p+4Uq7wRA+%~;0n$8#qUS>&yWnw>;)crEPztoVn??#iH?guRybU>J|a>13h zb?9J!DA(Yu+~nMBfHc4qjdKQ|K5o9n8(*m&i24|3?U01e4wQ!5n{d<0_azTveR_31 zzQ`w}W!kAdUPVAk%K-+mCV=1$8UkrJ^0k) zphmAqU7g)|17-3}y-DO83A=fIi-cSMUy=4kYS-#G)Xs}Mj@VlC={}D{Z@r3+#}Ghx zjfL_d(tKwLx5+sE{D6waA_korBK>Nz&-h^|=TJ<8D)jwO=}8kKAdZ<%KZ9?EeYzHp z2uUwR9Q1^f?=`7!M_35rdd#Jw;TCl%Y!;7@#yh8T z_cByZAl6f>CUwlbNAf<8RB<=WvRjgL-90#zy*{9V5Le zIPb1dG2OpXpS^t020Ya`0#%SMk+Y1S26FR($$Wzm&3IkfDz@RL3d4fbk15nYt?*N7 z>>D^6X^^(s3wfDAlspAh*P}co zPKEA`n=h3ndk`5LM%SlGuY@P?^Jx{m>7hCJ^Z_tceG{ii-I@hG%D{VzirZ$Hm%G?!8{;f=<`vM38)dpA=` z&_~`Wl$eDOZHNw%dG?OW)$%&}lHbHBE1=a^ZJsP zO5@CGMy2bKyB4~_AG0O%hbDliOL3R606i)PqjS9!e0E7i;0^CG=r0gag9?{PDgS|} zPR}oA;|Z-EIxD<<{{Il;R#RSdBV4r-!&^T@ zE%GO>M;{Qn4hvm9%B+ovThmpRJ_;&^BCr>7OYVisj;y_((gDnVlGNExpOW8 z(;nU_te_rw(#A;btA6}iJ+&){eh-1exCLePdx(psUVRvI;P<5*(^$N620EDN52VNJ zqxBe+`T<&CvN_p=DnF3SuQB331c{MD*dR5f&pwpenz8}*n(5w@^bH6}Mmyr`G4o8z zMfhgSya11Ku)YZwLTs{FJo(vN)=aQ?DX|!$-FThdCg*iIKw0+ux`4utN|{P+A6&maJ&RFv8`AE z(FPGId?Xadz;0Tw4ZMur#`%%eqCP@f8N;i@?MNE;a#wDLzKy9HlJ#lg4z!wKgMi^H zB0Hpx)@=3Y{w)mfI^?5q3&aiH|KLs@x@Aw33*w*+h;g zdSy38W5qm25|!>oN8XJ0K#Qoz2TdEcrj#*wkCf_6o27P%n?6;aVZPEm7}uC+6F+71 z1Kwk&@$-9MegR7bxIw*$Efw&hrc*hR zf!}|t7c0{4&oIc>K7l@&qCSVIYhP=3(`J^e;1k;+^yp!@M`W72D) zKCk7Sbd&i?bC9C}DmS-SnrdoCd?=tX<*sS)@X8ZX2n{+ena@`h9LMO`@Wj3+;E5%C zNnizCK7pzo=Hq1C$?yeR;o*ZN+&}RJv>n9HMrPCIlfY*4q=R~#f)ac3^TxS!`4q6) zZNxapd>Sq_n-74p$$16^X<`)9f-~?iO^g(}cLpmTg}kbpW~-K$PYX(uaDm^DP6K2!>bC~{hU&;_6SC>8^HNuP@tbNP_-;Le zo}}=(Oz1-%!VXG5bw~9@uE7bjtp1&;hFxgSwWo8Wea#7S*%V!9>9qiV&t_nJ4*9CoAbdq|^X0)c zRs>gFPFt>GdaK3bTzv{IT$7%twk~+Nur|2%y5OhQ(sS3~2}T9-u0cdS$sI7ugCTW? zZ=~l;-kbA{IsE&CGU)-nhSMR!z1tDxP8CwflO82TrM;le)?Ty+DgU&mo05SR+%zIR zYTTn`E|n^?mii2;=&4Z0cUIH6vicNMCPCUWg`BU0OQx^s>ruW1Lbk8`@2J6H0zU8& zQnzKWebbZNM|@MN*7ZG>;pn2K%brl5?Rh$kKi&LU!SPLa`Yun$@pKS>O8j|4qvz$h z`7@WpSEvbxg#T`X-(|}0hC(KFo+!KVm6jAdY!xa+XnRoL zw!(>W{m@78Gr{-yM7gg`m`Bl*<+CUzb&8CybWV}m3AjyZCVn4yORg3IN}TkaBFhL^ z3be)yIXsk=oJpIf$T75Rw(RnKKSdU7Fy!#*a>LMeKo+u}G9+m+T^Vz%g+O(aGO#bQ-eCqkS9Z0l+sX$rvX!BZdhtbg4 za&sYHm17fr)87n#gZ=l-ED+h}$da&!8qJYogkpuvH*k(TU4Wx}HCO&6SjhFAdP^Q7 z(CI0l?!HKt==s_BH5R{w8)}Aii{xNoEz|$;+P>7+gTD7BV%Vck8TfkEo{HhQ{Emz21TcMY7SID(# z#0vQlsChkLP$3@f&^Uz&`&osxQxN)cMk&87rwf~WZ@(?Kw$VGQAl@~S>r<0;vPdIa z<2=;QQ=(n;*cu4aW0lh0Osn+bzL+T5-pT8rv1{e(GrkR&9ex$91GdHt)bdw`tv;*{t{FKH6G_FZPz1h-irZV)$xixn z73dy67$cIr8VCm~_C>}SpFYKB{SG2W#%j3%;e)4Pw0^bRgiaicap4t*s-!TAepj~p z%HEL&h2RsnOpEQtq>dPy)CH}P$q(_5>Kz;;1dmA_KWaRn?&fOLX3(JE@xw<9o1lPc z;d}52w{Pov^4wsd54GALe}dM&u|ZxSr1)OnC?^Wk|D^1o&o{}%FpWi<(Qw6-zZp%P z&mMJX#%4LZN^9o)d&~e90tyv?FKdhZus~}VoBdl+t!-OT=_!X|9CT?bw3f6@#y1b= zMMu)5lX6XZdYjycI&6daFwVY3+hkD)&wN;wf5%Cx_y~%+))FOO{Yd^pz=bTGy`bGG zM=DVxiSBQgXF}ARouG?;D>{NU?2vZ`H;H!u`P_QjaHTDM!p=~ zaK2=yNC@^0Yu&0v+g6XXAJVQBi#IFCTYzBHCm+7pyFjiFB~2)hhoPLW3*@Fq;eqv} zopKtT+m5#1wo`6zE35CjzEj>{qq!_TtoZ~koIoFc0;R5^-#?L`K*(#q8*ytLy}Vl< z3h&*&TlT@r%6y1&@hBC61V4o~l;)FVrFta{BGWfMI91&}ax+_yOyxegwr{{5xlJ%4 zYtBBPyBvi2PV7Szs37N2sLHWlZiOr3a|-2#5zNv7cU;f&yXD0P6y*z}y3JBsq>k4E(A_ zB?sgXl&_(xDFFw|+nltT(2h#MNGTN~2@R|ioyOCLyw3YtT2ZG8mcDmW*YJ`wHKm8e1u95L7Iv}xpjDgSJiOUub75KNV>RCmThfYQ|JAt zDCW=mkCZbf5B%1@y+js09N7f3HmTA@*e!_S6Q zs;^W!lfF7G-xAV%$4s6qNoKz=~;RGDv;uygoXdPM(%u zqU6&^-oG6a?(23&9x;x(oJ=fzoF&)e-pIRQQC~Eu>I69=6P61sO4P#DvsWMvoXf z3XQ2{c(jYRsV%-U6+PjVXnGf~EX4bAyLj6R!Ci&ER5}Hn^6e+R;d%iPPkHUOGM8Ff z^QXMwXf{K_ zrP*Y!!`>d#4k5@EluKDjUeSs71Ij!kgwI9>P$j^g*Ev;t-Wi5*^n4C4q;il&UE;Yl z^e&Ee;M+1_p6`b)qhx?7DcKtqRpy7Qj(HH1YY(M^Cb8HL-JYW>{NT@Vc$}Z0LnsSu zJX1MZ`)YYOug7{0&m`dm)I& z9H4uo@h`S(=q(&w;Ri3~@Dg4Xjs6D?Pohe&bC&pJi=osPq13n+q0~4(+z<>_m{RfT z88lIGeu93$(YQXHp)>t*U*~AtU<$Oe%ulYSGlO{j!bV=yg=i z&~Cp%7jyJ*a`pz=!E2;h^tT-CrbLF$_A`|BsG1ry(t)Nvy&=yW4lATQmZikcM~W46 z)u0qAWoUOxRYy*Ts^VJ;Is|B;573#(ynT2BM4&x|pirRW`*>TTyG~UfIeol$gszm; z7k-t(mt%OApioqX38^i>ywBUZHiysR8q?^#9G*$#V23z*udlad6ym5xpgenXs``}J z4^%1Cx1V<~`iQ;#ye*yi(W=jm$>c|PkHa(hASaHO z8D34L$6UKV)KcM>trM_WhAw;F{fouww;H?Nvg7U$PjP4EgP6F%n6jZyAN>ku;C4Q`@NAg;Fe702Y zFt!vxBVX|z#7cngp;x`vZJ3-phk4iA&=nO7XA%ebdW`hWv%x(}M?>T|62^EhMkO_} ziu_xY$``jFjzNvm{Ll^Rs^}E*j79Ykrp7{Id^B$?+A%Xm<(0teRmq79$vFZ!bfC~+Jry2+O}&U+^qlf#_xpw{MuFk0o`-3BVP+gCK+JI;oAU;G=;5*A$EK;{&( zPlB0Zk$aMNBgD#^46%x7?__T`j4^~MV7SN6J)N@3u+SGj1+4;31yj9Cqbj(YYWDR= zj7pY7eW!sLSWiR6Gbw&Llo&**)0GyRG95Sv6#>X*P`^y~UK5z6XL=_^75eFLW>b|T zmXI=Fx!p71*&8?vV`ji?6^&?1hPMSx2F`aQ!y9Ldax}0u)ZT|xE|BC+6k5@cUU}2o z0?nH9CMv7Vm6EvjS~gRuv5^O8XRh1ItT&YcymA)n&-@H6gXeUUXBHSI`H8WaqtV?l zw46m*6VIP?8D{7MB3SH`%P`Qf5lsM1U(VGde)E=A3OrO)x> zK7muYDHT*sho5@irE*q4?i}p;P?Ooj5w1(t)Nv^T2U9how=T!qLxemUDC*m9i|-d}KMqVVNY%hZfWPviw8^ zj5J}sH%!Q-9`n5|sXNQ|SiCA6dX%)BMowIXZ<(ffh39=3;L*+Orq|BVma* ztp^|l7lFv8;}?M_zUXz3`x5gXzX12s1hpK@W-o!h(AW2p_ccMtomX_(i@z9O(dEXG G-Tx0L@Qqgh 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) } } `