From eabf455109d2190bbe5154fb684923db6818e02b Mon Sep 17 00:00:00 2001 From: aQua Date: Tue, 25 Jul 2017 10:05:47 +0800 Subject: [PATCH] =?UTF-8?q?=E9=87=8D=E6=96=B0=E7=94=9F=E6=88=90=E4=BA=86?= =?UTF-8?q?=E6=96=87=E4=BB=B6=E5=A4=B9?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../0011.container-with-most-water/README.md | 11 +++++ .../container-with-most-water.go | 2 + .../container-with-most-water_test.go | 43 ++++++++++++++++++ Algorithms/0012.integer-to-roman/README.md | 11 +++++ .../0012.integer-to-roman/integer-to-roman.go | 2 + .../integer-to-roman_test.go | 43 ++++++++++++++++++ Algorithms/0013.roman-to-integer/README.md | 11 +++++ .../0013.roman-to-integer/roman-to-integer.go | 2 + .../roman-to-integer_test.go | 43 ++++++++++++++++++ .../0014.longest-common-prefix/README.md | 11 +++++ .../longest-common-prefix.go | 2 + .../longest-common-prefix_test.go | 43 ++++++++++++++++++ Algorithms/0015.3sum/3sum.go | 2 + Algorithms/0015.3sum/3sum_test.go | 43 ++++++++++++++++++ Algorithms/0015.3sum/README.md | 11 +++++ Algorithms/0016.3sum-closest/3sum-closest.go | 2 + .../0016.3sum-closest/3sum-closest_test.go | 43 ++++++++++++++++++ Algorithms/0016.3sum-closest/README.md | 11 +++++ .../README.md | 11 +++++ .../letter-combinations-of-a-phone-number.go | 2 + ...ter-combinations-of-a-phone-number_test.go | 43 ++++++++++++++++++ Algorithms/0018.4sum/4sum.go | 2 + Algorithms/0018.4sum/4sum_test.go | 43 ++++++++++++++++++ Algorithms/0018.4sum/README.md | 11 +++++ .../README.md | 11 +++++ .../remove-nth-node-from-end-of-list.go | 2 + .../remove-nth-node-from-end-of-list_test.go | 43 ++++++++++++++++++ Algorithms/0020.valid-parentheses/README.md | 11 +++++ .../valid-parentheses.go | 2 + .../valid-parentheses_test.go | 43 ++++++++++++++++++ .../0021.merge-two-sorted-lists/README.md | 11 +++++ .../merge-two-sorted-lists.go | 2 + .../merge-two-sorted-lists_test.go | 43 ++++++++++++++++++ .../0022.generate-parentheses/README.md | 11 +++++ .../generate-parentheses.go | 2 + .../generate-parentheses_test.go | 43 ++++++++++++++++++ .../0023.merge-k-sorted-lists/README.md | 11 +++++ .../merge-k-sorted-lists.go | 2 + .../merge-k-sorted-lists_test.go | 43 ++++++++++++++++++ Algorithms/0024.swap-nodes-in-pairs/README.md | 11 +++++ .../swap-nodes-in-pairs.go | 2 + .../swap-nodes-in-pairs_test.go | 43 ++++++++++++++++++ .../0025.reverse-nodes-in-k-group/README.md | 11 +++++ .../reverse-nodes-in-k-group.go | 2 + .../reverse-nodes-in-k-group_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../remove-duplicates-from-sorted-array.go | 2 + ...emove-duplicates-from-sorted-array_test.go | 43 ++++++++++++++++++ Algorithms/0027.remove-element/README.md | 11 +++++ .../0027.remove-element/remove-element.go | 2 + .../remove-element_test.go | 43 ++++++++++++++++++ Algorithms/0028.implement-strstr/README.md | 11 +++++ .../0028.implement-strstr/implement-strstr.go | 2 + .../implement-strstr_test.go | 43 ++++++++++++++++++ Algorithms/0029.divide-two-integers/README.md | 11 +++++ .../divide-two-integers.go | 2 + .../divide-two-integers_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...bstring-with-concatenation-of-all-words.go | 2 + ...ng-with-concatenation-of-all-words_test.go | 43 ++++++++++++++++++ Algorithms/0031.next-permutation/README.md | 11 +++++ .../0031.next-permutation/next-permutation.go | 2 + .../next-permutation_test.go | 43 ++++++++++++++++++ .../0032.longest-valid-parentheses/README.md | 11 +++++ .../longest-valid-parentheses.go | 2 + .../longest-valid-parentheses_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../search-in-rotated-sorted-array.go | 2 + .../search-in-rotated-sorted-array_test.go | 43 ++++++++++++++++++ Algorithms/0034.search-for-a-range/README.md | 11 +++++ .../search-for-a-range.go | 2 + .../search-for-a-range_test.go | 43 ++++++++++++++++++ .../0035.search-insert-position/README.md | 11 +++++ .../search-insert-position.go | 2 + .../search-insert-position_test.go | 43 ++++++++++++++++++ Algorithms/0036.valid-sudoku/README.md | 11 +++++ Algorithms/0036.valid-sudoku/valid-sudoku.go | 2 + .../0036.valid-sudoku/valid-sudoku_test.go | 43 ++++++++++++++++++ Algorithms/0037.sudoku-solver/README.md | 11 +++++ .../0037.sudoku-solver/sudoku-solver.go | 2 + .../0037.sudoku-solver/sudoku-solver_test.go | 43 ++++++++++++++++++ Algorithms/0038.count-and-say/README.md | 11 +++++ .../0038.count-and-say/count-and-say.go | 2 + .../0038.count-and-say/count-and-say_test.go | 43 ++++++++++++++++++ Algorithms/0039.combination-sum/README.md | 11 +++++ .../0039.combination-sum/combination-sum.go | 2 + .../combination-sum_test.go | 43 ++++++++++++++++++ Algorithms/0040.combination-sum-ii/README.md | 11 +++++ .../combination-sum-ii.go | 2 + .../combination-sum-ii_test.go | 43 ++++++++++++++++++ .../0041.first-missing-positive/README.md | 11 +++++ .../first-missing-positive.go | 2 + .../first-missing-positive_test.go | 43 ++++++++++++++++++ Algorithms/0042.trapping-rain-water/README.md | 11 +++++ .../trapping-rain-water.go | 2 + .../trapping-rain-water_test.go | 43 ++++++++++++++++++ Algorithms/0043.multiply-strings/README.md | 11 +++++ .../0043.multiply-strings/multiply-strings.go | 2 + .../multiply-strings_test.go | 43 ++++++++++++++++++ Algorithms/0044.wildcard-matching/README.md | 11 +++++ .../wildcard-matching.go | 2 + .../wildcard-matching_test.go | 43 ++++++++++++++++++ Algorithms/0045.jump-game-ii/README.md | 11 +++++ Algorithms/0045.jump-game-ii/jump-game-ii.go | 2 + .../0045.jump-game-ii/jump-game-ii_test.go | 43 ++++++++++++++++++ Algorithms/0046.permutations/README.md | 11 +++++ Algorithms/0046.permutations/permutations.go | 2 + .../0046.permutations/permutations_test.go | 43 ++++++++++++++++++ Algorithms/0047.permutations-ii/README.md | 11 +++++ .../0047.permutations-ii/permutations-ii.go | 2 + .../permutations-ii_test.go | 43 ++++++++++++++++++ Algorithms/0048.rotate-image/README.md | 11 +++++ Algorithms/0048.rotate-image/rotate-image.go | 2 + .../0048.rotate-image/rotate-image_test.go | 43 ++++++++++++++++++ Algorithms/0049.group-anagrams/README.md | 11 +++++ .../0049.group-anagrams/group-anagrams.go | 2 + .../group-anagrams_test.go | 43 ++++++++++++++++++ Algorithms/0050.powx-n/README.md | 11 +++++ Algorithms/0050.powx-n/powx-n.go | 2 + Algorithms/0050.powx-n/powx-n_test.go | 43 ++++++++++++++++++ Algorithms/0051.n-queens/README.md | 11 +++++ Algorithms/0051.n-queens/n-queens.go | 2 + Algorithms/0051.n-queens/n-queens_test.go | 43 ++++++++++++++++++ Algorithms/0052.n-queens-ii/README.md | 11 +++++ Algorithms/0052.n-queens-ii/n-queens-ii.go | 2 + .../0052.n-queens-ii/n-queens-ii_test.go | 43 ++++++++++++++++++ Algorithms/0053.maximum-subarray/README.md | 11 +++++ .../0053.maximum-subarray/maximum-subarray.go | 2 + .../maximum-subarray_test.go | 43 ++++++++++++++++++ Algorithms/0054.spiral-matrix/README.md | 11 +++++ .../0054.spiral-matrix/spiral-matrix.go | 2 + .../0054.spiral-matrix/spiral-matrix_test.go | 43 ++++++++++++++++++ Algorithms/0055.jump-game/README.md | 11 +++++ Algorithms/0055.jump-game/jump-game.go | 2 + Algorithms/0055.jump-game/jump-game_test.go | 43 ++++++++++++++++++ Algorithms/0056.merge-intervals/README.md | 11 +++++ .../0056.merge-intervals/merge-intervals.go | 2 + .../merge-intervals_test.go | 43 ++++++++++++++++++ Algorithms/0057.insert-interval/README.md | 11 +++++ .../0057.insert-interval/insert-interval.go | 2 + .../insert-interval_test.go | 43 ++++++++++++++++++ Algorithms/0058.length-of-last-word/README.md | 11 +++++ .../length-of-last-word.go | 2 + .../length-of-last-word_test.go | 43 ++++++++++++++++++ Algorithms/0059.spiral-matrix-ii/README.md | 11 +++++ .../0059.spiral-matrix-ii/spiral-matrix-ii.go | 2 + .../spiral-matrix-ii_test.go | 43 ++++++++++++++++++ .../0060.permutation-sequence/README.md | 11 +++++ .../permutation-sequence.go | 2 + .../permutation-sequence_test.go | 43 ++++++++++++++++++ Algorithms/0061.rotate-list/README.md | 11 +++++ Algorithms/0061.rotate-list/rotate-list.go | 2 + .../0061.rotate-list/rotate-list_test.go | 43 ++++++++++++++++++ Algorithms/0062.unique-paths/README.md | 11 +++++ Algorithms/0062.unique-paths/unique-paths.go | 2 + .../0062.unique-paths/unique-paths_test.go | 43 ++++++++++++++++++ Algorithms/0063.unique-paths-ii/README.md | 11 +++++ .../0063.unique-paths-ii/unique-paths-ii.go | 2 + .../unique-paths-ii_test.go | 43 ++++++++++++++++++ Algorithms/0064.minimum-path-sum/README.md | 11 +++++ .../0064.minimum-path-sum/minimum-path-sum.go | 2 + .../minimum-path-sum_test.go | 43 ++++++++++++++++++ Algorithms/0065.valid-number/README.md | 11 +++++ Algorithms/0065.valid-number/valid-number.go | 2 + .../0065.valid-number/valid-number_test.go | 43 ++++++++++++++++++ Algorithms/0066.plus-one/README.md | 11 +++++ Algorithms/0066.plus-one/plus-one.go | 2 + Algorithms/0066.plus-one/plus-one_test.go | 43 ++++++++++++++++++ Algorithms/0067.add-binary/README.md | 11 +++++ Algorithms/0067.add-binary/add-binary.go | 2 + Algorithms/0067.add-binary/add-binary_test.go | 43 ++++++++++++++++++ Algorithms/0068.text-justification/README.md | 11 +++++ .../text-justification.go | 2 + .../text-justification_test.go | 43 ++++++++++++++++++ Algorithms/0069.sqrtx/README.md | 11 +++++ Algorithms/0069.sqrtx/sqrtx.go | 2 + Algorithms/0069.sqrtx/sqrtx_test.go | 43 ++++++++++++++++++ Algorithms/0070.climbing-stairs/README.md | 11 +++++ .../0070.climbing-stairs/climbing-stairs.go | 2 + .../climbing-stairs_test.go | 43 ++++++++++++++++++ Algorithms/0071.simplify-path/README.md | 11 +++++ .../0071.simplify-path/simplify-path.go | 2 + .../0071.simplify-path/simplify-path_test.go | 43 ++++++++++++++++++ Algorithms/0072.edit-distance/README.md | 11 +++++ .../0072.edit-distance/edit-distance.go | 2 + .../0072.edit-distance/edit-distance_test.go | 43 ++++++++++++++++++ Algorithms/0073.set-matrix-zeroes/README.md | 11 +++++ .../set-matrix-zeroes.go | 2 + .../set-matrix-zeroes_test.go | 43 ++++++++++++++++++ Algorithms/0074.search-a-2d-matrix/README.md | 11 +++++ .../search-a-2d-matrix.go | 2 + .../search-a-2d-matrix_test.go | 43 ++++++++++++++++++ Algorithms/0075.sort-colors/README.md | 11 +++++ Algorithms/0075.sort-colors/sort-colors.go | 2 + .../0075.sort-colors/sort-colors_test.go | 43 ++++++++++++++++++ .../0076.minimum-window-substring/README.md | 11 +++++ .../minimum-window-substring.go | 2 + .../minimum-window-substring_test.go | 43 ++++++++++++++++++ Algorithms/0077.combinations/README.md | 11 +++++ Algorithms/0077.combinations/combinations.go | 2 + .../0077.combinations/combinations_test.go | 43 ++++++++++++++++++ Algorithms/0078.subsets/README.md | 11 +++++ Algorithms/0078.subsets/subsets.go | 2 + Algorithms/0078.subsets/subsets_test.go | 43 ++++++++++++++++++ Algorithms/0079.word-search/README.md | 11 +++++ Algorithms/0079.word-search/word-search.go | 2 + .../0079.word-search/word-search_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../remove-duplicates-from-sorted-array-ii.go | 2 + ...ve-duplicates-from-sorted-array-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../search-in-rotated-sorted-array-ii.go | 2 + .../search-in-rotated-sorted-array-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../remove-duplicates-from-sorted-list-ii.go | 2 + ...ove-duplicates-from-sorted-list-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../remove-duplicates-from-sorted-list.go | 2 + ...remove-duplicates-from-sorted-list_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../largest-rectangle-in-histogram.go | 2 + .../largest-rectangle-in-histogram_test.go | 43 ++++++++++++++++++ Algorithms/0085.maximal-rectangle/README.md | 11 +++++ .../maximal-rectangle.go | 2 + .../maximal-rectangle_test.go | 43 ++++++++++++++++++ Algorithms/0086.partition-list/README.md | 11 +++++ .../0086.partition-list/partition-list.go | 2 + .../partition-list_test.go | 43 ++++++++++++++++++ Algorithms/0087.scramble-string/README.md | 11 +++++ .../0087.scramble-string/scramble-string.go | 2 + .../scramble-string_test.go | 43 ++++++++++++++++++ Algorithms/0088.merge-sorted-array/README.md | 11 +++++ .../merge-sorted-array.go | 2 + .../merge-sorted-array_test.go | 43 ++++++++++++++++++ Algorithms/0089.gray-code/README.md | 11 +++++ Algorithms/0089.gray-code/gray-code.go | 2 + Algorithms/0089.gray-code/gray-code_test.go | 43 ++++++++++++++++++ Algorithms/0090.subsets-ii/README.md | 11 +++++ Algorithms/0090.subsets-ii/subsets-ii.go | 2 + Algorithms/0090.subsets-ii/subsets-ii_test.go | 43 ++++++++++++++++++ Algorithms/0091.decode-ways/README.md | 11 +++++ Algorithms/0091.decode-ways/decode-ways.go | 2 + .../0091.decode-ways/decode-ways_test.go | 43 ++++++++++++++++++ .../0092.reverse-linked-list-ii/README.md | 11 +++++ .../reverse-linked-list-ii.go | 2 + .../reverse-linked-list-ii_test.go | 43 ++++++++++++++++++ .../0093.restore-ip-addresses/README.md | 11 +++++ .../restore-ip-addresses.go | 2 + .../restore-ip-addresses_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-inorder-traversal.go | 2 + .../binary-tree-inorder-traversal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../unique-binary-search-trees-ii.go | 2 + .../unique-binary-search-trees-ii_test.go | 43 ++++++++++++++++++ .../0096.unique-binary-search-trees/README.md | 11 +++++ .../unique-binary-search-trees.go | 2 + .../unique-binary-search-trees_test.go | 43 ++++++++++++++++++ Algorithms/0097.interleaving-string/README.md | 11 +++++ .../interleaving-string.go | 2 + .../interleaving-string_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../validate-binary-search-tree.go | 2 + .../validate-binary-search-tree_test.go | 43 ++++++++++++++++++ .../0099.recover-binary-search-tree/README.md | 11 +++++ .../recover-binary-search-tree.go | 2 + .../recover-binary-search-tree_test.go | 43 ++++++++++++++++++ Algorithms/0100.same-tree/README.md | 11 +++++ Algorithms/0100.same-tree/same-tree.go | 2 + Algorithms/0100.same-tree/same-tree_test.go | 43 ++++++++++++++++++ Algorithms/0101.symmetric-tree/README.md | 11 +++++ .../0101.symmetric-tree/symmetric-tree.go | 2 + .../symmetric-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-level-order-traversal.go | 2 + .../binary-tree-level-order-traversal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...inary-tree-zigzag-level-order-traversal.go | 2 + ...-tree-zigzag-level-order-traversal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../maximum-depth-of-binary-tree.go | 2 + .../maximum-depth-of-binary-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ree-from-preorder-and-inorder-traversal.go | 2 + ...rom-preorder-and-inorder-traversal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ee-from-inorder-and-postorder-traversal.go | 2 + ...om-inorder-and-postorder-traversal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-level-order-traversal-ii.go | 2 + ...nary-tree-level-order-traversal-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...vert-sorted-array-to-binary-search-tree.go | 2 + ...sorted-array-to-binary-search-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...nvert-sorted-list-to-binary-search-tree.go | 2 + ...-sorted-list-to-binary-search-tree_test.go | 43 ++++++++++++++++++ .../0110.balanced-binary-tree/README.md | 11 +++++ .../balanced-binary-tree.go | 2 + .../balanced-binary-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../minimum-depth-of-binary-tree.go | 2 + .../minimum-depth-of-binary-tree_test.go | 43 ++++++++++++++++++ Algorithms/0112.path-sum/README.md | 11 +++++ Algorithms/0112.path-sum/path-sum.go | 2 + Algorithms/0112.path-sum/path-sum_test.go | 43 ++++++++++++++++++ Algorithms/0113.path-sum-ii/README.md | 11 +++++ Algorithms/0113.path-sum-ii/path-sum-ii.go | 2 + .../0113.path-sum-ii/path-sum-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../flatten-binary-tree-to-linked-list.go | 2 + ...flatten-binary-tree-to-linked-list_test.go | 43 ++++++++++++++++++ .../0115.distinct-subsequences/README.md | 11 +++++ .../distinct-subsequences.go | 2 + .../distinct-subsequences_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...lating-next-right-pointers-in-each-node.go | 2 + ...g-next-right-pointers-in-each-node_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ing-next-right-pointers-in-each-node-ii.go | 2 + ...ext-right-pointers-in-each-node-ii_test.go | 43 ++++++++++++++++++ Algorithms/0118.pascals-triangle/README.md | 11 +++++ .../0118.pascals-triangle/pascals-triangle.go | 2 + .../pascals-triangle_test.go | 43 ++++++++++++++++++ Algorithms/0119.pascals-triangle-ii/README.md | 11 +++++ .../pascals-triangle-ii.go | 2 + .../pascals-triangle-ii_test.go | 43 ++++++++++++++++++ Algorithms/0120.triangle/README.md | 11 +++++ Algorithms/0120.triangle/triangle.go | 2 + Algorithms/0120.triangle/triangle_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../best-time-to-buy-and-sell-stock.go | 2 + .../best-time-to-buy-and-sell-stock_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../best-time-to-buy-and-sell-stock-ii.go | 2 + ...best-time-to-buy-and-sell-stock-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../best-time-to-buy-and-sell-stock-iii.go | 2 + ...est-time-to-buy-and-sell-stock-iii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-maximum-path-sum.go | 2 + .../binary-tree-maximum-path-sum_test.go | 43 ++++++++++++++++++ Algorithms/0125.valid-palindrome/README.md | 11 +++++ .../0125.valid-palindrome/valid-palindrome.go | 2 + .../valid-palindrome_test.go | 43 ++++++++++++++++++ Algorithms/0126.word-ladder-ii/README.md | 11 +++++ .../0126.word-ladder-ii/word-ladder-ii.go | 2 + .../word-ladder-ii_test.go | 43 ++++++++++++++++++ Algorithms/0127.word-ladder/README.md | 11 +++++ Algorithms/0127.word-ladder/word-ladder.go | 2 + .../0127.word-ladder/word-ladder_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../longest-consecutive-sequence.go | 2 + .../longest-consecutive-sequence_test.go | 43 ++++++++++++++++++ .../0129.sum-root-to-leaf-numbers/README.md | 11 +++++ .../sum-root-to-leaf-numbers.go | 2 + .../sum-root-to-leaf-numbers_test.go | 43 ++++++++++++++++++ Algorithms/0130.surrounded-regions/README.md | 11 +++++ .../surrounded-regions.go | 2 + .../surrounded-regions_test.go | 43 ++++++++++++++++++ .../0131.palindrome-partitioning/README.md | 11 +++++ .../palindrome-partitioning.go | 2 + .../palindrome-partitioning_test.go | 43 ++++++++++++++++++ .../0132.palindrome-partitioning-ii/README.md | 11 +++++ .../palindrome-partitioning-ii.go | 2 + .../palindrome-partitioning-ii_test.go | 43 ++++++++++++++++++ Algorithms/0133.clone-graph/README.md | 11 +++++ Algorithms/0133.clone-graph/clone-graph.go | 2 + .../0133.clone-graph/clone-graph_test.go | 43 ++++++++++++++++++ Algorithms/0134.gas-station/README.md | 11 +++++ Algorithms/0134.gas-station/gas-station.go | 2 + .../0134.gas-station/gas-station_test.go | 43 ++++++++++++++++++ Algorithms/0135.candy/README.md | 11 +++++ Algorithms/0135.candy/candy.go | 2 + Algorithms/0135.candy/candy_test.go | 43 ++++++++++++++++++ Algorithms/0136.single-number/README.md | 11 +++++ .../0136.single-number/single-number.go | 2 + .../0136.single-number/single-number_test.go | 43 ++++++++++++++++++ Algorithms/0137.single-number-ii/README.md | 11 +++++ .../0137.single-number-ii/single-number-ii.go | 2 + .../single-number-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../copy-list-with-random-pointer.go | 2 + .../copy-list-with-random-pointer_test.go | 43 ++++++++++++++++++ Algorithms/0139.word-break/README.md | 11 +++++ Algorithms/0139.word-break/word-break.go | 2 + Algorithms/0139.word-break/word-break_test.go | 43 ++++++++++++++++++ Algorithms/0140.word-break-ii/README.md | 11 +++++ .../0140.word-break-ii/word-break-ii.go | 2 + .../0140.word-break-ii/word-break-ii_test.go | 43 ++++++++++++++++++ Algorithms/0141.linked-list-cycle/README.md | 11 +++++ .../linked-list-cycle.go | 2 + .../linked-list-cycle_test.go | 43 ++++++++++++++++++ .../0142.linked-list-cycle-ii/README.md | 11 +++++ .../linked-list-cycle-ii.go | 2 + .../linked-list-cycle-ii_test.go | 43 ++++++++++++++++++ Algorithms/0143.reorder-list/README.md | 11 +++++ Algorithms/0143.reorder-list/reorder-list.go | 2 + .../0143.reorder-list/reorder-list_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-preorder-traversal.go | 2 + .../binary-tree-preorder-traversal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-postorder-traversal.go | 2 + .../binary-tree-postorder-traversal_test.go | 43 ++++++++++++++++++ Algorithms/0146.lru-cache/README.md | 11 +++++ Algorithms/0146.lru-cache/lru-cache.go | 2 + Algorithms/0146.lru-cache/lru-cache_test.go | 43 ++++++++++++++++++ Algorithms/0147.insertion-sort-list/README.md | 11 +++++ .../insertion-sort-list.go | 2 + .../insertion-sort-list_test.go | 43 ++++++++++++++++++ Algorithms/0148.sort-list/README.md | 11 +++++ Algorithms/0148.sort-list/sort-list.go | 2 + Algorithms/0148.sort-list/sort-list_test.go | 43 ++++++++++++++++++ .../0149.max-points-on-a-line/README.md | 11 +++++ .../max-points-on-a-line.go | 2 + .../max-points-on-a-line_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../evaluate-reverse-polish-notation.go | 2 + .../evaluate-reverse-polish-notation_test.go | 43 ++++++++++++++++++ .../0151.reverse-words-in-a-string/README.md | 11 +++++ .../reverse-words-in-a-string.go | 2 + .../reverse-words-in-a-string_test.go | 43 ++++++++++++++++++ .../0152.maximum-product-subarray/README.md | 11 +++++ .../maximum-product-subarray.go | 2 + .../maximum-product-subarray_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-minimum-in-rotated-sorted-array.go | 2 + ...nd-minimum-in-rotated-sorted-array_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...find-minimum-in-rotated-sorted-array-ii.go | 2 + ...minimum-in-rotated-sorted-array-ii_test.go | 43 ++++++++++++++++++ Algorithms/0155.min-stack/README.md | 11 +++++ Algorithms/0155.min-stack/min-stack.go | 2 + Algorithms/0155.min-stack/min-stack_test.go | 43 ++++++++++++++++++ .../0156.binary-tree-upside-down/README.md | 11 +++++ .../binary-tree-upside-down.go | 2 + .../binary-tree-upside-down_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../read-n-characters-given-read4.go | 2 + .../read-n-characters-given-read4_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ters-given-read4-ii-call-multiple-times.go | 2 + ...given-read4-ii-call-multiple-times_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ng-with-at-most-two-distinct-characters.go | 2 + ...th-at-most-two-distinct-characters_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../intersection-of-two-linked-lists.go | 2 + .../intersection-of-two-linked-lists_test.go | 43 ++++++++++++++++++ Algorithms/0161.one-edit-distance/README.md | 11 +++++ .../one-edit-distance.go | 2 + .../one-edit-distance_test.go | 43 ++++++++++++++++++ Algorithms/0162.find-peak-element/README.md | 11 +++++ .../find-peak-element.go | 2 + .../find-peak-element_test.go | 43 ++++++++++++++++++ Algorithms/0163.missing-ranges/README.md | 11 +++++ .../0163.missing-ranges/missing-ranges.go | 2 + .../missing-ranges_test.go | 43 ++++++++++++++++++ Algorithms/0164.maximum-gap/README.md | 11 +++++ Algorithms/0164.maximum-gap/maximum-gap.go | 2 + .../0164.maximum-gap/maximum-gap_test.go | 43 ++++++++++++++++++ .../0165.compare-version-numbers/README.md | 11 +++++ .../compare-version-numbers.go | 2 + .../compare-version-numbers_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../fraction-to-recurring-decimal.go | 2 + .../fraction-to-recurring-decimal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../two-sum-ii-input-array-is-sorted.go | 2 + .../two-sum-ii-input-array-is-sorted_test.go | 43 ++++++++++++++++++ .../0168.excel-sheet-column-title/README.md | 11 +++++ .../excel-sheet-column-title.go | 2 + .../excel-sheet-column-title_test.go | 43 ++++++++++++++++++ Algorithms/0169.majority-element/README.md | 11 +++++ .../0169.majority-element/majority-element.go | 2 + .../majority-element_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../two-sum-iii-data-structure-design.go | 2 + .../two-sum-iii-data-structure-design_test.go | 43 ++++++++++++++++++ .../0171.excel-sheet-column-number/README.md | 11 +++++ .../excel-sheet-column-number.go | 2 + .../excel-sheet-column-number_test.go | 43 ++++++++++++++++++ .../0172.factorial-trailing-zeroes/README.md | 11 +++++ .../factorial-trailing-zeroes.go | 2 + .../factorial-trailing-zeroes_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-search-tree-iterator.go | 2 + .../binary-search-tree-iterator_test.go | 43 ++++++++++++++++++ Algorithms/0174.dungeon-game/README.md | 11 +++++ Algorithms/0174.dungeon-game/dungeon-game.go | 2 + .../0174.dungeon-game/dungeon-game_test.go | 43 ++++++++++++++++++ Algorithms/0179.largest-number/README.md | 11 +++++ .../0179.largest-number/largest-number.go | 2 + .../largest-number_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../reverse-words-in-a-string-ii.go | 2 + .../reverse-words-in-a-string-ii_test.go | 43 ++++++++++++++++++ .../0187.repeated-dna-sequences/README.md | 11 +++++ .../repeated-dna-sequences.go | 2 + .../repeated-dna-sequences_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../best-time-to-buy-and-sell-stock-iv.go | 2 + ...best-time-to-buy-and-sell-stock-iv_test.go | 43 ++++++++++++++++++ Algorithms/0189.rotate-array/README.md | 11 +++++ Algorithms/0189.rotate-array/rotate-array.go | 2 + .../0189.rotate-array/rotate-array_test.go | 43 ++++++++++++++++++ Algorithms/0190.reverse-bits/README.md | 11 +++++ Algorithms/0190.reverse-bits/reverse-bits.go | 2 + .../0190.reverse-bits/reverse-bits_test.go | 43 ++++++++++++++++++ Algorithms/0191.number-of-1-bits/README.md | 11 +++++ .../0191.number-of-1-bits/number-of-1-bits.go | 2 + .../number-of-1-bits_test.go | 43 ++++++++++++++++++ Algorithms/0198.house-robber/README.md | 11 +++++ Algorithms/0198.house-robber/house-robber.go | 2 + .../0198.house-robber/house-robber_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-right-side-view.go | 2 + .../binary-tree-right-side-view_test.go | 43 ++++++++++++++++++ Algorithms/0200.number-of-islands/README.md | 11 +++++ .../number-of-islands.go | 2 + .../number-of-islands_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../bitwise-and-of-numbers-range.go | 2 + .../bitwise-and-of-numbers-range_test.go | 43 ++++++++++++++++++ Algorithms/0202.happy-number/README.md | 11 +++++ Algorithms/0202.happy-number/happy-number.go | 2 + .../0202.happy-number/happy-number_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../remove-linked-list-elements.go | 2 + .../remove-linked-list-elements_test.go | 43 ++++++++++++++++++ Algorithms/0204.count-primes/README.md | 11 +++++ Algorithms/0204.count-primes/count-primes.go | 2 + .../0204.count-primes/count-primes_test.go | 43 ++++++++++++++++++ Algorithms/0205.isomorphic-strings/README.md | 11 +++++ .../isomorphic-strings.go | 2 + .../isomorphic-strings_test.go | 43 ++++++++++++++++++ Algorithms/0206.reverse-linked-list/README.md | 11 +++++ .../reverse-linked-list.go | 2 + .../reverse-linked-list_test.go | 43 ++++++++++++++++++ Algorithms/0207.course-schedule/README.md | 11 +++++ .../0207.course-schedule/course-schedule.go | 2 + .../course-schedule_test.go | 43 ++++++++++++++++++ .../0208.implement-trie-prefix-tree/README.md | 11 +++++ .../implement-trie-prefix-tree.go | 2 + .../implement-trie-prefix-tree_test.go | 43 ++++++++++++++++++ .../0209.minimum-size-subarray-sum/README.md | 11 +++++ .../minimum-size-subarray-sum.go | 2 + .../minimum-size-subarray-sum_test.go | 43 ++++++++++++++++++ Algorithms/0210.course-schedule-ii/README.md | 11 +++++ .../course-schedule-ii.go | 2 + .../course-schedule-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...d-and-search-word-data-structure-design.go | 2 + ...-search-word-data-structure-design_test.go | 43 ++++++++++++++++++ Algorithms/0212.word-search-ii/README.md | 11 +++++ .../0212.word-search-ii/word-search-ii.go | 2 + .../word-search-ii_test.go | 43 ++++++++++++++++++ Algorithms/0213.house-robber-ii/README.md | 11 +++++ .../0213.house-robber-ii/house-robber-ii.go | 2 + .../house-robber-ii_test.go | 43 ++++++++++++++++++ Algorithms/0214.shortest-palindrome/README.md | 11 +++++ .../shortest-palindrome.go | 2 + .../shortest-palindrome_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../kth-largest-element-in-an-array.go | 2 + .../kth-largest-element-in-an-array_test.go | 43 ++++++++++++++++++ Algorithms/0216.combination-sum-iii/README.md | 11 +++++ .../combination-sum-iii.go | 2 + .../combination-sum-iii_test.go | 43 ++++++++++++++++++ Algorithms/0217.contains-duplicate/README.md | 11 +++++ .../contains-duplicate.go | 2 + .../contains-duplicate_test.go | 43 ++++++++++++++++++ Algorithms/0218.the-skyline-problem/README.md | 11 +++++ .../the-skyline-problem.go | 2 + .../the-skyline-problem_test.go | 43 ++++++++++++++++++ .../0219.contains-duplicate-ii/README.md | 11 +++++ .../contains-duplicate-ii.go | 2 + .../contains-duplicate-ii_test.go | 43 ++++++++++++++++++ .../0220.contains-duplicate-iii/README.md | 11 +++++ .../contains-duplicate-iii.go | 2 + .../contains-duplicate-iii_test.go | 43 ++++++++++++++++++ Algorithms/0221.maximal-square/README.md | 11 +++++ .../0221.maximal-square/maximal-square.go | 2 + .../maximal-square_test.go | 43 ++++++++++++++++++ .../0222.count-complete-tree-nodes/README.md | 11 +++++ .../count-complete-tree-nodes.go | 2 + .../count-complete-tree-nodes_test.go | 43 ++++++++++++++++++ Algorithms/0223.rectangle-area/README.md | 11 +++++ .../0223.rectangle-area/rectangle-area.go | 2 + .../rectangle-area_test.go | 43 ++++++++++++++++++ Algorithms/0224.basic-calculator/README.md | 11 +++++ .../0224.basic-calculator/basic-calculator.go | 2 + .../basic-calculator_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../implement-stack-using-queues.go | 2 + .../implement-stack-using-queues_test.go | 43 ++++++++++++++++++ Algorithms/0226.invert-binary-tree/README.md | 11 +++++ .../invert-binary-tree.go | 2 + .../invert-binary-tree_test.go | 43 ++++++++++++++++++ Algorithms/0227.basic-calculator-ii/README.md | 11 +++++ .../basic-calculator-ii.go | 2 + .../basic-calculator-ii_test.go | 43 ++++++++++++++++++ Algorithms/0228.summary-ranges/README.md | 11 +++++ .../0228.summary-ranges/summary-ranges.go | 2 + .../summary-ranges_test.go | 43 ++++++++++++++++++ Algorithms/0229.majority-element-ii/README.md | 11 +++++ .../majority-element-ii.go | 2 + .../majority-element-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../kth-smallest-element-in-a-bst.go | 2 + .../kth-smallest-element-in-a-bst_test.go | 43 ++++++++++++++++++ Algorithms/0231.power-of-two/README.md | 11 +++++ Algorithms/0231.power-of-two/power-of-two.go | 2 + .../0231.power-of-two/power-of-two_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../implement-queue-using-stacks.go | 2 + .../implement-queue-using-stacks_test.go | 43 ++++++++++++++++++ Algorithms/0233.number-of-digit-one/README.md | 11 +++++ .../number-of-digit-one.go | 2 + .../number-of-digit-one_test.go | 43 ++++++++++++++++++ .../0234.palindrome-linked-list/README.md | 11 +++++ .../palindrome-linked-list.go | 2 + .../palindrome-linked-list_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...common-ancestor-of-a-binary-search-tree.go | 2 + ...n-ancestor-of-a-binary-search-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...lowest-common-ancestor-of-a-binary-tree.go | 2 + ...t-common-ancestor-of-a-binary-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../delete-node-in-a-linked-list.go | 2 + .../delete-node-in-a-linked-list_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../product-of-array-except-self.go | 2 + .../product-of-array-except-self_test.go | 43 ++++++++++++++++++ .../0239.sliding-window-maximum/README.md | 11 +++++ .../sliding-window-maximum.go | 2 + .../sliding-window-maximum_test.go | 43 ++++++++++++++++++ .../0240.search-a-2d-matrix-ii/README.md | 11 +++++ .../search-a-2d-matrix-ii.go | 2 + .../search-a-2d-matrix-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../different-ways-to-add-parentheses.go | 2 + .../different-ways-to-add-parentheses_test.go | 43 ++++++++++++++++++ Algorithms/0242.valid-anagram/README.md | 11 +++++ .../0242.valid-anagram/valid-anagram.go | 2 + .../0242.valid-anagram/valid-anagram_test.go | 43 ++++++++++++++++++ .../0243.shortest-word-distance/README.md | 11 +++++ .../shortest-word-distance.go | 2 + .../shortest-word-distance_test.go | 43 ++++++++++++++++++ .../0244.shortest-word-distance-ii/README.md | 11 +++++ .../shortest-word-distance-ii.go | 2 + .../shortest-word-distance-ii_test.go | 43 ++++++++++++++++++ .../0245.shortest-word-distance-iii/README.md | 11 +++++ .../shortest-word-distance-iii.go | 2 + .../shortest-word-distance-iii_test.go | 43 ++++++++++++++++++ .../0246.strobogrammatic-number/README.md | 11 +++++ .../strobogrammatic-number.go | 2 + .../strobogrammatic-number_test.go | 43 ++++++++++++++++++ .../0247.strobogrammatic-number-ii/README.md | 11 +++++ .../strobogrammatic-number-ii.go | 2 + .../strobogrammatic-number-ii_test.go | 43 ++++++++++++++++++ .../0248.strobogrammatic-number-iii/README.md | 11 +++++ .../strobogrammatic-number-iii.go | 2 + .../strobogrammatic-number-iii_test.go | 43 ++++++++++++++++++ .../0249.group-shifted-strings/README.md | 11 +++++ .../group-shifted-strings.go | 2 + .../group-shifted-strings_test.go | 43 ++++++++++++++++++ .../0250.count-univalue-subtrees/README.md | 11 +++++ .../count-univalue-subtrees.go | 2 + .../count-univalue-subtrees_test.go | 43 ++++++++++++++++++ Algorithms/0251.flatten-2d-vector/README.md | 11 +++++ .../flatten-2d-vector.go | 2 + .../flatten-2d-vector_test.go | 43 ++++++++++++++++++ Algorithms/0252.meeting-rooms/README.md | 11 +++++ .../0252.meeting-rooms/meeting-rooms.go | 2 + .../0252.meeting-rooms/meeting-rooms_test.go | 43 ++++++++++++++++++ Algorithms/0253.meeting-rooms-ii/README.md | 11 +++++ .../0253.meeting-rooms-ii/meeting-rooms-ii.go | 2 + .../meeting-rooms-ii_test.go | 43 ++++++++++++++++++ Algorithms/0254.factor-combinations/README.md | 11 +++++ .../factor-combinations.go | 2 + .../factor-combinations_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...preorder-sequence-in-binary-search-tree.go | 2 + ...der-sequence-in-binary-search-tree_test.go | 43 ++++++++++++++++++ Algorithms/0256.paint-house/README.md | 11 +++++ Algorithms/0256.paint-house/paint-house.go | 2 + .../0256.paint-house/paint-house_test.go | 43 ++++++++++++++++++ Algorithms/0257.binary-tree-paths/README.md | 11 +++++ .../binary-tree-paths.go | 2 + .../binary-tree-paths_test.go | 43 ++++++++++++++++++ Algorithms/0258.add-digits/README.md | 11 +++++ Algorithms/0258.add-digits/add-digits.go | 2 + Algorithms/0258.add-digits/add-digits_test.go | 43 ++++++++++++++++++ Algorithms/0259.3sum-smaller/3sum-smaller.go | 2 + .../0259.3sum-smaller/3sum-smaller_test.go | 43 ++++++++++++++++++ Algorithms/0259.3sum-smaller/README.md | 11 +++++ Algorithms/0260.single-number-iii/README.md | 11 +++++ .../single-number-iii.go | 2 + .../single-number-iii_test.go | 43 ++++++++++++++++++ Algorithms/0261.graph-valid-tree/README.md | 11 +++++ .../0261.graph-valid-tree/graph-valid-tree.go | 2 + .../graph-valid-tree_test.go | 43 ++++++++++++++++++ Algorithms/0263.ugly-number/README.md | 11 +++++ Algorithms/0263.ugly-number/ugly-number.go | 2 + .../0263.ugly-number/ugly-number_test.go | 43 ++++++++++++++++++ Algorithms/0264.ugly-number-ii/README.md | 11 +++++ .../0264.ugly-number-ii/ugly-number-ii.go | 2 + .../ugly-number-ii_test.go | 43 ++++++++++++++++++ Algorithms/0265.paint-house-ii/README.md | 11 +++++ .../0265.paint-house-ii/paint-house-ii.go | 2 + .../paint-house-ii_test.go | 43 ++++++++++++++++++ .../0266.palindrome-permutation/README.md | 11 +++++ .../palindrome-permutation.go | 2 + .../palindrome-permutation_test.go | 43 ++++++++++++++++++ .../0267.palindrome-permutation-ii/README.md | 11 +++++ .../palindrome-permutation-ii.go | 2 + .../palindrome-permutation-ii_test.go | 43 ++++++++++++++++++ Algorithms/0268.missing-number/README.md | 11 +++++ .../0268.missing-number/missing-number.go | 2 + .../missing-number_test.go | 43 ++++++++++++++++++ Algorithms/0269.alien-dictionary/README.md | 11 +++++ .../0269.alien-dictionary/alien-dictionary.go | 2 + .../alien-dictionary_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../closest-binary-search-tree-value.go | 2 + .../closest-binary-search-tree-value_test.go | 43 ++++++++++++++++++ .../0271.encode-and-decode-strings/README.md | 11 +++++ .../encode-and-decode-strings.go | 2 + .../encode-and-decode-strings_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../closest-binary-search-tree-value-ii.go | 2 + ...losest-binary-search-tree-value-ii_test.go | 43 ++++++++++++++++++ .../0273.integer-to-english-words/README.md | 11 +++++ .../integer-to-english-words.go | 2 + .../integer-to-english-words_test.go | 43 ++++++++++++++++++ Algorithms/0274.h-index/README.md | 11 +++++ Algorithms/0274.h-index/h-index.go | 2 + Algorithms/0274.h-index/h-index_test.go | 43 ++++++++++++++++++ Algorithms/0275.h-index-ii/README.md | 11 +++++ Algorithms/0275.h-index-ii/h-index-ii.go | 2 + Algorithms/0275.h-index-ii/h-index-ii_test.go | 43 ++++++++++++++++++ Algorithms/0276.paint-fence/README.md | 11 +++++ Algorithms/0276.paint-fence/paint-fence.go | 2 + .../0276.paint-fence/paint-fence_test.go | 43 ++++++++++++++++++ Algorithms/0277.find-the-celebrity/README.md | 11 +++++ .../find-the-celebrity.go | 2 + .../find-the-celebrity_test.go | 43 ++++++++++++++++++ Algorithms/0278.first-bad-version/README.md | 11 +++++ .../first-bad-version.go | 2 + .../first-bad-version_test.go | 43 ++++++++++++++++++ Algorithms/0279.perfect-squares/README.md | 11 +++++ .../0279.perfect-squares/perfect-squares.go | 2 + .../perfect-squares_test.go | 43 ++++++++++++++++++ Algorithms/0280.wiggle-sort/README.md | 11 +++++ Algorithms/0280.wiggle-sort/wiggle-sort.go | 2 + .../0280.wiggle-sort/wiggle-sort_test.go | 43 ++++++++++++++++++ Algorithms/0281.zigzag-iterator/README.md | 11 +++++ .../0281.zigzag-iterator/zigzag-iterator.go | 2 + .../zigzag-iterator_test.go | 43 ++++++++++++++++++ .../0282.expression-add-operators/README.md | 11 +++++ .../expression-add-operators.go | 2 + .../expression-add-operators_test.go | 43 ++++++++++++++++++ Algorithms/0283.move-zeroes/README.md | 11 +++++ Algorithms/0283.move-zeroes/move-zeroes.go | 2 + .../0283.move-zeroes/move-zeroes_test.go | 43 ++++++++++++++++++ Algorithms/0284.peeking-iterator/README.md | 11 +++++ .../0284.peeking-iterator/peeking-iterator.go | 2 + .../peeking-iterator_test.go | 43 ++++++++++++++++++ .../0285.inorder-successor-in-bst/README.md | 11 +++++ .../inorder-successor-in-bst.go | 2 + .../inorder-successor-in-bst_test.go | 43 ++++++++++++++++++ Algorithms/0286.walls-and-gates/README.md | 11 +++++ .../0286.walls-and-gates/walls-and-gates.go | 2 + .../walls-and-gates_test.go | 43 ++++++++++++++++++ .../0287.find-the-duplicate-number/README.md | 11 +++++ .../find-the-duplicate-number.go | 2 + .../find-the-duplicate-number_test.go | 43 ++++++++++++++++++ .../0288.unique-word-abbreviation/README.md | 11 +++++ .../unique-word-abbreviation.go | 2 + .../unique-word-abbreviation_test.go | 43 ++++++++++++++++++ Algorithms/0289.game-of-life/README.md | 11 +++++ Algorithms/0289.game-of-life/game-of-life.go | 2 + .../0289.game-of-life/game-of-life_test.go | 43 ++++++++++++++++++ Algorithms/0290.word-pattern/README.md | 11 +++++ Algorithms/0290.word-pattern/word-pattern.go | 2 + .../0290.word-pattern/word-pattern_test.go | 43 ++++++++++++++++++ Algorithms/0291.word-pattern-ii/README.md | 11 +++++ .../0291.word-pattern-ii/word-pattern-ii.go | 2 + .../word-pattern-ii_test.go | 43 ++++++++++++++++++ Algorithms/0292.nim-game/README.md | 11 +++++ Algorithms/0292.nim-game/nim-game.go | 2 + Algorithms/0292.nim-game/nim-game_test.go | 43 ++++++++++++++++++ Algorithms/0293.flip-game/README.md | 11 +++++ Algorithms/0293.flip-game/flip-game.go | 2 + Algorithms/0293.flip-game/flip-game_test.go | 43 ++++++++++++++++++ Algorithms/0294.flip-game-ii/README.md | 11 +++++ Algorithms/0294.flip-game-ii/flip-game-ii.go | 2 + .../0294.flip-game-ii/flip-game-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-median-from-data-stream.go | 2 + .../find-median-from-data-stream_test.go | 43 ++++++++++++++++++ Algorithms/0296.best-meeting-point/README.md | 11 +++++ .../best-meeting-point.go | 2 + .../best-meeting-point_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../serialize-and-deserialize-binary-tree.go | 2 + ...ialize-and-deserialize-binary-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...inary-tree-longest-consecutive-sequence.go | 2 + ...-tree-longest-consecutive-sequence_test.go | 43 ++++++++++++++++++ Algorithms/0299.bulls-and-cows/README.md | 11 +++++ .../0299.bulls-and-cows/bulls-and-cows.go | 2 + .../bulls-and-cows_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../longest-increasing-subsequence.go | 2 + .../longest-increasing-subsequence_test.go | 43 ++++++++++++++++++ .../0301.remove-invalid-parentheses/README.md | 11 +++++ .../remove-invalid-parentheses.go | 2 + .../remove-invalid-parentheses_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...allest-rectangle-enclosing-black-pixels.go | 2 + ...t-rectangle-enclosing-black-pixels_test.go | 43 ++++++++++++++++++ .../0303.range-sum-query-immutable/README.md | 11 +++++ .../range-sum-query-immutable.go | 2 + .../range-sum-query-immutable_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../range-sum-query-2d-immutable.go | 2 + .../range-sum-query-2d-immutable_test.go | 43 ++++++++++++++++++ .../0305.number-of-islands-ii/README.md | 11 +++++ .../number-of-islands-ii.go | 2 + .../number-of-islands-ii_test.go | 43 ++++++++++++++++++ Algorithms/0306.additive-number/README.md | 11 +++++ .../0306.additive-number/additive-number.go | 2 + .../additive-number_test.go | 43 ++++++++++++++++++ .../0307.range-sum-query-mutable/README.md | 11 +++++ .../range-sum-query-mutable.go | 2 + .../range-sum-query-mutable_test.go | 43 ++++++++++++++++++ .../0308.range-sum-query-2d-mutable/README.md | 11 +++++ .../range-sum-query-2d-mutable.go | 2 + .../range-sum-query-2d-mutable_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ime-to-buy-and-sell-stock-with-cooldown.go | 2 + ...o-buy-and-sell-stock-with-cooldown_test.go | 43 ++++++++++++++++++ .../0310.minimum-height-trees/README.md | 11 +++++ .../minimum-height-trees.go | 2 + .../minimum-height-trees_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../sparse-matrix-multiplication.go | 2 + .../sparse-matrix-multiplication_test.go | 43 ++++++++++++++++++ Algorithms/0312.burst-balloons/README.md | 11 +++++ .../0312.burst-balloons/burst-balloons.go | 2 + .../burst-balloons_test.go | 43 ++++++++++++++++++ Algorithms/0313.super-ugly-number/README.md | 11 +++++ .../super-ugly-number.go | 2 + .../super-ugly-number_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../binary-tree-vertical-order-traversal.go | 2 + ...nary-tree-vertical-order-traversal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../count-of-smaller-numbers-after-self.go | 2 + ...ount-of-smaller-numbers-after-self_test.go | 43 ++++++++++++++++++ .../0316.remove-duplicate-letters/README.md | 11 +++++ .../remove-duplicate-letters.go | 2 + .../remove-duplicate-letters_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../shortest-distance-from-all-buildings.go | 2 + ...ortest-distance-from-all-buildings_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../maximum-product-of-word-lengths.go | 2 + .../maximum-product-of-word-lengths_test.go | 43 ++++++++++++++++++ Algorithms/0319.bulb-switcher/README.md | 11 +++++ .../0319.bulb-switcher/bulb-switcher.go | 2 + .../0319.bulb-switcher/bulb-switcher_test.go | 43 ++++++++++++++++++ .../0320.generalized-abbreviation/README.md | 11 +++++ .../generalized-abbreviation.go | 2 + .../generalized-abbreviation_test.go | 43 ++++++++++++++++++ .../0321.create-maximum-number/README.md | 11 +++++ .../create-maximum-number.go | 2 + .../create-maximum-number_test.go | 43 ++++++++++++++++++ Algorithms/0322.coin-change/README.md | 11 +++++ Algorithms/0322.coin-change/coin-change.go | 2 + .../0322.coin-change/coin-change_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ected-components-in-an-undirected-graph.go | 2 + ...-components-in-an-undirected-graph_test.go | 43 ++++++++++++++++++ Algorithms/0324.wiggle-sort-ii/README.md | 11 +++++ .../0324.wiggle-sort-ii/wiggle-sort-ii.go | 2 + .../wiggle-sort-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../maximum-size-subarray-sum-equals-k.go | 2 + ...maximum-size-subarray-sum-equals-k_test.go | 43 ++++++++++++++++++ Algorithms/0326.power-of-three/README.md | 11 +++++ .../0326.power-of-three/power-of-three.go | 2 + .../power-of-three_test.go | 43 ++++++++++++++++++ Algorithms/0327.count-of-range-sum/README.md | 11 +++++ .../count-of-range-sum.go | 2 + .../count-of-range-sum_test.go | 43 ++++++++++++++++++ .../0328.odd-even-linked-list/README.md | 11 +++++ .../odd-even-linked-list.go | 2 + .../odd-even-linked-list_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../longest-increasing-path-in-a-matrix.go | 2 + ...ongest-increasing-path-in-a-matrix_test.go | 43 ++++++++++++++++++ Algorithms/0330.patching-array/README.md | 11 +++++ .../0330.patching-array/patching-array.go | 2 + .../patching-array_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...preorder-serialization-of-a-binary-tree.go | 2 + ...der-serialization-of-a-binary-tree_test.go | 43 ++++++++++++++++++ .../0332.reconstruct-itinerary/README.md | 11 +++++ .../reconstruct-itinerary.go | 2 + .../reconstruct-itinerary_test.go | 43 ++++++++++++++++++ Algorithms/0333.largest-bst-subtree/README.md | 11 +++++ .../largest-bst-subtree.go | 2 + .../largest-bst-subtree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../increasing-triplet-subsequence.go | 2 + .../increasing-triplet-subsequence_test.go | 43 ++++++++++++++++++ Algorithms/0335.self-crossing/README.md | 11 +++++ .../0335.self-crossing/self-crossing.go | 2 + .../0335.self-crossing/self-crossing_test.go | 43 ++++++++++++++++++ Algorithms/0336.palindrome-pairs/README.md | 11 +++++ .../0336.palindrome-pairs/palindrome-pairs.go | 2 + .../palindrome-pairs_test.go | 43 ++++++++++++++++++ Algorithms/0337.house-robber-iii/README.md | 11 +++++ .../0337.house-robber-iii/house-robber-iii.go | 2 + .../house-robber-iii_test.go | 43 ++++++++++++++++++ Algorithms/0338.counting-bits/README.md | 11 +++++ .../0338.counting-bits/counting-bits.go | 2 + .../0338.counting-bits/counting-bits_test.go | 43 ++++++++++++++++++ .../0339.nested-list-weight-sum/README.md | 11 +++++ .../nested-list-weight-sum.go | 2 + .../nested-list-weight-sum_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ring-with-at-most-k-distinct-characters.go | 2 + ...with-at-most-k-distinct-characters_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../flatten-nested-list-iterator.go | 2 + .../flatten-nested-list-iterator_test.go | 43 ++++++++++++++++++ Algorithms/0342.power-of-four/README.md | 11 +++++ .../0342.power-of-four/power-of-four.go | 2 + .../0342.power-of-four/power-of-four_test.go | 43 ++++++++++++++++++ Algorithms/0343.integer-break/README.md | 11 +++++ .../0343.integer-break/integer-break.go | 2 + .../0343.integer-break/integer-break_test.go | 43 ++++++++++++++++++ Algorithms/0344.reverse-string/README.md | 11 +++++ .../0344.reverse-string/reverse-string.go | 2 + .../reverse-string_test.go | 43 ++++++++++++++++++ .../0345.reverse-vowels-of-a-string/README.md | 11 +++++ .../reverse-vowels-of-a-string.go | 2 + .../reverse-vowels-of-a-string_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../moving-average-from-data-stream.go | 2 + .../moving-average-from-data-stream_test.go | 43 ++++++++++++++++++ .../0347.top-k-frequent-elements/README.md | 11 +++++ .../top-k-frequent-elements.go | 2 + .../top-k-frequent-elements_test.go | 43 ++++++++++++++++++ Algorithms/0348.design-tic-tac-toe/README.md | 11 +++++ .../design-tic-tac-toe.go | 2 + .../design-tic-tac-toe_test.go | 43 ++++++++++++++++++ .../0349.intersection-of-two-arrays/README.md | 11 +++++ .../intersection-of-two-arrays.go | 2 + .../intersection-of-two-arrays_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../intersection-of-two-arrays-ii.go | 2 + .../intersection-of-two-arrays-ii_test.go | 43 ++++++++++++++++++ .../0351.android-unlock-patterns/README.md | 11 +++++ .../android-unlock-patterns.go | 2 + .../android-unlock-patterns_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../data-stream-as-disjoint-intervals.go | 2 + .../data-stream-as-disjoint-intervals_test.go | 43 ++++++++++++++++++ Algorithms/0353.design-snake-game/README.md | 11 +++++ .../design-snake-game.go | 2 + .../design-snake-game_test.go | 43 ++++++++++++++++++ .../0354.russian-doll-envelopes/README.md | 11 +++++ .../russian-doll-envelopes.go | 2 + .../russian-doll-envelopes_test.go | 43 ++++++++++++++++++ Algorithms/0355.design-twitter/README.md | 11 +++++ .../0355.design-twitter/design-twitter.go | 2 + .../design-twitter_test.go | 43 ++++++++++++++++++ Algorithms/0356.line-reflection/README.md | 11 +++++ .../0356.line-reflection/line-reflection.go | 2 + .../line-reflection_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../count-numbers-with-unique-digits.go | 2 + .../count-numbers-with-unique-digits_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../rearrange-string-k-distance-apart.go | 2 + .../rearrange-string-k-distance-apart_test.go | 43 ++++++++++++++++++ Algorithms/0359.logger-rate-limiter/README.md | 11 +++++ .../logger-rate-limiter.go | 2 + .../logger-rate-limiter_test.go | 43 ++++++++++++++++++ .../0360.sort-transformed-array/README.md | 11 +++++ .../sort-transformed-array.go | 2 + .../sort-transformed-array_test.go | 43 ++++++++++++++++++ Algorithms/0361.bomb-enemy/README.md | 11 +++++ Algorithms/0361.bomb-enemy/bomb-enemy.go | 2 + Algorithms/0361.bomb-enemy/bomb-enemy_test.go | 43 ++++++++++++++++++ Algorithms/0362.design-hit-counter/README.md | 11 +++++ .../design-hit-counter.go | 2 + .../design-hit-counter_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../max-sum-of-rectangle-no-larger-than-k.go | 2 + ...-sum-of-rectangle-no-larger-than-k_test.go | 43 ++++++++++++++++++ .../0364.nested-list-weight-sum-ii/README.md | 11 +++++ .../nested-list-weight-sum-ii.go | 2 + .../nested-list-weight-sum-ii_test.go | 43 ++++++++++++++++++ .../0365.water-and-jug-problem/README.md | 11 +++++ .../water-and-jug-problem.go | 2 + .../water-and-jug-problem_test.go | 43 ++++++++++++++++++ .../0366.find-leaves-of-binary-tree/README.md | 11 +++++ .../find-leaves-of-binary-tree.go | 2 + .../find-leaves-of-binary-tree_test.go | 43 ++++++++++++++++++ .../0367.valid-perfect-square/README.md | 11 +++++ .../valid-perfect-square.go | 2 + .../valid-perfect-square_test.go | 43 ++++++++++++++++++ .../0368.largest-divisible-subset/README.md | 11 +++++ .../largest-divisible-subset.go | 2 + .../largest-divisible-subset_test.go | 43 ++++++++++++++++++ .../0369.plus-one-linked-list/README.md | 11 +++++ .../plus-one-linked-list.go | 2 + .../plus-one-linked-list_test.go | 43 ++++++++++++++++++ Algorithms/0370.range-addition/README.md | 11 +++++ .../0370.range-addition/range-addition.go | 2 + .../range-addition_test.go | 43 ++++++++++++++++++ Algorithms/0371.sum-of-two-integers/README.md | 11 +++++ .../sum-of-two-integers.go | 2 + .../sum-of-two-integers_test.go | 43 ++++++++++++++++++ Algorithms/0372.super-pow/README.md | 11 +++++ Algorithms/0372.super-pow/super-pow.go | 2 + Algorithms/0372.super-pow/super-pow_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-k-pairs-with-smallest-sums.go | 2 + .../find-k-pairs-with-smallest-sums_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../guess-number-higher-or-lower.go | 2 + .../guess-number-higher-or-lower_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../guess-number-higher-or-lower-ii.go | 2 + .../guess-number-higher-or-lower-ii_test.go | 43 ++++++++++++++++++ Algorithms/0376.wiggle-subsequence/README.md | 11 +++++ .../wiggle-subsequence.go | 2 + .../wiggle-subsequence_test.go | 43 ++++++++++++++++++ Algorithms/0377.combination-sum-iv/README.md | 11 +++++ .../combination-sum-iv.go | 2 + .../combination-sum-iv_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...kth-smallest-element-in-a-sorted-matrix.go | 2 + ...mallest-element-in-a-sorted-matrix_test.go | 43 ++++++++++++++++++ .../0379.design-phone-directory/README.md | 11 +++++ .../design-phone-directory.go | 2 + .../design-phone-directory_test.go | 43 ++++++++++++++++++ .../0380.insert-delete-getrandom-o1/README.md | 11 +++++ .../insert-delete-getrandom-o1.go | 2 + .../insert-delete-getrandom-o1_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...-delete-getrandom-o1-duplicates-allowed.go | 2 + ...te-getrandom-o1-duplicates-allowed_test.go | 43 ++++++++++++++++++ .../0382.linked-list-random-node/README.md | 11 +++++ .../linked-list-random-node.go | 2 + .../linked-list-random-node_test.go | 43 ++++++++++++++++++ Algorithms/0383.ransom-note/README.md | 11 +++++ Algorithms/0383.ransom-note/ransom-note.go | 2 + .../0383.ransom-note/ransom-note_test.go | 43 ++++++++++++++++++ Algorithms/0384.shuffle-an-array/README.md | 11 +++++ .../0384.shuffle-an-array/shuffle-an-array.go | 2 + .../shuffle-an-array_test.go | 43 ++++++++++++++++++ Algorithms/0385.mini-parser/README.md | 11 +++++ Algorithms/0385.mini-parser/mini-parser.go | 2 + .../0385.mini-parser/mini-parser_test.go | 43 ++++++++++++++++++ .../0386.lexicographical-numbers/README.md | 11 +++++ .../lexicographical-numbers.go | 2 + .../lexicographical-numbers_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../first-unique-character-in-a-string.go | 2 + ...first-unique-character-in-a-string_test.go | 43 ++++++++++++++++++ .../0388.longest-absolute-file-path/README.md | 11 +++++ .../longest-absolute-file-path.go | 2 + .../longest-absolute-file-path_test.go | 43 ++++++++++++++++++ Algorithms/0389.find-the-difference/README.md | 11 +++++ .../find-the-difference.go | 2 + .../find-the-difference_test.go | 43 ++++++++++++++++++ Algorithms/0390.elimination-game/README.md | 11 +++++ .../0390.elimination-game/elimination-game.go | 2 + .../elimination-game_test.go | 43 ++++++++++++++++++ Algorithms/0391.perfect-rectangle/README.md | 11 +++++ .../perfect-rectangle.go | 2 + .../perfect-rectangle_test.go | 43 ++++++++++++++++++ Algorithms/0392.is-subsequence/README.md | 11 +++++ .../0392.is-subsequence/is-subsequence.go | 2 + .../is-subsequence_test.go | 43 ++++++++++++++++++ Algorithms/0393.utf-8-validation/README.md | 11 +++++ .../0393.utf-8-validation/utf-8-validation.go | 2 + .../utf-8-validation_test.go | 43 ++++++++++++++++++ Algorithms/0394.decode-string/README.md | 11 +++++ .../0394.decode-string/decode-string.go | 2 + .../0394.decode-string/decode-string_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ng-with-at-least-k-repeating-characters.go | 2 + ...th-at-least-k-repeating-characters_test.go | 43 ++++++++++++++++++ Algorithms/0396.rotate-function/README.md | 11 +++++ .../0396.rotate-function/rotate-function.go | 2 + .../rotate-function_test.go | 43 ++++++++++++++++++ Algorithms/0397.integer-replacement/README.md | 11 +++++ .../integer-replacement.go | 2 + .../integer-replacement_test.go | 43 ++++++++++++++++++ Algorithms/0398.random-pick-index/README.md | 11 +++++ .../random-pick-index.go | 2 + .../random-pick-index_test.go | 43 ++++++++++++++++++ Algorithms/0399.evaluate-division/README.md | 11 +++++ .../evaluate-division.go | 2 + .../evaluate-division_test.go | 43 ++++++++++++++++++ Algorithms/0400.nth-digit/README.md | 11 +++++ Algorithms/0400.nth-digit/nth-digit.go | 2 + Algorithms/0400.nth-digit/nth-digit_test.go | 43 ++++++++++++++++++ Algorithms/0401.binary-watch/README.md | 11 +++++ Algorithms/0401.binary-watch/binary-watch.go | 2 + .../0401.binary-watch/binary-watch_test.go | 43 ++++++++++++++++++ Algorithms/0402.remove-k-digits/README.md | 11 +++++ .../0402.remove-k-digits/remove-k-digits.go | 2 + .../remove-k-digits_test.go | 43 ++++++++++++++++++ Algorithms/0403.frog-jump/README.md | 11 +++++ Algorithms/0403.frog-jump/frog-jump.go | 2 + Algorithms/0403.frog-jump/frog-jump_test.go | 43 ++++++++++++++++++ Algorithms/0404.sum-of-left-leaves/README.md | 11 +++++ .../sum-of-left-leaves.go | 2 + .../sum-of-left-leaves_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../convert-a-number-to-hexadecimal.go | 2 + .../convert-a-number-to-hexadecimal_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../queue-reconstruction-by-height.go | 2 + .../queue-reconstruction-by-height_test.go | 43 ++++++++++++++++++ .../0407.trapping-rain-water-ii/README.md | 11 +++++ .../trapping-rain-water-ii.go | 2 + .../trapping-rain-water-ii_test.go | 43 ++++++++++++++++++ .../0408.valid-word-abbreviation/README.md | 11 +++++ .../valid-word-abbreviation.go | 2 + .../valid-word-abbreviation_test.go | 43 ++++++++++++++++++ Algorithms/0409.longest-palindrome/README.md | 11 +++++ .../longest-palindrome.go | 2 + .../longest-palindrome_test.go | 43 ++++++++++++++++++ .../0410.split-array-largest-sum/README.md | 11 +++++ .../split-array-largest-sum.go | 2 + .../split-array-largest-sum_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../minimum-unique-word-abbreviation.go | 2 + .../minimum-unique-word-abbreviation_test.go | 43 ++++++++++++++++++ Algorithms/0412.fizz-buzz/README.md | 11 +++++ Algorithms/0412.fizz-buzz/fizz-buzz.go | 2 + Algorithms/0412.fizz-buzz/fizz-buzz_test.go | 43 ++++++++++++++++++ Algorithms/0413.arithmetic-slices/README.md | 11 +++++ .../arithmetic-slices.go | 2 + .../arithmetic-slices_test.go | 43 ++++++++++++++++++ .../0414.third-maximum-number/README.md | 11 +++++ .../third-maximum-number.go | 2 + .../third-maximum-number_test.go | 43 ++++++++++++++++++ Algorithms/0415.add-strings/README.md | 11 +++++ Algorithms/0415.add-strings/add-strings.go | 2 + .../0415.add-strings/add-strings_test.go | 43 ++++++++++++++++++ .../0416.partition-equal-subset-sum/README.md | 11 +++++ .../partition-equal-subset-sum.go | 2 + .../partition-equal-subset-sum_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../pacific-atlantic-water-flow.go | 2 + .../pacific-atlantic-water-flow_test.go | 43 ++++++++++++++++++ .../0418.sentence-screen-fitting/README.md | 11 +++++ .../sentence-screen-fitting.go | 2 + .../sentence-screen-fitting_test.go | 43 ++++++++++++++++++ .../0419.battleships-in-a-board/README.md | 11 +++++ .../battleships-in-a-board.go | 2 + .../battleships-in-a-board_test.go | 43 ++++++++++++++++++ .../0420.strong-password-checker/README.md | 11 +++++ .../strong-password-checker.go | 2 + .../strong-password-checker_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../maximum-xor-of-two-numbers-in-an-array.go | 2 + ...mum-xor-of-two-numbers-in-an-array_test.go | 43 ++++++++++++++++++ Algorithms/0422.valid-word-square/README.md | 11 +++++ .../valid-word-square.go | 2 + .../valid-word-square_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...econstruct-original-digits-from-english.go | 2 + ...truct-original-digits-from-english_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...longest-repeating-character-replacement.go | 2 + ...st-repeating-character-replacement_test.go | 43 ++++++++++++++++++ Algorithms/0425.word-squares/README.md | 11 +++++ Algorithms/0425.word-squares/word-squares.go | 2 + .../0425.word-squares/word-squares_test.go | 43 ++++++++++++++++++ .../0432.all-oone-data-structure/README.md | 11 +++++ .../all-oone-data-structure.go | 2 + .../all-oone-data-structure_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../number-of-segments-in-a-string.go | 2 + .../number-of-segments-in-a-string_test.go | 43 ++++++++++++++++++ .../0435.non-overlapping-intervals/README.md | 11 +++++ .../non-overlapping-intervals.go | 2 + .../non-overlapping-intervals_test.go | 43 ++++++++++++++++++ Algorithms/0436.find-right-interval/README.md | 11 +++++ .../find-right-interval.go | 2 + .../find-right-interval_test.go | 43 ++++++++++++++++++ Algorithms/0437.path-sum-iii/README.md | 11 +++++ Algorithms/0437.path-sum-iii/path-sum-iii.go | 2 + .../0437.path-sum-iii/path-sum-iii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-all-anagrams-in-a-string.go | 2 + .../find-all-anagrams-in-a-string_test.go | 43 ++++++++++++++++++ .../0439.ternary-expression-parser/README.md | 11 +++++ .../ternary-expression-parser.go | 2 + .../ternary-expression-parser_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../k-th-smallest-in-lexicographical-order.go | 2 + ...-smallest-in-lexicographical-order_test.go | 43 ++++++++++++++++++ Algorithms/0441.arranging-coins/README.md | 11 +++++ .../0441.arranging-coins/arranging-coins.go | 2 + .../arranging-coins_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-all-duplicates-in-an-array.go | 2 + .../find-all-duplicates-in-an-array_test.go | 43 ++++++++++++++++++ .../0444.sequence-reconstruction/README.md | 11 +++++ .../sequence-reconstruction.go | 2 + .../sequence-reconstruction_test.go | 43 ++++++++++++++++++ Algorithms/0445.add-two-numbers-ii/README.md | 11 +++++ .../add-two-numbers-ii.go | 2 + .../add-two-numbers-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../arithmetic-slices-ii-subsequence.go | 2 + .../arithmetic-slices-ii-subsequence_test.go | 43 ++++++++++++++++++ .../0447.number-of-boomerangs/README.md | 11 +++++ .../number-of-boomerangs.go | 2 + .../number-of-boomerangs_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ind-all-numbers-disappeared-in-an-array.go | 2 + ...ll-numbers-disappeared-in-an-array_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../serialize-and-deserialize-bst.go | 2 + .../serialize-and-deserialize-bst_test.go | 43 ++++++++++++++++++ .../0450.delete-node-in-a-bst/README.md | 11 +++++ .../delete-node-in-a-bst.go | 2 + .../delete-node-in-a-bst_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../sort-characters-by-frequency.go | 2 + .../sort-characters-by-frequency_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...imum-number-of-arrows-to-burst-balloons.go | 2 + ...number-of-arrows-to-burst-balloons_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../minimum-moves-to-equal-array-elements.go | 2 + ...imum-moves-to-equal-array-elements_test.go | 43 ++++++++++++++++++ Algorithms/0454.4sum-ii/4sum-ii.go | 2 + Algorithms/0454.4sum-ii/4sum-ii_test.go | 43 ++++++++++++++++++ Algorithms/0454.4sum-ii/README.md | 11 +++++ Algorithms/0455.assign-cookies/README.md | 11 +++++ .../0455.assign-cookies/assign-cookies.go | 2 + .../assign-cookies_test.go | 43 ++++++++++++++++++ Algorithms/0456.132-pattern/132-pattern.go | 2 + .../0456.132-pattern/132-pattern_test.go | 43 ++++++++++++++++++ Algorithms/0456.132-pattern/README.md | 11 +++++ .../0459.repeated-substring-pattern/README.md | 11 +++++ .../repeated-substring-pattern.go | 2 + .../repeated-substring-pattern_test.go | 43 ++++++++++++++++++ Algorithms/0460.lfu-cache/README.md | 11 +++++ Algorithms/0460.lfu-cache/lfu-cache.go | 2 + Algorithms/0460.lfu-cache/lfu-cache_test.go | 43 ++++++++++++++++++ Algorithms/0461.hamming-distance/README.md | 11 +++++ .../0461.hamming-distance/hamming-distance.go | 2 + .../hamming-distance_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...inimum-moves-to-equal-array-elements-ii.go | 2 + ...m-moves-to-equal-array-elements-ii_test.go | 43 ++++++++++++++++++ Algorithms/0463.island-perimeter/README.md | 11 +++++ .../0463.island-perimeter/island-perimeter.go | 2 + .../island-perimeter_test.go | 43 ++++++++++++++++++ Algorithms/0464.can-i-win/README.md | 11 +++++ Algorithms/0464.can-i-win/can-i-win.go | 2 + Algorithms/0464.can-i-win/can-i-win_test.go | 43 ++++++++++++++++++ .../0465.optimal-account-balancing/README.md | 11 +++++ .../optimal-account-balancing.go | 2 + .../optimal-account-balancing_test.go | 43 ++++++++++++++++++ .../0466.count-the-repetitions/README.md | 11 +++++ .../count-the-repetitions.go | 2 + .../count-the-repetitions_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../unique-substrings-in-wraparound-string.go | 2 + ...ue-substrings-in-wraparound-string_test.go | 43 ++++++++++++++++++ Algorithms/0468.validate-ip-address/README.md | 11 +++++ .../validate-ip-address.go | 2 + .../validate-ip-address_test.go | 43 ++++++++++++++++++ Algorithms/0469.convex-polygon/README.md | 11 +++++ .../0469.convex-polygon/convex-polygon.go | 2 + .../convex-polygon_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../encode-string-with-shortest-length.go | 2 + ...encode-string-with-shortest-length_test.go | 43 ++++++++++++++++++ Algorithms/0472.concatenated-words/README.md | 11 +++++ .../concatenated-words.go | 2 + .../concatenated-words_test.go | 43 ++++++++++++++++++ .../0473.matchsticks-to-square/README.md | 11 +++++ .../matchsticks-to-square.go | 2 + .../matchsticks-to-square_test.go | 43 ++++++++++++++++++ Algorithms/0474.ones-and-zeroes/README.md | 11 +++++ .../0474.ones-and-zeroes/ones-and-zeroes.go | 2 + .../ones-and-zeroes_test.go | 43 ++++++++++++++++++ Algorithms/0475.heaters/README.md | 11 +++++ Algorithms/0475.heaters/heaters.go | 2 + Algorithms/0475.heaters/heaters_test.go | 43 ++++++++++++++++++ Algorithms/0476.number-complement/README.md | 11 +++++ .../number-complement.go | 2 + .../number-complement_test.go | 43 ++++++++++++++++++ .../0477.total-hamming-distance/README.md | 11 +++++ .../total-hamming-distance.go | 2 + .../total-hamming-distance_test.go | 43 ++++++++++++++++++ .../0479.largest-palindrome-product/README.md | 11 +++++ .../largest-palindrome-product.go | 2 + .../largest-palindrome-product_test.go | 43 ++++++++++++++++++ .../0480.sliding-window-median/README.md | 11 +++++ .../sliding-window-median.go | 2 + .../sliding-window-median_test.go | 43 ++++++++++++++++++ Algorithms/0481.magical-string/README.md | 11 +++++ .../0481.magical-string/magical-string.go | 2 + .../magical-string_test.go | 43 ++++++++++++++++++ .../0482.license-key-formatting/README.md | 11 +++++ .../license-key-formatting.go | 2 + .../license-key-formatting_test.go | 43 ++++++++++++++++++ Algorithms/0483.smallest-good-base/README.md | 11 +++++ .../smallest-good-base.go | 2 + .../smallest-good-base_test.go | 43 ++++++++++++++++++ Algorithms/0484.find-permutation/README.md | 11 +++++ .../0484.find-permutation/find-permutation.go | 2 + .../find-permutation_test.go | 43 ++++++++++++++++++ .../0485.max-consecutive-ones/README.md | 11 +++++ .../max-consecutive-ones.go | 2 + .../max-consecutive-ones_test.go | 43 ++++++++++++++++++ Algorithms/0486.predict-the-winner/README.md | 11 +++++ .../predict-the-winner.go | 2 + .../predict-the-winner_test.go | 43 ++++++++++++++++++ .../0487.max-consecutive-ones-ii/README.md | 11 +++++ .../max-consecutive-ones-ii.go | 2 + .../max-consecutive-ones-ii_test.go | 43 ++++++++++++++++++ Algorithms/0488.zuma-game/README.md | 11 +++++ Algorithms/0488.zuma-game/zuma-game.go | 2 + Algorithms/0488.zuma-game/zuma-game_test.go | 43 ++++++++++++++++++ Algorithms/0490.the-maze/README.md | 11 +++++ Algorithms/0490.the-maze/the-maze.go | 2 + Algorithms/0490.the-maze/the-maze_test.go | 43 ++++++++++++++++++ .../0491.increasing-subsequences/README.md | 11 +++++ .../increasing-subsequences.go | 2 + .../increasing-subsequences_test.go | 43 ++++++++++++++++++ .../0492.construct-the-rectangle/README.md | 11 +++++ .../construct-the-rectangle.go | 2 + .../construct-the-rectangle_test.go | 43 ++++++++++++++++++ Algorithms/0493.reverse-pairs/README.md | 11 +++++ .../0493.reverse-pairs/reverse-pairs.go | 2 + .../0493.reverse-pairs/reverse-pairs_test.go | 43 ++++++++++++++++++ Algorithms/0494.target-sum/README.md | 11 +++++ Algorithms/0494.target-sum/target-sum.go | 2 + Algorithms/0494.target-sum/target-sum_test.go | 43 ++++++++++++++++++ Algorithms/0495.teemo-attacking/README.md | 11 +++++ .../0495.teemo-attacking/teemo-attacking.go | 2 + .../teemo-attacking_test.go | 43 ++++++++++++++++++ .../0496.next-greater-element-i/README.md | 11 +++++ .../next-greater-element-i.go | 2 + .../next-greater-element-i_test.go | 43 ++++++++++++++++++ Algorithms/0498.diagonal-traverse/README.md | 11 +++++ .../diagonal-traverse.go | 2 + .../diagonal-traverse_test.go | 43 ++++++++++++++++++ Algorithms/0499.the-maze-iii/README.md | 11 +++++ Algorithms/0499.the-maze-iii/the-maze-iii.go | 2 + .../0499.the-maze-iii/the-maze-iii_test.go | 43 ++++++++++++++++++ Algorithms/0500.keyboard-row/README.md | 11 +++++ Algorithms/0500.keyboard-row/keyboard-row.go | 2 + .../0500.keyboard-row/keyboard-row_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-mode-in-binary-search-tree.go | 2 + .../find-mode-in-binary-search-tree_test.go | 43 ++++++++++++++++++ Algorithms/0502.ipo/README.md | 11 +++++ Algorithms/0502.ipo/ipo.go | 2 + Algorithms/0502.ipo/ipo_test.go | 43 ++++++++++++++++++ .../0503.next-greater-element-ii/README.md | 11 +++++ .../next-greater-element-ii.go | 2 + .../next-greater-element-ii_test.go | 43 ++++++++++++++++++ Algorithms/0504.base-7/README.md | 11 +++++ Algorithms/0504.base-7/base-7.go | 2 + Algorithms/0504.base-7/base-7_test.go | 43 ++++++++++++++++++ Algorithms/0505.the-maze-ii/README.md | 11 +++++ Algorithms/0505.the-maze-ii/the-maze-ii.go | 2 + .../0505.the-maze-ii/the-maze-ii_test.go | 43 ++++++++++++++++++ Algorithms/0506.relative-ranks/README.md | 11 +++++ .../0506.relative-ranks/relative-ranks.go | 2 + .../relative-ranks_test.go | 43 ++++++++++++++++++ Algorithms/0507.perfect-number/README.md | 11 +++++ .../0507.perfect-number/perfect-number.go | 2 + .../perfect-number_test.go | 43 ++++++++++++++++++ .../0508.most-frequent-subtree-sum/README.md | 11 +++++ .../most-frequent-subtree-sum.go | 2 + .../most-frequent-subtree-sum_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-bottom-left-tree-value.go | 2 + .../find-bottom-left-tree-value_test.go | 43 ++++++++++++++++++ Algorithms/0514.freedom-trail/README.md | 11 +++++ .../0514.freedom-trail/freedom-trail.go | 2 + .../0514.freedom-trail/freedom-trail_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-largest-value-in-each-tree-row.go | 2 + ...ind-largest-value-in-each-tree-row_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../longest-palindromic-subsequence.go | 2 + .../longest-palindromic-subsequence_test.go | 43 ++++++++++++++++++ .../0517.super-washing-machines/README.md | 11 +++++ .../super-washing-machines.go | 2 + .../super-washing-machines_test.go | 43 ++++++++++++++++++ Algorithms/0520.detect-capital/README.md | 11 +++++ .../0520.detect-capital/detect-capital.go | 2 + .../detect-capital_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../longest-uncommon-subsequence-i.go | 2 + .../longest-uncommon-subsequence-i_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../longest-uncommon-subsequence-ii.go | 2 + .../longest-uncommon-subsequence-ii_test.go | 43 ++++++++++++++++++ .../0523.continuous-subarray-sum/README.md | 11 +++++ .../continuous-subarray-sum.go | 2 + .../continuous-subarray-sum_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...est-word-in-dictionary-through-deleting.go | 2 + ...ord-in-dictionary-through-deleting_test.go | 43 ++++++++++++++++++ Algorithms/0525.contiguous-array/README.md | 11 +++++ .../0525.contiguous-array/contiguous-array.go | 2 + .../contiguous-array_test.go | 43 ++++++++++++++++++ .../0526.beautiful-arrangement/README.md | 11 +++++ .../beautiful-arrangement.go | 2 + .../beautiful-arrangement_test.go | 43 ++++++++++++++++++ Algorithms/0527.word-abbreviation/README.md | 11 +++++ .../word-abbreviation.go | 2 + .../word-abbreviation_test.go | 43 ++++++++++++++++++ Algorithms/0529.minesweeper/README.md | 11 +++++ Algorithms/0529.minesweeper/minesweeper.go | 2 + .../0529.minesweeper/minesweeper_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../minimum-absolute-difference-in-bst.go | 2 + ...minimum-absolute-difference-in-bst_test.go | 43 ++++++++++++++++++ Algorithms/0531.lonely-pixel-i/README.md | 11 +++++ .../0531.lonely-pixel-i/lonely-pixel-i.go | 2 + .../lonely-pixel-i_test.go | 43 ++++++++++++++++++ .../0532.k-diff-pairs-in-an-array/README.md | 11 +++++ .../k-diff-pairs-in-an-array.go | 2 + .../k-diff-pairs-in-an-array_test.go | 43 ++++++++++++++++++ Algorithms/0533.lonely-pixel-ii/README.md | 11 +++++ .../0533.lonely-pixel-ii/lonely-pixel-ii.go | 2 + .../lonely-pixel-ii_test.go | 43 ++++++++++++++++++ .../0535.encode-and-decode-tinyurl/README.md | 11 +++++ .../encode-and-decode-tinyurl.go | 2 + .../encode-and-decode-tinyurl_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../construct-binary-tree-from-string.go | 2 + .../construct-binary-tree-from-string_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../complex-number-multiplication.go | 2 + .../complex-number-multiplication_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../convert-bst-to-greater-tree.go | 2 + .../convert-bst-to-greater-tree_test.go | 43 ++++++++++++++++++ .../0539.minimum-time-difference/README.md | 11 +++++ .../minimum-time-difference.go | 2 + .../minimum-time-difference_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../single-element-in-a-sorted-array.go | 2 + .../single-element-in-a-sorted-array_test.go | 43 ++++++++++++++++++ Algorithms/0541.reverse-string-ii/README.md | 11 +++++ .../reverse-string-ii.go | 2 + .../reverse-string-ii_test.go | 43 ++++++++++++++++++ Algorithms/0542.01-matrix/01-matrix.go | 2 + Algorithms/0542.01-matrix/01-matrix_test.go | 43 ++++++++++++++++++ Algorithms/0542.01-matrix/README.md | 11 +++++ .../0543.diameter-of-binary-tree/README.md | 11 +++++ .../diameter-of-binary-tree.go | 2 + .../diameter-of-binary-tree_test.go | 43 ++++++++++++++++++ .../0544.output-contest-matches/README.md | 11 +++++ .../output-contest-matches.go | 2 + .../output-contest-matches_test.go | 43 ++++++++++++++++++ .../0545.boundary-of-binary-tree/README.md | 11 +++++ .../boundary-of-binary-tree.go | 2 + .../boundary-of-binary-tree_test.go | 43 ++++++++++++++++++ Algorithms/0546.remove-boxes/README.md | 11 +++++ Algorithms/0546.remove-boxes/remove-boxes.go | 2 + .../0546.remove-boxes/remove-boxes_test.go | 43 ++++++++++++++++++ Algorithms/0547.friend-circles/README.md | 11 +++++ .../0547.friend-circles/friend-circles.go | 2 + .../friend-circles_test.go | 43 ++++++++++++++++++ .../0548.split-array-with-equal-sum/README.md | 11 +++++ .../split-array-with-equal-sum.go | 2 + .../split-array-with-equal-sum_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ry-tree-longest-consecutive-sequence-ii.go | 2 + ...ee-longest-consecutive-sequence-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../student-attendance-record-i.go | 2 + .../student-attendance-record-i_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../student-attendance-record-ii.go | 2 + .../student-attendance-record-ii_test.go | 43 ++++++++++++++++++ Algorithms/0553.optimal-division/README.md | 11 +++++ .../0553.optimal-division/optimal-division.go | 2 + .../optimal-division_test.go | 43 ++++++++++++++++++ Algorithms/0554.brick-wall/README.md | 11 +++++ Algorithms/0554.brick-wall/brick-wall.go | 2 + Algorithms/0554.brick-wall/brick-wall_test.go | 43 ++++++++++++++++++ .../0555.split-concatenated-strings/README.md | 11 +++++ .../split-concatenated-strings.go | 2 + .../split-concatenated-strings_test.go | 43 ++++++++++++++++++ .../0556.next-greater-element-iii/README.md | 11 +++++ .../next-greater-element-iii.go | 2 + .../next-greater-element-iii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../reverse-words-in-a-string-iii.go | 2 + .../reverse-words-in-a-string-iii_test.go | 43 ++++++++++++++++++ .../0560.subarray-sum-equals-k/README.md | 11 +++++ .../subarray-sum-equals-k.go | 2 + .../subarray-sum-equals-k_test.go | 43 ++++++++++++++++++ Algorithms/0561.array-partition-i/README.md | 11 +++++ .../array-partition-i.go | 2 + .../array-partition-i_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ngest-line-of-consecutive-one-in-matrix.go | 2 + ...-line-of-consecutive-one-in-matrix_test.go | 43 ++++++++++++++++++ Algorithms/0563.binary-tree-tilt/README.md | 11 +++++ .../0563.binary-tree-tilt/binary-tree-tilt.go | 2 + .../binary-tree-tilt_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-the-closest-palindrome.go | 2 + .../find-the-closest-palindrome_test.go | 43 ++++++++++++++++++ Algorithms/0565.array-nesting/README.md | 11 +++++ .../0565.array-nesting/array-nesting.go | 2 + .../0565.array-nesting/array-nesting_test.go | 43 ++++++++++++++++++ Algorithms/0566.reshape-the-matrix/README.md | 11 +++++ .../reshape-the-matrix.go | 2 + .../reshape-the-matrix_test.go | 43 ++++++++++++++++++ .../0567.permutation-in-string/README.md | 11 +++++ .../permutation-in-string.go | 2 + .../permutation-in-string_test.go | 43 ++++++++++++++++++ .../0568.maximum-vacation-days/README.md | 11 +++++ .../maximum-vacation-days.go | 2 + .../maximum-vacation-days_test.go | 43 ++++++++++++++++++ .../0572.subtree-of-another-tree/README.md | 11 +++++ .../subtree-of-another-tree.go | 2 + .../subtree-of-another-tree_test.go | 43 ++++++++++++++++++ Algorithms/0573.squirrel-simulation/README.md | 11 +++++ .../squirrel-simulation.go | 2 + .../squirrel-simulation_test.go | 43 ++++++++++++++++++ Algorithms/0575.distribute-candies/README.md | 11 +++++ .../distribute-candies.go | 2 + .../distribute-candies_test.go | 43 ++++++++++++++++++ .../0576.out-of-boundary-paths/README.md | 11 +++++ .../out-of-boundary-paths.go | 2 + .../out-of-boundary-paths_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../shortest-unsorted-continuous-subarray.go | 2 + ...rtest-unsorted-continuous-subarray_test.go | 43 ++++++++++++++++++ Algorithms/0582.kill-process/README.md | 11 +++++ Algorithms/0582.kill-process/kill-process.go | 2 + .../0582.kill-process/kill-process_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../delete-operation-for-two-strings.go | 2 + .../delete-operation-for-two-strings_test.go | 43 ++++++++++++++++++ Algorithms/0587.erect-the-fence/README.md | 11 +++++ .../0587.erect-the-fence/erect-the-fence.go | 2 + .../erect-the-fence_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../design-in-memory-file-system.go | 2 + .../design-in-memory-file-system_test.go | 43 ++++++++++++++++++ Algorithms/0591.tag-validator/README.md | 11 +++++ .../0591.tag-validator/tag-validator.go | 2 + .../0591.tag-validator/tag-validator_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../fraction-addition-and-subtraction.go | 2 + .../fraction-addition-and-subtraction_test.go | 43 ++++++++++++++++++ Algorithms/0593.valid-square/README.md | 11 +++++ Algorithms/0593.valid-square/valid-square.go | 2 + .../0593.valid-square/valid-square_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../longest-harmonious-subsequence.go | 2 + .../longest-harmonious-subsequence_test.go | 43 ++++++++++++++++++ Algorithms/0598.range-addition-ii/README.md | 11 +++++ .../range-addition-ii.go | 2 + .../range-addition-ii_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../minimum-index-sum-of-two-lists.go | 2 + .../minimum-index-sum-of-two-lists_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ ...ative-integers-without-consecutive-ones.go | 2 + ...-integers-without-consecutive-ones_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../design-compressed-string-iterator.go | 2 + .../design-compressed-string-iterator_test.go | 43 ++++++++++++++++++ Algorithms/0605.can-place-flowers/README.md | 11 +++++ .../can-place-flowers.go | 2 + .../can-place-flowers_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../construct-string-from-binary-tree.go | 2 + .../construct-string-from-binary-tree_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-duplicate-file-in-system.go | 2 + .../find-duplicate-file-in-system_test.go | 43 ++++++++++++++++++ .../0611.valid-triangle-number/README.md | 11 +++++ .../valid-triangle-number.go | 2 + .../valid-triangle-number_test.go | 43 ++++++++++++++++++ .../0616.add-bold-tag-in-string/README.md | 11 +++++ .../add-bold-tag-in-string.go | 2 + .../add-bold-tag-in-string_test.go | 43 ++++++++++++++++++ .../0617.merge-two-binary-trees/README.md | 11 +++++ .../merge-two-binary-trees.go | 2 + .../merge-two-binary-trees_test.go | 43 ++++++++++++++++++ Algorithms/0621.task-scheduler/README.md | 11 +++++ .../0621.task-scheduler/task-scheduler.go | 2 + .../task-scheduler_test.go | 43 ++++++++++++++++++ Algorithms/0623.add-one-row-to-tree/README.md | 11 +++++ .../add-one-row-to-tree.go | 2 + .../add-one-row-to-tree_test.go | 43 ++++++++++++++++++ .../0624.maximum-distance-in-arrays/README.md | 11 +++++ .../maximum-distance-in-arrays.go | 2 + .../maximum-distance-in-arrays_test.go | 43 ++++++++++++++++++ .../0625.minimum-factorization/README.md | 11 +++++ .../minimum-factorization.go | 2 + .../minimum-factorization_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../maximum-product-of-three-numbers.go | 2 + .../maximum-product-of-three-numbers_test.go | 43 ++++++++++++++++++ .../0629.k-inverse-pairs-array/README.md | 11 +++++ .../k-inverse-pairs-array.go | 2 + .../k-inverse-pairs-array_test.go | 43 ++++++++++++++++++ Algorithms/0630.course-schedule-iii/README.md | 11 +++++ .../course-schedule-iii.go | 2 + .../course-schedule-iii_test.go | 43 ++++++++++++++++++ .../0631.design-excel-sum-formula/README.md | 11 +++++ .../design-excel-sum-formula.go | 2 + .../design-excel-sum-formula_test.go | 43 ++++++++++++++++++ Algorithms/0632.smallest-range/README.md | 11 +++++ .../0632.smallest-range/smallest-range.go | 2 + .../smallest-range_test.go | 43 ++++++++++++++++++ .../0633.sum-of-square-numbers/README.md | 11 +++++ .../sum-of-square-numbers.go | 2 + .../sum-of-square-numbers_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-the-derangement-of-an-array.go | 2 + .../find-the-derangement-of-an-array_test.go | 43 ++++++++++++++++++ .../0635.design-log-storage-system/README.md | 11 +++++ .../design-log-storage-system.go | 2 + .../design-log-storage-system_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../exclusive-time-of-functions.go | 2 + .../exclusive-time-of-functions_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../average-of-levels-in-binary-tree.go | 2 + .../average-of-levels-in-binary-tree_test.go | 43 ++++++++++++++++++ Algorithms/0638.shopping-offers/README.md | 11 +++++ .../0638.shopping-offers/shopping-offers.go | 2 + .../shopping-offers_test.go | 43 ++++++++++++++++++ Algorithms/0639.decode-ways-ii/README.md | 11 +++++ .../0639.decode-ways-ii/decode-ways-ii.go | 2 + .../decode-ways-ii_test.go | 43 ++++++++++++++++++ Algorithms/0640.solve-the-equation/README.md | 11 +++++ .../solve-the-equation.go | 2 + .../solve-the-equation_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../design-search-autocomplete-system.go | 2 + .../design-search-autocomplete-system_test.go | 43 ++++++++++++++++++ .../0643.maximum-average-subarray-i/README.md | 11 +++++ .../maximum-average-subarray-i.go | 2 + .../maximum-average-subarray-i_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../maximum-average-subarray-ii.go | 2 + .../maximum-average-subarray-ii_test.go | 43 ++++++++++++++++++ Algorithms/0645.set-mismatch/README.md | 11 +++++ Algorithms/0645.set-mismatch/set-mismatch.go | 2 + .../0645.set-mismatch/set-mismatch_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../maximum-length-of-pair-chain.go | 2 + .../maximum-length-of-pair-chain_test.go | 43 ++++++++++++++++++ .../0647.palindromic-substrings/README.md | 11 +++++ .../palindromic-substrings.go | 2 + .../palindromic-substrings_test.go | 43 ++++++++++++++++++ Algorithms/0648.replace-words/README.md | 11 +++++ .../0648.replace-words/replace-words.go | 2 + .../0648.replace-words/replace-words_test.go | 43 ++++++++++++++++++ Draft/0433.minimum-genetic-mutation/README.md | 11 +++++ .../minimum-genetic-mutation.go | 2 + .../minimum-genetic-mutation_test.go | 43 ++++++++++++++++++ Draft/0457.circular-array-loop/README.md | 11 +++++ .../circular-array-loop.go | 2 + .../circular-array-loop_test.go | 43 ++++++++++++++++++ Draft/0458.poor-pigs/README.md | 11 +++++ Draft/0458.poor-pigs/poor-pigs.go | 2 + Draft/0458.poor-pigs/poor-pigs_test.go | 43 ++++++++++++++++++ Draft/0518.coin-change-2/README.md | 11 +++++ Draft/0518.coin-change-2/coin-change-2.go | 2 + .../0518.coin-change-2/coin-change-2_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../get-highest-answer-rate-question.go | 2 + .../get-highest-answer-rate-question_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../find-cumulative-salary-of-an-employee.go | 2 + ...d-cumulative-salary-of-an-employee_test.go | 43 ++++++++++++++++++ .../README.md | 11 +++++ .../consecutive-available-seats.go | 2 + .../consecutive-available-seats_test.go | 43 ++++++++++++++++++ Draft/0626.exchange-seats/README.md | 11 +++++ Draft/0626.exchange-seats/exchange-seats.go | 2 + .../exchange-seats_test.go | 43 ++++++++++++++++++ Helper | Bin 2560182 -> 2560182 bytes README.md | 20 ++++---- 1715 files changed, 31986 insertions(+), 10 deletions(-) create mode 100755 Algorithms/0011.container-with-most-water/README.md create mode 100755 Algorithms/0011.container-with-most-water/container-with-most-water.go create mode 100755 Algorithms/0011.container-with-most-water/container-with-most-water_test.go create mode 100755 Algorithms/0012.integer-to-roman/README.md create mode 100755 Algorithms/0012.integer-to-roman/integer-to-roman.go create mode 100755 Algorithms/0012.integer-to-roman/integer-to-roman_test.go create mode 100755 Algorithms/0013.roman-to-integer/README.md create mode 100755 Algorithms/0013.roman-to-integer/roman-to-integer.go create mode 100755 Algorithms/0013.roman-to-integer/roman-to-integer_test.go create mode 100755 Algorithms/0014.longest-common-prefix/README.md create mode 100755 Algorithms/0014.longest-common-prefix/longest-common-prefix.go create mode 100755 Algorithms/0014.longest-common-prefix/longest-common-prefix_test.go create mode 100755 Algorithms/0015.3sum/3sum.go create mode 100755 Algorithms/0015.3sum/3sum_test.go create mode 100755 Algorithms/0015.3sum/README.md create mode 100755 Algorithms/0016.3sum-closest/3sum-closest.go create mode 100755 Algorithms/0016.3sum-closest/3sum-closest_test.go create mode 100755 Algorithms/0016.3sum-closest/README.md create mode 100755 Algorithms/0017.letter-combinations-of-a-phone-number/README.md create mode 100755 Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.go create mode 100755 Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go create mode 100755 Algorithms/0018.4sum/4sum.go create mode 100755 Algorithms/0018.4sum/4sum_test.go create mode 100755 Algorithms/0018.4sum/README.md create mode 100755 Algorithms/0019.remove-nth-node-from-end-of-list/README.md create mode 100755 Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.go create mode 100755 Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go create mode 100755 Algorithms/0020.valid-parentheses/README.md create mode 100755 Algorithms/0020.valid-parentheses/valid-parentheses.go create mode 100755 Algorithms/0020.valid-parentheses/valid-parentheses_test.go create mode 100755 Algorithms/0021.merge-two-sorted-lists/README.md create mode 100755 Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists.go create mode 100755 Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go create mode 100755 Algorithms/0022.generate-parentheses/README.md create mode 100755 Algorithms/0022.generate-parentheses/generate-parentheses.go create mode 100755 Algorithms/0022.generate-parentheses/generate-parentheses_test.go create mode 100755 Algorithms/0023.merge-k-sorted-lists/README.md create mode 100755 Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists.go create mode 100755 Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go create mode 100755 Algorithms/0024.swap-nodes-in-pairs/README.md create mode 100755 Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs.go create mode 100755 Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go create mode 100755 Algorithms/0025.reverse-nodes-in-k-group/README.md create mode 100755 Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group.go create mode 100755 Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go create mode 100755 Algorithms/0026.remove-duplicates-from-sorted-array/README.md create mode 100755 Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.go create mode 100755 Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go create mode 100755 Algorithms/0027.remove-element/README.md create mode 100755 Algorithms/0027.remove-element/remove-element.go create mode 100755 Algorithms/0027.remove-element/remove-element_test.go create mode 100755 Algorithms/0028.implement-strstr/README.md create mode 100755 Algorithms/0028.implement-strstr/implement-strstr.go create mode 100755 Algorithms/0028.implement-strstr/implement-strstr_test.go create mode 100755 Algorithms/0029.divide-two-integers/README.md create mode 100755 Algorithms/0029.divide-two-integers/divide-two-integers.go create mode 100755 Algorithms/0029.divide-two-integers/divide-two-integers_test.go create mode 100755 Algorithms/0030.substring-with-concatenation-of-all-words/README.md create mode 100755 Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words.go create mode 100755 Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go create mode 100755 Algorithms/0031.next-permutation/README.md create mode 100755 Algorithms/0031.next-permutation/next-permutation.go create mode 100755 Algorithms/0031.next-permutation/next-permutation_test.go create mode 100755 Algorithms/0032.longest-valid-parentheses/README.md create mode 100755 Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses.go create mode 100755 Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go create mode 100755 Algorithms/0033.search-in-rotated-sorted-array/README.md create mode 100755 Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.go create mode 100755 Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go create mode 100755 Algorithms/0034.search-for-a-range/README.md create mode 100755 Algorithms/0034.search-for-a-range/search-for-a-range.go create mode 100755 Algorithms/0034.search-for-a-range/search-for-a-range_test.go create mode 100755 Algorithms/0035.search-insert-position/README.md create mode 100755 Algorithms/0035.search-insert-position/search-insert-position.go create mode 100755 Algorithms/0035.search-insert-position/search-insert-position_test.go create mode 100755 Algorithms/0036.valid-sudoku/README.md create mode 100755 Algorithms/0036.valid-sudoku/valid-sudoku.go create mode 100755 Algorithms/0036.valid-sudoku/valid-sudoku_test.go create mode 100755 Algorithms/0037.sudoku-solver/README.md create mode 100755 Algorithms/0037.sudoku-solver/sudoku-solver.go create mode 100755 Algorithms/0037.sudoku-solver/sudoku-solver_test.go create mode 100755 Algorithms/0038.count-and-say/README.md create mode 100755 Algorithms/0038.count-and-say/count-and-say.go create mode 100755 Algorithms/0038.count-and-say/count-and-say_test.go create mode 100755 Algorithms/0039.combination-sum/README.md create mode 100755 Algorithms/0039.combination-sum/combination-sum.go create mode 100755 Algorithms/0039.combination-sum/combination-sum_test.go create mode 100755 Algorithms/0040.combination-sum-ii/README.md create mode 100755 Algorithms/0040.combination-sum-ii/combination-sum-ii.go create mode 100755 Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go create mode 100755 Algorithms/0041.first-missing-positive/README.md create mode 100755 Algorithms/0041.first-missing-positive/first-missing-positive.go create mode 100755 Algorithms/0041.first-missing-positive/first-missing-positive_test.go create mode 100755 Algorithms/0042.trapping-rain-water/README.md create mode 100755 Algorithms/0042.trapping-rain-water/trapping-rain-water.go create mode 100755 Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go create mode 100755 Algorithms/0043.multiply-strings/README.md create mode 100755 Algorithms/0043.multiply-strings/multiply-strings.go create mode 100755 Algorithms/0043.multiply-strings/multiply-strings_test.go create mode 100755 Algorithms/0044.wildcard-matching/README.md create mode 100755 Algorithms/0044.wildcard-matching/wildcard-matching.go create mode 100755 Algorithms/0044.wildcard-matching/wildcard-matching_test.go create mode 100755 Algorithms/0045.jump-game-ii/README.md create mode 100755 Algorithms/0045.jump-game-ii/jump-game-ii.go create mode 100755 Algorithms/0045.jump-game-ii/jump-game-ii_test.go create mode 100755 Algorithms/0046.permutations/README.md create mode 100755 Algorithms/0046.permutations/permutations.go create mode 100755 Algorithms/0046.permutations/permutations_test.go create mode 100755 Algorithms/0047.permutations-ii/README.md create mode 100755 Algorithms/0047.permutations-ii/permutations-ii.go create mode 100755 Algorithms/0047.permutations-ii/permutations-ii_test.go create mode 100755 Algorithms/0048.rotate-image/README.md create mode 100755 Algorithms/0048.rotate-image/rotate-image.go create mode 100755 Algorithms/0048.rotate-image/rotate-image_test.go create mode 100755 Algorithms/0049.group-anagrams/README.md create mode 100755 Algorithms/0049.group-anagrams/group-anagrams.go create mode 100755 Algorithms/0049.group-anagrams/group-anagrams_test.go create mode 100755 Algorithms/0050.powx-n/README.md create mode 100755 Algorithms/0050.powx-n/powx-n.go create mode 100755 Algorithms/0050.powx-n/powx-n_test.go create mode 100755 Algorithms/0051.n-queens/README.md create mode 100755 Algorithms/0051.n-queens/n-queens.go create mode 100755 Algorithms/0051.n-queens/n-queens_test.go create mode 100755 Algorithms/0052.n-queens-ii/README.md create mode 100755 Algorithms/0052.n-queens-ii/n-queens-ii.go create mode 100755 Algorithms/0052.n-queens-ii/n-queens-ii_test.go create mode 100755 Algorithms/0053.maximum-subarray/README.md create mode 100755 Algorithms/0053.maximum-subarray/maximum-subarray.go create mode 100755 Algorithms/0053.maximum-subarray/maximum-subarray_test.go create mode 100755 Algorithms/0054.spiral-matrix/README.md create mode 100755 Algorithms/0054.spiral-matrix/spiral-matrix.go create mode 100755 Algorithms/0054.spiral-matrix/spiral-matrix_test.go create mode 100755 Algorithms/0055.jump-game/README.md create mode 100755 Algorithms/0055.jump-game/jump-game.go create mode 100755 Algorithms/0055.jump-game/jump-game_test.go create mode 100755 Algorithms/0056.merge-intervals/README.md create mode 100755 Algorithms/0056.merge-intervals/merge-intervals.go create mode 100755 Algorithms/0056.merge-intervals/merge-intervals_test.go create mode 100755 Algorithms/0057.insert-interval/README.md create mode 100755 Algorithms/0057.insert-interval/insert-interval.go create mode 100755 Algorithms/0057.insert-interval/insert-interval_test.go create mode 100755 Algorithms/0058.length-of-last-word/README.md create mode 100755 Algorithms/0058.length-of-last-word/length-of-last-word.go create mode 100755 Algorithms/0058.length-of-last-word/length-of-last-word_test.go create mode 100755 Algorithms/0059.spiral-matrix-ii/README.md create mode 100755 Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii.go create mode 100755 Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go create mode 100755 Algorithms/0060.permutation-sequence/README.md create mode 100755 Algorithms/0060.permutation-sequence/permutation-sequence.go create mode 100755 Algorithms/0060.permutation-sequence/permutation-sequence_test.go create mode 100755 Algorithms/0061.rotate-list/README.md create mode 100755 Algorithms/0061.rotate-list/rotate-list.go create mode 100755 Algorithms/0061.rotate-list/rotate-list_test.go create mode 100755 Algorithms/0062.unique-paths/README.md create mode 100755 Algorithms/0062.unique-paths/unique-paths.go create mode 100755 Algorithms/0062.unique-paths/unique-paths_test.go create mode 100755 Algorithms/0063.unique-paths-ii/README.md create mode 100755 Algorithms/0063.unique-paths-ii/unique-paths-ii.go create mode 100755 Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go create mode 100755 Algorithms/0064.minimum-path-sum/README.md create mode 100755 Algorithms/0064.minimum-path-sum/minimum-path-sum.go create mode 100755 Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go create mode 100755 Algorithms/0065.valid-number/README.md create mode 100755 Algorithms/0065.valid-number/valid-number.go create mode 100755 Algorithms/0065.valid-number/valid-number_test.go create mode 100755 Algorithms/0066.plus-one/README.md create mode 100755 Algorithms/0066.plus-one/plus-one.go create mode 100755 Algorithms/0066.plus-one/plus-one_test.go create mode 100755 Algorithms/0067.add-binary/README.md create mode 100755 Algorithms/0067.add-binary/add-binary.go create mode 100755 Algorithms/0067.add-binary/add-binary_test.go create mode 100755 Algorithms/0068.text-justification/README.md create mode 100755 Algorithms/0068.text-justification/text-justification.go create mode 100755 Algorithms/0068.text-justification/text-justification_test.go create mode 100755 Algorithms/0069.sqrtx/README.md create mode 100755 Algorithms/0069.sqrtx/sqrtx.go create mode 100755 Algorithms/0069.sqrtx/sqrtx_test.go create mode 100755 Algorithms/0070.climbing-stairs/README.md create mode 100755 Algorithms/0070.climbing-stairs/climbing-stairs.go create mode 100755 Algorithms/0070.climbing-stairs/climbing-stairs_test.go create mode 100755 Algorithms/0071.simplify-path/README.md create mode 100755 Algorithms/0071.simplify-path/simplify-path.go create mode 100755 Algorithms/0071.simplify-path/simplify-path_test.go create mode 100755 Algorithms/0072.edit-distance/README.md create mode 100755 Algorithms/0072.edit-distance/edit-distance.go create mode 100755 Algorithms/0072.edit-distance/edit-distance_test.go create mode 100755 Algorithms/0073.set-matrix-zeroes/README.md create mode 100755 Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes.go create mode 100755 Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go create mode 100755 Algorithms/0074.search-a-2d-matrix/README.md create mode 100755 Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix.go create mode 100755 Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix_test.go create mode 100755 Algorithms/0075.sort-colors/README.md create mode 100755 Algorithms/0075.sort-colors/sort-colors.go create mode 100755 Algorithms/0075.sort-colors/sort-colors_test.go create mode 100755 Algorithms/0076.minimum-window-substring/README.md create mode 100755 Algorithms/0076.minimum-window-substring/minimum-window-substring.go create mode 100755 Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go create mode 100755 Algorithms/0077.combinations/README.md create mode 100755 Algorithms/0077.combinations/combinations.go create mode 100755 Algorithms/0077.combinations/combinations_test.go create mode 100755 Algorithms/0078.subsets/README.md create mode 100755 Algorithms/0078.subsets/subsets.go create mode 100755 Algorithms/0078.subsets/subsets_test.go create mode 100755 Algorithms/0079.word-search/README.md create mode 100755 Algorithms/0079.word-search/word-search.go create mode 100755 Algorithms/0079.word-search/word-search_test.go create mode 100755 Algorithms/0080.remove-duplicates-from-sorted-array-ii/README.md create mode 100755 Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.go create mode 100755 Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii_test.go create mode 100755 Algorithms/0081.search-in-rotated-sorted-array-ii/README.md create mode 100755 Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii.go create mode 100755 Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii_test.go create mode 100755 Algorithms/0082.remove-duplicates-from-sorted-list-ii/README.md create mode 100755 Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.go create mode 100755 Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii_test.go create mode 100755 Algorithms/0083.remove-duplicates-from-sorted-list/README.md create mode 100755 Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.go create mode 100755 Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list_test.go create mode 100755 Algorithms/0084.largest-rectangle-in-histogram/README.md create mode 100755 Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram.go create mode 100755 Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram_test.go create mode 100755 Algorithms/0085.maximal-rectangle/README.md create mode 100755 Algorithms/0085.maximal-rectangle/maximal-rectangle.go create mode 100755 Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go create mode 100755 Algorithms/0086.partition-list/README.md create mode 100755 Algorithms/0086.partition-list/partition-list.go create mode 100755 Algorithms/0086.partition-list/partition-list_test.go create mode 100755 Algorithms/0087.scramble-string/README.md create mode 100755 Algorithms/0087.scramble-string/scramble-string.go create mode 100755 Algorithms/0087.scramble-string/scramble-string_test.go create mode 100755 Algorithms/0088.merge-sorted-array/README.md create mode 100755 Algorithms/0088.merge-sorted-array/merge-sorted-array.go create mode 100755 Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go create mode 100755 Algorithms/0089.gray-code/README.md create mode 100755 Algorithms/0089.gray-code/gray-code.go create mode 100755 Algorithms/0089.gray-code/gray-code_test.go create mode 100755 Algorithms/0090.subsets-ii/README.md create mode 100755 Algorithms/0090.subsets-ii/subsets-ii.go create mode 100755 Algorithms/0090.subsets-ii/subsets-ii_test.go create mode 100755 Algorithms/0091.decode-ways/README.md create mode 100755 Algorithms/0091.decode-ways/decode-ways.go create mode 100755 Algorithms/0091.decode-ways/decode-ways_test.go create mode 100755 Algorithms/0092.reverse-linked-list-ii/README.md create mode 100755 Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii.go create mode 100755 Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii_test.go create mode 100755 Algorithms/0093.restore-ip-addresses/README.md create mode 100755 Algorithms/0093.restore-ip-addresses/restore-ip-addresses.go create mode 100755 Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go create mode 100755 Algorithms/0094.binary-tree-inorder-traversal/README.md create mode 100755 Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal.go create mode 100755 Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal_test.go create mode 100755 Algorithms/0095.unique-binary-search-trees-ii/README.md create mode 100755 Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii.go create mode 100755 Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii_test.go create mode 100755 Algorithms/0096.unique-binary-search-trees/README.md create mode 100755 Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees.go create mode 100755 Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees_test.go create mode 100755 Algorithms/0097.interleaving-string/README.md create mode 100755 Algorithms/0097.interleaving-string/interleaving-string.go create mode 100755 Algorithms/0097.interleaving-string/interleaving-string_test.go create mode 100755 Algorithms/0098.validate-binary-search-tree/README.md create mode 100755 Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree.go create mode 100755 Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree_test.go create mode 100755 Algorithms/0099.recover-binary-search-tree/README.md create mode 100755 Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree.go create mode 100755 Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree_test.go create mode 100755 Algorithms/0100.same-tree/README.md create mode 100755 Algorithms/0100.same-tree/same-tree.go create mode 100755 Algorithms/0100.same-tree/same-tree_test.go create mode 100755 Algorithms/0101.symmetric-tree/README.md create mode 100755 Algorithms/0101.symmetric-tree/symmetric-tree.go create mode 100755 Algorithms/0101.symmetric-tree/symmetric-tree_test.go create mode 100755 Algorithms/0102.binary-tree-level-order-traversal/README.md create mode 100755 Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal.go create mode 100755 Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal_test.go create mode 100755 Algorithms/0103.binary-tree-zigzag-level-order-traversal/README.md create mode 100755 Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal.go create mode 100755 Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal_test.go create mode 100755 Algorithms/0104.maximum-depth-of-binary-tree/README.md create mode 100755 Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.go create mode 100755 Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree_test.go create mode 100755 Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/README.md create mode 100755 Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal.go create mode 100755 Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal_test.go create mode 100755 Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/README.md create mode 100755 Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.go create mode 100755 Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal_test.go create mode 100755 Algorithms/0107.binary-tree-level-order-traversal-ii/README.md create mode 100755 Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii.go create mode 100755 Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii_test.go create mode 100755 Algorithms/0108.convert-sorted-array-to-binary-search-tree/README.md create mode 100755 Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree.go create mode 100755 Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree_test.go create mode 100755 Algorithms/0109.convert-sorted-list-to-binary-search-tree/README.md create mode 100755 Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.go create mode 100755 Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree_test.go create mode 100755 Algorithms/0110.balanced-binary-tree/README.md create mode 100755 Algorithms/0110.balanced-binary-tree/balanced-binary-tree.go create mode 100755 Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go create mode 100755 Algorithms/0111.minimum-depth-of-binary-tree/README.md create mode 100755 Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.go create mode 100755 Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree_test.go create mode 100755 Algorithms/0112.path-sum/README.md create mode 100755 Algorithms/0112.path-sum/path-sum.go create mode 100755 Algorithms/0112.path-sum/path-sum_test.go create mode 100755 Algorithms/0113.path-sum-ii/README.md create mode 100755 Algorithms/0113.path-sum-ii/path-sum-ii.go create mode 100755 Algorithms/0113.path-sum-ii/path-sum-ii_test.go create mode 100755 Algorithms/0114.flatten-binary-tree-to-linked-list/README.md create mode 100755 Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list.go create mode 100755 Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list_test.go create mode 100755 Algorithms/0115.distinct-subsequences/README.md create mode 100755 Algorithms/0115.distinct-subsequences/distinct-subsequences.go create mode 100755 Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go create mode 100755 Algorithms/0116.populating-next-right-pointers-in-each-node/README.md create mode 100755 Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node.go create mode 100755 Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node_test.go create mode 100755 Algorithms/0117.populating-next-right-pointers-in-each-node-ii/README.md create mode 100755 Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii.go create mode 100755 Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii_test.go create mode 100755 Algorithms/0118.pascals-triangle/README.md create mode 100755 Algorithms/0118.pascals-triangle/pascals-triangle.go create mode 100755 Algorithms/0118.pascals-triangle/pascals-triangle_test.go create mode 100755 Algorithms/0119.pascals-triangle-ii/README.md create mode 100755 Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii.go create mode 100755 Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go create mode 100755 Algorithms/0120.triangle/README.md create mode 100755 Algorithms/0120.triangle/triangle.go create mode 100755 Algorithms/0120.triangle/triangle_test.go create mode 100755 Algorithms/0121.best-time-to-buy-and-sell-stock/README.md create mode 100755 Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.go create mode 100755 Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock_test.go create mode 100755 Algorithms/0122.best-time-to-buy-and-sell-stock-ii/README.md create mode 100755 Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.go create mode 100755 Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii_test.go create mode 100755 Algorithms/0123.best-time-to-buy-and-sell-stock-iii/README.md create mode 100755 Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii.go create mode 100755 Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii_test.go create mode 100755 Algorithms/0124.binary-tree-maximum-path-sum/README.md create mode 100755 Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum.go create mode 100755 Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum_test.go create mode 100755 Algorithms/0125.valid-palindrome/README.md create mode 100755 Algorithms/0125.valid-palindrome/valid-palindrome.go create mode 100755 Algorithms/0125.valid-palindrome/valid-palindrome_test.go create mode 100755 Algorithms/0126.word-ladder-ii/README.md create mode 100755 Algorithms/0126.word-ladder-ii/word-ladder-ii.go create mode 100755 Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go create mode 100755 Algorithms/0127.word-ladder/README.md create mode 100755 Algorithms/0127.word-ladder/word-ladder.go create mode 100755 Algorithms/0127.word-ladder/word-ladder_test.go create mode 100755 Algorithms/0128.longest-consecutive-sequence/README.md create mode 100755 Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence.go create mode 100755 Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go create mode 100755 Algorithms/0129.sum-root-to-leaf-numbers/README.md create mode 100755 Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.go create mode 100755 Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers_test.go create mode 100755 Algorithms/0130.surrounded-regions/README.md create mode 100755 Algorithms/0130.surrounded-regions/surrounded-regions.go create mode 100755 Algorithms/0130.surrounded-regions/surrounded-regions_test.go create mode 100755 Algorithms/0131.palindrome-partitioning/README.md create mode 100755 Algorithms/0131.palindrome-partitioning/palindrome-partitioning.go create mode 100755 Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go create mode 100755 Algorithms/0132.palindrome-partitioning-ii/README.md create mode 100755 Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii.go create mode 100755 Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go create mode 100755 Algorithms/0133.clone-graph/README.md create mode 100755 Algorithms/0133.clone-graph/clone-graph.go create mode 100755 Algorithms/0133.clone-graph/clone-graph_test.go create mode 100755 Algorithms/0134.gas-station/README.md create mode 100755 Algorithms/0134.gas-station/gas-station.go create mode 100755 Algorithms/0134.gas-station/gas-station_test.go create mode 100755 Algorithms/0135.candy/README.md create mode 100755 Algorithms/0135.candy/candy.go create mode 100755 Algorithms/0135.candy/candy_test.go create mode 100755 Algorithms/0136.single-number/README.md create mode 100755 Algorithms/0136.single-number/single-number.go create mode 100755 Algorithms/0136.single-number/single-number_test.go create mode 100755 Algorithms/0137.single-number-ii/README.md create mode 100755 Algorithms/0137.single-number-ii/single-number-ii.go create mode 100755 Algorithms/0137.single-number-ii/single-number-ii_test.go create mode 100755 Algorithms/0138.copy-list-with-random-pointer/README.md create mode 100755 Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer.go create mode 100755 Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer_test.go create mode 100755 Algorithms/0139.word-break/README.md create mode 100755 Algorithms/0139.word-break/word-break.go create mode 100755 Algorithms/0139.word-break/word-break_test.go create mode 100755 Algorithms/0140.word-break-ii/README.md create mode 100755 Algorithms/0140.word-break-ii/word-break-ii.go create mode 100755 Algorithms/0140.word-break-ii/word-break-ii_test.go create mode 100755 Algorithms/0141.linked-list-cycle/README.md create mode 100755 Algorithms/0141.linked-list-cycle/linked-list-cycle.go create mode 100755 Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go create mode 100755 Algorithms/0142.linked-list-cycle-ii/README.md create mode 100755 Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii.go create mode 100755 Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii_test.go create mode 100755 Algorithms/0143.reorder-list/README.md create mode 100755 Algorithms/0143.reorder-list/reorder-list.go create mode 100755 Algorithms/0143.reorder-list/reorder-list_test.go create mode 100755 Algorithms/0144.binary-tree-preorder-traversal/README.md create mode 100755 Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal.go create mode 100755 Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal_test.go create mode 100755 Algorithms/0145.binary-tree-postorder-traversal/README.md create mode 100755 Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal.go create mode 100755 Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal_test.go create mode 100755 Algorithms/0146.lru-cache/README.md create mode 100755 Algorithms/0146.lru-cache/lru-cache.go create mode 100755 Algorithms/0146.lru-cache/lru-cache_test.go create mode 100755 Algorithms/0147.insertion-sort-list/README.md create mode 100755 Algorithms/0147.insertion-sort-list/insertion-sort-list.go create mode 100755 Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go create mode 100755 Algorithms/0148.sort-list/README.md create mode 100755 Algorithms/0148.sort-list/sort-list.go create mode 100755 Algorithms/0148.sort-list/sort-list_test.go create mode 100755 Algorithms/0149.max-points-on-a-line/README.md create mode 100755 Algorithms/0149.max-points-on-a-line/max-points-on-a-line.go create mode 100755 Algorithms/0149.max-points-on-a-line/max-points-on-a-line_test.go create mode 100755 Algorithms/0150.evaluate-reverse-polish-notation/README.md create mode 100755 Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation.go create mode 100755 Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation_test.go create mode 100755 Algorithms/0151.reverse-words-in-a-string/README.md create mode 100755 Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string.go create mode 100755 Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string_test.go create mode 100755 Algorithms/0152.maximum-product-subarray/README.md create mode 100755 Algorithms/0152.maximum-product-subarray/maximum-product-subarray.go create mode 100755 Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go create mode 100755 Algorithms/0153.find-minimum-in-rotated-sorted-array/README.md create mode 100755 Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.go create mode 100755 Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array_test.go create mode 100755 Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/README.md create mode 100755 Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii.go create mode 100755 Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii_test.go create mode 100755 Algorithms/0155.min-stack/README.md create mode 100755 Algorithms/0155.min-stack/min-stack.go create mode 100755 Algorithms/0155.min-stack/min-stack_test.go create mode 100755 Algorithms/0156.binary-tree-upside-down/README.md create mode 100755 Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down.go create mode 100755 Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down_test.go create mode 100755 Algorithms/0157.read-n-characters-given-read4/README.md create mode 100755 Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4.go create mode 100755 Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4_test.go create mode 100755 Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/README.md create mode 100755 Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times.go create mode 100755 Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times_test.go create mode 100755 Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/README.md create mode 100755 Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters.go create mode 100755 Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters_test.go create mode 100755 Algorithms/0160.intersection-of-two-linked-lists/README.md create mode 100755 Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists.go create mode 100755 Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists_test.go create mode 100755 Algorithms/0161.one-edit-distance/README.md create mode 100755 Algorithms/0161.one-edit-distance/one-edit-distance.go create mode 100755 Algorithms/0161.one-edit-distance/one-edit-distance_test.go create mode 100755 Algorithms/0162.find-peak-element/README.md create mode 100755 Algorithms/0162.find-peak-element/find-peak-element.go create mode 100755 Algorithms/0162.find-peak-element/find-peak-element_test.go create mode 100755 Algorithms/0163.missing-ranges/README.md create mode 100755 Algorithms/0163.missing-ranges/missing-ranges.go create mode 100755 Algorithms/0163.missing-ranges/missing-ranges_test.go create mode 100755 Algorithms/0164.maximum-gap/README.md create mode 100755 Algorithms/0164.maximum-gap/maximum-gap.go create mode 100755 Algorithms/0164.maximum-gap/maximum-gap_test.go create mode 100755 Algorithms/0165.compare-version-numbers/README.md create mode 100755 Algorithms/0165.compare-version-numbers/compare-version-numbers.go create mode 100755 Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go create mode 100755 Algorithms/0166.fraction-to-recurring-decimal/README.md create mode 100755 Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal.go create mode 100755 Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal_test.go create mode 100755 Algorithms/0167.two-sum-ii-input-array-is-sorted/README.md create mode 100755 Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.go create mode 100755 Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted_test.go create mode 100755 Algorithms/0168.excel-sheet-column-title/README.md create mode 100755 Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title.go create mode 100755 Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title_test.go create mode 100755 Algorithms/0169.majority-element/README.md create mode 100755 Algorithms/0169.majority-element/majority-element.go create mode 100755 Algorithms/0169.majority-element/majority-element_test.go create mode 100755 Algorithms/0170.two-sum-iii-data-structure-design/README.md create mode 100755 Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design.go create mode 100755 Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design_test.go create mode 100755 Algorithms/0171.excel-sheet-column-number/README.md create mode 100755 Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number.go create mode 100755 Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number_test.go create mode 100755 Algorithms/0172.factorial-trailing-zeroes/README.md create mode 100755 Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes.go create mode 100755 Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go create mode 100755 Algorithms/0173.binary-search-tree-iterator/README.md create mode 100755 Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go create mode 100755 Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator_test.go create mode 100755 Algorithms/0174.dungeon-game/README.md create mode 100755 Algorithms/0174.dungeon-game/dungeon-game.go create mode 100755 Algorithms/0174.dungeon-game/dungeon-game_test.go create mode 100755 Algorithms/0179.largest-number/README.md create mode 100755 Algorithms/0179.largest-number/largest-number.go create mode 100755 Algorithms/0179.largest-number/largest-number_test.go create mode 100755 Algorithms/0186.reverse-words-in-a-string-ii/README.md create mode 100755 Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii.go create mode 100755 Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii_test.go create mode 100755 Algorithms/0187.repeated-dna-sequences/README.md create mode 100755 Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences.go create mode 100755 Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go create mode 100755 Algorithms/0188.best-time-to-buy-and-sell-stock-iv/README.md create mode 100755 Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv.go create mode 100755 Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv_test.go create mode 100755 Algorithms/0189.rotate-array/README.md create mode 100755 Algorithms/0189.rotate-array/rotate-array.go create mode 100755 Algorithms/0189.rotate-array/rotate-array_test.go create mode 100755 Algorithms/0190.reverse-bits/README.md create mode 100755 Algorithms/0190.reverse-bits/reverse-bits.go create mode 100755 Algorithms/0190.reverse-bits/reverse-bits_test.go create mode 100755 Algorithms/0191.number-of-1-bits/README.md create mode 100755 Algorithms/0191.number-of-1-bits/number-of-1-bits.go create mode 100755 Algorithms/0191.number-of-1-bits/number-of-1-bits_test.go create mode 100755 Algorithms/0198.house-robber/README.md create mode 100755 Algorithms/0198.house-robber/house-robber.go create mode 100755 Algorithms/0198.house-robber/house-robber_test.go create mode 100755 Algorithms/0199.binary-tree-right-side-view/README.md create mode 100755 Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view.go create mode 100755 Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view_test.go create mode 100755 Algorithms/0200.number-of-islands/README.md create mode 100755 Algorithms/0200.number-of-islands/number-of-islands.go create mode 100755 Algorithms/0200.number-of-islands/number-of-islands_test.go create mode 100755 Algorithms/0201.bitwise-and-of-numbers-range/README.md create mode 100755 Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range.go create mode 100755 Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range_test.go create mode 100755 Algorithms/0202.happy-number/README.md create mode 100755 Algorithms/0202.happy-number/happy-number.go create mode 100755 Algorithms/0202.happy-number/happy-number_test.go create mode 100755 Algorithms/0203.remove-linked-list-elements/README.md create mode 100755 Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements.go create mode 100755 Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements_test.go create mode 100755 Algorithms/0204.count-primes/README.md create mode 100755 Algorithms/0204.count-primes/count-primes.go create mode 100755 Algorithms/0204.count-primes/count-primes_test.go create mode 100755 Algorithms/0205.isomorphic-strings/README.md create mode 100755 Algorithms/0205.isomorphic-strings/isomorphic-strings.go create mode 100755 Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go create mode 100755 Algorithms/0206.reverse-linked-list/README.md create mode 100755 Algorithms/0206.reverse-linked-list/reverse-linked-list.go create mode 100755 Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go create mode 100755 Algorithms/0207.course-schedule/README.md create mode 100755 Algorithms/0207.course-schedule/course-schedule.go create mode 100755 Algorithms/0207.course-schedule/course-schedule_test.go create mode 100755 Algorithms/0208.implement-trie-prefix-tree/README.md create mode 100755 Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree.go create mode 100755 Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree_test.go create mode 100755 Algorithms/0209.minimum-size-subarray-sum/README.md create mode 100755 Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum.go create mode 100755 Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum_test.go create mode 100755 Algorithms/0210.course-schedule-ii/README.md create mode 100755 Algorithms/0210.course-schedule-ii/course-schedule-ii.go create mode 100755 Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go create mode 100755 Algorithms/0211.add-and-search-word-data-structure-design/README.md create mode 100755 Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design.go create mode 100755 Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design_test.go create mode 100755 Algorithms/0212.word-search-ii/README.md create mode 100755 Algorithms/0212.word-search-ii/word-search-ii.go create mode 100755 Algorithms/0212.word-search-ii/word-search-ii_test.go create mode 100755 Algorithms/0213.house-robber-ii/README.md create mode 100755 Algorithms/0213.house-robber-ii/house-robber-ii.go create mode 100755 Algorithms/0213.house-robber-ii/house-robber-ii_test.go create mode 100755 Algorithms/0214.shortest-palindrome/README.md create mode 100755 Algorithms/0214.shortest-palindrome/shortest-palindrome.go create mode 100755 Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go create mode 100755 Algorithms/0215.kth-largest-element-in-an-array/README.md create mode 100755 Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array.go create mode 100755 Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array_test.go create mode 100755 Algorithms/0216.combination-sum-iii/README.md create mode 100755 Algorithms/0216.combination-sum-iii/combination-sum-iii.go create mode 100755 Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go create mode 100755 Algorithms/0217.contains-duplicate/README.md create mode 100755 Algorithms/0217.contains-duplicate/contains-duplicate.go create mode 100755 Algorithms/0217.contains-duplicate/contains-duplicate_test.go create mode 100755 Algorithms/0218.the-skyline-problem/README.md create mode 100755 Algorithms/0218.the-skyline-problem/the-skyline-problem.go create mode 100755 Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go create mode 100755 Algorithms/0219.contains-duplicate-ii/README.md create mode 100755 Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii.go create mode 100755 Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go create mode 100755 Algorithms/0220.contains-duplicate-iii/README.md create mode 100755 Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii.go create mode 100755 Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go create mode 100755 Algorithms/0221.maximal-square/README.md create mode 100755 Algorithms/0221.maximal-square/maximal-square.go create mode 100755 Algorithms/0221.maximal-square/maximal-square_test.go create mode 100755 Algorithms/0222.count-complete-tree-nodes/README.md create mode 100755 Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes.go create mode 100755 Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes_test.go create mode 100755 Algorithms/0223.rectangle-area/README.md create mode 100755 Algorithms/0223.rectangle-area/rectangle-area.go create mode 100755 Algorithms/0223.rectangle-area/rectangle-area_test.go create mode 100755 Algorithms/0224.basic-calculator/README.md create mode 100755 Algorithms/0224.basic-calculator/basic-calculator.go create mode 100755 Algorithms/0224.basic-calculator/basic-calculator_test.go create mode 100755 Algorithms/0225.implement-stack-using-queues/README.md create mode 100755 Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues.go create mode 100755 Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues_test.go create mode 100755 Algorithms/0226.invert-binary-tree/README.md create mode 100755 Algorithms/0226.invert-binary-tree/invert-binary-tree.go create mode 100755 Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go create mode 100755 Algorithms/0227.basic-calculator-ii/README.md create mode 100755 Algorithms/0227.basic-calculator-ii/basic-calculator-ii.go create mode 100755 Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go create mode 100755 Algorithms/0228.summary-ranges/README.md create mode 100755 Algorithms/0228.summary-ranges/summary-ranges.go create mode 100755 Algorithms/0228.summary-ranges/summary-ranges_test.go create mode 100755 Algorithms/0229.majority-element-ii/README.md create mode 100755 Algorithms/0229.majority-element-ii/majority-element-ii.go create mode 100755 Algorithms/0229.majority-element-ii/majority-element-ii_test.go create mode 100755 Algorithms/0230.kth-smallest-element-in-a-bst/README.md create mode 100755 Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.go create mode 100755 Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst_test.go create mode 100755 Algorithms/0231.power-of-two/README.md create mode 100755 Algorithms/0231.power-of-two/power-of-two.go create mode 100755 Algorithms/0231.power-of-two/power-of-two_test.go create mode 100755 Algorithms/0232.implement-queue-using-stacks/README.md create mode 100755 Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks.go create mode 100755 Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks_test.go create mode 100755 Algorithms/0233.number-of-digit-one/README.md create mode 100755 Algorithms/0233.number-of-digit-one/number-of-digit-one.go create mode 100755 Algorithms/0233.number-of-digit-one/number-of-digit-one_test.go create mode 100755 Algorithms/0234.palindrome-linked-list/README.md create mode 100755 Algorithms/0234.palindrome-linked-list/palindrome-linked-list.go create mode 100755 Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go create mode 100755 Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/README.md create mode 100755 Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.go create mode 100755 Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree_test.go create mode 100755 Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/README.md create mode 100755 Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree.go create mode 100755 Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree_test.go create mode 100755 Algorithms/0237.delete-node-in-a-linked-list/README.md create mode 100755 Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list.go create mode 100755 Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list_test.go create mode 100755 Algorithms/0238.product-of-array-except-self/README.md create mode 100755 Algorithms/0238.product-of-array-except-self/product-of-array-except-self.go create mode 100755 Algorithms/0238.product-of-array-except-self/product-of-array-except-self_test.go create mode 100755 Algorithms/0239.sliding-window-maximum/README.md create mode 100755 Algorithms/0239.sliding-window-maximum/sliding-window-maximum.go create mode 100755 Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go create mode 100755 Algorithms/0240.search-a-2d-matrix-ii/README.md create mode 100755 Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii.go create mode 100755 Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii_test.go create mode 100755 Algorithms/0241.different-ways-to-add-parentheses/README.md create mode 100755 Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses.go create mode 100755 Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses_test.go create mode 100755 Algorithms/0242.valid-anagram/README.md create mode 100755 Algorithms/0242.valid-anagram/valid-anagram.go create mode 100755 Algorithms/0242.valid-anagram/valid-anagram_test.go create mode 100755 Algorithms/0243.shortest-word-distance/README.md create mode 100755 Algorithms/0243.shortest-word-distance/shortest-word-distance.go create mode 100755 Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go create mode 100755 Algorithms/0244.shortest-word-distance-ii/README.md create mode 100755 Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii.go create mode 100755 Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii_test.go create mode 100755 Algorithms/0245.shortest-word-distance-iii/README.md create mode 100755 Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii.go create mode 100755 Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii_test.go create mode 100755 Algorithms/0246.strobogrammatic-number/README.md create mode 100755 Algorithms/0246.strobogrammatic-number/strobogrammatic-number.go create mode 100755 Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go create mode 100755 Algorithms/0247.strobogrammatic-number-ii/README.md create mode 100755 Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii.go create mode 100755 Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go create mode 100755 Algorithms/0248.strobogrammatic-number-iii/README.md create mode 100755 Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii.go create mode 100755 Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go create mode 100755 Algorithms/0249.group-shifted-strings/README.md create mode 100755 Algorithms/0249.group-shifted-strings/group-shifted-strings.go create mode 100755 Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go create mode 100755 Algorithms/0250.count-univalue-subtrees/README.md create mode 100755 Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees.go create mode 100755 Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go create mode 100755 Algorithms/0251.flatten-2d-vector/README.md create mode 100755 Algorithms/0251.flatten-2d-vector/flatten-2d-vector.go create mode 100755 Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go create mode 100755 Algorithms/0252.meeting-rooms/README.md create mode 100755 Algorithms/0252.meeting-rooms/meeting-rooms.go create mode 100755 Algorithms/0252.meeting-rooms/meeting-rooms_test.go create mode 100755 Algorithms/0253.meeting-rooms-ii/README.md create mode 100755 Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii.go create mode 100755 Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go create mode 100755 Algorithms/0254.factor-combinations/README.md create mode 100755 Algorithms/0254.factor-combinations/factor-combinations.go create mode 100755 Algorithms/0254.factor-combinations/factor-combinations_test.go create mode 100755 Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/README.md create mode 100755 Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree.go create mode 100755 Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree_test.go create mode 100755 Algorithms/0256.paint-house/README.md create mode 100755 Algorithms/0256.paint-house/paint-house.go create mode 100755 Algorithms/0256.paint-house/paint-house_test.go create mode 100755 Algorithms/0257.binary-tree-paths/README.md create mode 100755 Algorithms/0257.binary-tree-paths/binary-tree-paths.go create mode 100755 Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go create mode 100755 Algorithms/0258.add-digits/README.md create mode 100755 Algorithms/0258.add-digits/add-digits.go create mode 100755 Algorithms/0258.add-digits/add-digits_test.go create mode 100755 Algorithms/0259.3sum-smaller/3sum-smaller.go create mode 100755 Algorithms/0259.3sum-smaller/3sum-smaller_test.go create mode 100755 Algorithms/0259.3sum-smaller/README.md create mode 100755 Algorithms/0260.single-number-iii/README.md create mode 100755 Algorithms/0260.single-number-iii/single-number-iii.go create mode 100755 Algorithms/0260.single-number-iii/single-number-iii_test.go create mode 100755 Algorithms/0261.graph-valid-tree/README.md create mode 100755 Algorithms/0261.graph-valid-tree/graph-valid-tree.go create mode 100755 Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go create mode 100755 Algorithms/0263.ugly-number/README.md create mode 100755 Algorithms/0263.ugly-number/ugly-number.go create mode 100755 Algorithms/0263.ugly-number/ugly-number_test.go create mode 100755 Algorithms/0264.ugly-number-ii/README.md create mode 100755 Algorithms/0264.ugly-number-ii/ugly-number-ii.go create mode 100755 Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go create mode 100755 Algorithms/0265.paint-house-ii/README.md create mode 100755 Algorithms/0265.paint-house-ii/paint-house-ii.go create mode 100755 Algorithms/0265.paint-house-ii/paint-house-ii_test.go create mode 100755 Algorithms/0266.palindrome-permutation/README.md create mode 100755 Algorithms/0266.palindrome-permutation/palindrome-permutation.go create mode 100755 Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go create mode 100755 Algorithms/0267.palindrome-permutation-ii/README.md create mode 100755 Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii.go create mode 100755 Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go create mode 100755 Algorithms/0268.missing-number/README.md create mode 100755 Algorithms/0268.missing-number/missing-number.go create mode 100755 Algorithms/0268.missing-number/missing-number_test.go create mode 100755 Algorithms/0269.alien-dictionary/README.md create mode 100755 Algorithms/0269.alien-dictionary/alien-dictionary.go create mode 100755 Algorithms/0269.alien-dictionary/alien-dictionary_test.go create mode 100755 Algorithms/0270.closest-binary-search-tree-value/README.md create mode 100755 Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value.go create mode 100755 Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value_test.go create mode 100755 Algorithms/0271.encode-and-decode-strings/README.md create mode 100755 Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings.go create mode 100755 Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings_test.go create mode 100755 Algorithms/0272.closest-binary-search-tree-value-ii/README.md create mode 100755 Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii.go create mode 100755 Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii_test.go create mode 100755 Algorithms/0273.integer-to-english-words/README.md create mode 100755 Algorithms/0273.integer-to-english-words/integer-to-english-words.go create mode 100755 Algorithms/0273.integer-to-english-words/integer-to-english-words_test.go create mode 100755 Algorithms/0274.h-index/README.md create mode 100755 Algorithms/0274.h-index/h-index.go create mode 100755 Algorithms/0274.h-index/h-index_test.go create mode 100755 Algorithms/0275.h-index-ii/README.md create mode 100755 Algorithms/0275.h-index-ii/h-index-ii.go create mode 100755 Algorithms/0275.h-index-ii/h-index-ii_test.go create mode 100755 Algorithms/0276.paint-fence/README.md create mode 100755 Algorithms/0276.paint-fence/paint-fence.go create mode 100755 Algorithms/0276.paint-fence/paint-fence_test.go create mode 100755 Algorithms/0277.find-the-celebrity/README.md create mode 100755 Algorithms/0277.find-the-celebrity/find-the-celebrity.go create mode 100755 Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go create mode 100755 Algorithms/0278.first-bad-version/README.md create mode 100755 Algorithms/0278.first-bad-version/first-bad-version.go create mode 100755 Algorithms/0278.first-bad-version/first-bad-version_test.go create mode 100755 Algorithms/0279.perfect-squares/README.md create mode 100755 Algorithms/0279.perfect-squares/perfect-squares.go create mode 100755 Algorithms/0279.perfect-squares/perfect-squares_test.go create mode 100755 Algorithms/0280.wiggle-sort/README.md create mode 100755 Algorithms/0280.wiggle-sort/wiggle-sort.go create mode 100755 Algorithms/0280.wiggle-sort/wiggle-sort_test.go create mode 100755 Algorithms/0281.zigzag-iterator/README.md create mode 100755 Algorithms/0281.zigzag-iterator/zigzag-iterator.go create mode 100755 Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go create mode 100755 Algorithms/0282.expression-add-operators/README.md create mode 100755 Algorithms/0282.expression-add-operators/expression-add-operators.go create mode 100755 Algorithms/0282.expression-add-operators/expression-add-operators_test.go create mode 100755 Algorithms/0283.move-zeroes/README.md create mode 100755 Algorithms/0283.move-zeroes/move-zeroes.go create mode 100755 Algorithms/0283.move-zeroes/move-zeroes_test.go create mode 100755 Algorithms/0284.peeking-iterator/README.md create mode 100755 Algorithms/0284.peeking-iterator/peeking-iterator.go create mode 100755 Algorithms/0284.peeking-iterator/peeking-iterator_test.go create mode 100755 Algorithms/0285.inorder-successor-in-bst/README.md create mode 100755 Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst.go create mode 100755 Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst_test.go create mode 100755 Algorithms/0286.walls-and-gates/README.md create mode 100755 Algorithms/0286.walls-and-gates/walls-and-gates.go create mode 100755 Algorithms/0286.walls-and-gates/walls-and-gates_test.go create mode 100755 Algorithms/0287.find-the-duplicate-number/README.md create mode 100755 Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number.go create mode 100755 Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number_test.go create mode 100755 Algorithms/0288.unique-word-abbreviation/README.md create mode 100755 Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation.go create mode 100755 Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go create mode 100755 Algorithms/0289.game-of-life/README.md create mode 100755 Algorithms/0289.game-of-life/game-of-life.go create mode 100755 Algorithms/0289.game-of-life/game-of-life_test.go create mode 100755 Algorithms/0290.word-pattern/README.md create mode 100755 Algorithms/0290.word-pattern/word-pattern.go create mode 100755 Algorithms/0290.word-pattern/word-pattern_test.go create mode 100755 Algorithms/0291.word-pattern-ii/README.md create mode 100755 Algorithms/0291.word-pattern-ii/word-pattern-ii.go create mode 100755 Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go create mode 100755 Algorithms/0292.nim-game/README.md create mode 100755 Algorithms/0292.nim-game/nim-game.go create mode 100755 Algorithms/0292.nim-game/nim-game_test.go create mode 100755 Algorithms/0293.flip-game/README.md create mode 100755 Algorithms/0293.flip-game/flip-game.go create mode 100755 Algorithms/0293.flip-game/flip-game_test.go create mode 100755 Algorithms/0294.flip-game-ii/README.md create mode 100755 Algorithms/0294.flip-game-ii/flip-game-ii.go create mode 100755 Algorithms/0294.flip-game-ii/flip-game-ii_test.go create mode 100755 Algorithms/0295.find-median-from-data-stream/README.md create mode 100755 Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream.go create mode 100755 Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream_test.go create mode 100755 Algorithms/0296.best-meeting-point/README.md create mode 100755 Algorithms/0296.best-meeting-point/best-meeting-point.go create mode 100755 Algorithms/0296.best-meeting-point/best-meeting-point_test.go create mode 100755 Algorithms/0297.serialize-and-deserialize-binary-tree/README.md create mode 100755 Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree.go create mode 100755 Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree_test.go create mode 100755 Algorithms/0298.binary-tree-longest-consecutive-sequence/README.md create mode 100755 Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence.go create mode 100755 Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence_test.go create mode 100755 Algorithms/0299.bulls-and-cows/README.md create mode 100755 Algorithms/0299.bulls-and-cows/bulls-and-cows.go create mode 100755 Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go create mode 100755 Algorithms/0300.longest-increasing-subsequence/README.md create mode 100755 Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence.go create mode 100755 Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go create mode 100755 Algorithms/0301.remove-invalid-parentheses/README.md create mode 100755 Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses.go create mode 100755 Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go create mode 100755 Algorithms/0302.smallest-rectangle-enclosing-black-pixels/README.md create mode 100755 Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels.go create mode 100755 Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels_test.go create mode 100755 Algorithms/0303.range-sum-query-immutable/README.md create mode 100755 Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable.go create mode 100755 Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable_test.go create mode 100755 Algorithms/0304.range-sum-query-2d-immutable/README.md create mode 100755 Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable.go create mode 100755 Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable_test.go create mode 100755 Algorithms/0305.number-of-islands-ii/README.md create mode 100755 Algorithms/0305.number-of-islands-ii/number-of-islands-ii.go create mode 100755 Algorithms/0305.number-of-islands-ii/number-of-islands-ii_test.go create mode 100755 Algorithms/0306.additive-number/README.md create mode 100755 Algorithms/0306.additive-number/additive-number.go create mode 100755 Algorithms/0306.additive-number/additive-number_test.go create mode 100755 Algorithms/0307.range-sum-query-mutable/README.md create mode 100755 Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable.go create mode 100755 Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable_test.go create mode 100755 Algorithms/0308.range-sum-query-2d-mutable/README.md create mode 100755 Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable.go create mode 100755 Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable_test.go create mode 100755 Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/README.md create mode 100755 Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown.go create mode 100755 Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown_test.go create mode 100755 Algorithms/0310.minimum-height-trees/README.md create mode 100755 Algorithms/0310.minimum-height-trees/minimum-height-trees.go create mode 100755 Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go create mode 100755 Algorithms/0311.sparse-matrix-multiplication/README.md create mode 100755 Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication.go create mode 100755 Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go create mode 100755 Algorithms/0312.burst-balloons/README.md create mode 100755 Algorithms/0312.burst-balloons/burst-balloons.go create mode 100755 Algorithms/0312.burst-balloons/burst-balloons_test.go create mode 100755 Algorithms/0313.super-ugly-number/README.md create mode 100755 Algorithms/0313.super-ugly-number/super-ugly-number.go create mode 100755 Algorithms/0313.super-ugly-number/super-ugly-number_test.go create mode 100755 Algorithms/0314.binary-tree-vertical-order-traversal/README.md create mode 100755 Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal.go create mode 100755 Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal_test.go create mode 100755 Algorithms/0315.count-of-smaller-numbers-after-self/README.md create mode 100755 Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self.go create mode 100755 Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self_test.go create mode 100755 Algorithms/0316.remove-duplicate-letters/README.md create mode 100755 Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters.go create mode 100755 Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go create mode 100755 Algorithms/0317.shortest-distance-from-all-buildings/README.md create mode 100755 Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings.go create mode 100755 Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings_test.go create mode 100755 Algorithms/0318.maximum-product-of-word-lengths/README.md create mode 100755 Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths.go create mode 100755 Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths_test.go create mode 100755 Algorithms/0319.bulb-switcher/README.md create mode 100755 Algorithms/0319.bulb-switcher/bulb-switcher.go create mode 100755 Algorithms/0319.bulb-switcher/bulb-switcher_test.go create mode 100755 Algorithms/0320.generalized-abbreviation/README.md create mode 100755 Algorithms/0320.generalized-abbreviation/generalized-abbreviation.go create mode 100755 Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go create mode 100755 Algorithms/0321.create-maximum-number/README.md create mode 100755 Algorithms/0321.create-maximum-number/create-maximum-number.go create mode 100755 Algorithms/0321.create-maximum-number/create-maximum-number_test.go create mode 100755 Algorithms/0322.coin-change/README.md create mode 100755 Algorithms/0322.coin-change/coin-change.go create mode 100755 Algorithms/0322.coin-change/coin-change_test.go create mode 100755 Algorithms/0323.number-of-connected-components-in-an-undirected-graph/README.md create mode 100755 Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph.go create mode 100755 Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph_test.go create mode 100755 Algorithms/0324.wiggle-sort-ii/README.md create mode 100755 Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii.go create mode 100755 Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go create mode 100755 Algorithms/0325.maximum-size-subarray-sum-equals-k/README.md create mode 100755 Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k.go create mode 100755 Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k_test.go create mode 100755 Algorithms/0326.power-of-three/README.md create mode 100755 Algorithms/0326.power-of-three/power-of-three.go create mode 100755 Algorithms/0326.power-of-three/power-of-three_test.go create mode 100755 Algorithms/0327.count-of-range-sum/README.md create mode 100755 Algorithms/0327.count-of-range-sum/count-of-range-sum.go create mode 100755 Algorithms/0327.count-of-range-sum/count-of-range-sum_test.go create mode 100755 Algorithms/0328.odd-even-linked-list/README.md create mode 100755 Algorithms/0328.odd-even-linked-list/odd-even-linked-list.go create mode 100755 Algorithms/0328.odd-even-linked-list/odd-even-linked-list_test.go create mode 100755 Algorithms/0329.longest-increasing-path-in-a-matrix/README.md create mode 100755 Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix.go create mode 100755 Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix_test.go create mode 100755 Algorithms/0330.patching-array/README.md create mode 100755 Algorithms/0330.patching-array/patching-array.go create mode 100755 Algorithms/0330.patching-array/patching-array_test.go create mode 100755 Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/README.md create mode 100755 Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree.go create mode 100755 Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree_test.go create mode 100755 Algorithms/0332.reconstruct-itinerary/README.md create mode 100755 Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary.go create mode 100755 Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go create mode 100755 Algorithms/0333.largest-bst-subtree/README.md create mode 100755 Algorithms/0333.largest-bst-subtree/largest-bst-subtree.go create mode 100755 Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go create mode 100755 Algorithms/0334.increasing-triplet-subsequence/README.md create mode 100755 Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence.go create mode 100755 Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go create mode 100755 Algorithms/0335.self-crossing/README.md create mode 100755 Algorithms/0335.self-crossing/self-crossing.go create mode 100755 Algorithms/0335.self-crossing/self-crossing_test.go create mode 100755 Algorithms/0336.palindrome-pairs/README.md create mode 100755 Algorithms/0336.palindrome-pairs/palindrome-pairs.go create mode 100755 Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go create mode 100755 Algorithms/0337.house-robber-iii/README.md create mode 100755 Algorithms/0337.house-robber-iii/house-robber-iii.go create mode 100755 Algorithms/0337.house-robber-iii/house-robber-iii_test.go create mode 100755 Algorithms/0338.counting-bits/README.md create mode 100755 Algorithms/0338.counting-bits/counting-bits.go create mode 100755 Algorithms/0338.counting-bits/counting-bits_test.go create mode 100755 Algorithms/0339.nested-list-weight-sum/README.md create mode 100755 Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum.go create mode 100755 Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum_test.go create mode 100755 Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/README.md create mode 100755 Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters.go create mode 100755 Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters_test.go create mode 100755 Algorithms/0341.flatten-nested-list-iterator/README.md create mode 100755 Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator.go create mode 100755 Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator_test.go create mode 100755 Algorithms/0342.power-of-four/README.md create mode 100755 Algorithms/0342.power-of-four/power-of-four.go create mode 100755 Algorithms/0342.power-of-four/power-of-four_test.go create mode 100755 Algorithms/0343.integer-break/README.md create mode 100755 Algorithms/0343.integer-break/integer-break.go create mode 100755 Algorithms/0343.integer-break/integer-break_test.go create mode 100755 Algorithms/0344.reverse-string/README.md create mode 100755 Algorithms/0344.reverse-string/reverse-string.go create mode 100755 Algorithms/0344.reverse-string/reverse-string_test.go create mode 100755 Algorithms/0345.reverse-vowels-of-a-string/README.md create mode 100755 Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string.go create mode 100755 Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string_test.go create mode 100755 Algorithms/0346.moving-average-from-data-stream/README.md create mode 100755 Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream.go create mode 100755 Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream_test.go create mode 100755 Algorithms/0347.top-k-frequent-elements/README.md create mode 100755 Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements.go create mode 100755 Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements_test.go create mode 100755 Algorithms/0348.design-tic-tac-toe/README.md create mode 100755 Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe.go create mode 100755 Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe_test.go create mode 100755 Algorithms/0349.intersection-of-two-arrays/README.md create mode 100755 Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays.go create mode 100755 Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays_test.go create mode 100755 Algorithms/0350.intersection-of-two-arrays-ii/README.md create mode 100755 Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.go create mode 100755 Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii_test.go create mode 100755 Algorithms/0351.android-unlock-patterns/README.md create mode 100755 Algorithms/0351.android-unlock-patterns/android-unlock-patterns.go create mode 100755 Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go create mode 100755 Algorithms/0352.data-stream-as-disjoint-intervals/README.md create mode 100755 Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals.go create mode 100755 Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals_test.go create mode 100755 Algorithms/0353.design-snake-game/README.md create mode 100755 Algorithms/0353.design-snake-game/design-snake-game.go create mode 100755 Algorithms/0353.design-snake-game/design-snake-game_test.go create mode 100755 Algorithms/0354.russian-doll-envelopes/README.md create mode 100755 Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes.go create mode 100755 Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go create mode 100755 Algorithms/0355.design-twitter/README.md create mode 100755 Algorithms/0355.design-twitter/design-twitter.go create mode 100755 Algorithms/0355.design-twitter/design-twitter_test.go create mode 100755 Algorithms/0356.line-reflection/README.md create mode 100755 Algorithms/0356.line-reflection/line-reflection.go create mode 100755 Algorithms/0356.line-reflection/line-reflection_test.go create mode 100755 Algorithms/0357.count-numbers-with-unique-digits/README.md create mode 100755 Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits.go create mode 100755 Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits_test.go create mode 100755 Algorithms/0358.rearrange-string-k-distance-apart/README.md create mode 100755 Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart.go create mode 100755 Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart_test.go create mode 100755 Algorithms/0359.logger-rate-limiter/README.md create mode 100755 Algorithms/0359.logger-rate-limiter/logger-rate-limiter.go create mode 100755 Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go create mode 100755 Algorithms/0360.sort-transformed-array/README.md create mode 100755 Algorithms/0360.sort-transformed-array/sort-transformed-array.go create mode 100755 Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go create mode 100755 Algorithms/0361.bomb-enemy/README.md create mode 100755 Algorithms/0361.bomb-enemy/bomb-enemy.go create mode 100755 Algorithms/0361.bomb-enemy/bomb-enemy_test.go create mode 100755 Algorithms/0362.design-hit-counter/README.md create mode 100755 Algorithms/0362.design-hit-counter/design-hit-counter.go create mode 100755 Algorithms/0362.design-hit-counter/design-hit-counter_test.go create mode 100755 Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/README.md create mode 100755 Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k.go create mode 100755 Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k_test.go create mode 100755 Algorithms/0364.nested-list-weight-sum-ii/README.md create mode 100755 Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii.go create mode 100755 Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii_test.go create mode 100755 Algorithms/0365.water-and-jug-problem/README.md create mode 100755 Algorithms/0365.water-and-jug-problem/water-and-jug-problem.go create mode 100755 Algorithms/0365.water-and-jug-problem/water-and-jug-problem_test.go create mode 100755 Algorithms/0366.find-leaves-of-binary-tree/README.md create mode 100755 Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree.go create mode 100755 Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree_test.go create mode 100755 Algorithms/0367.valid-perfect-square/README.md create mode 100755 Algorithms/0367.valid-perfect-square/valid-perfect-square.go create mode 100755 Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go create mode 100755 Algorithms/0368.largest-divisible-subset/README.md create mode 100755 Algorithms/0368.largest-divisible-subset/largest-divisible-subset.go create mode 100755 Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go create mode 100755 Algorithms/0369.plus-one-linked-list/README.md create mode 100755 Algorithms/0369.plus-one-linked-list/plus-one-linked-list.go create mode 100755 Algorithms/0369.plus-one-linked-list/plus-one-linked-list_test.go create mode 100755 Algorithms/0370.range-addition/README.md create mode 100755 Algorithms/0370.range-addition/range-addition.go create mode 100755 Algorithms/0370.range-addition/range-addition_test.go create mode 100755 Algorithms/0371.sum-of-two-integers/README.md create mode 100755 Algorithms/0371.sum-of-two-integers/sum-of-two-integers.go create mode 100755 Algorithms/0371.sum-of-two-integers/sum-of-two-integers_test.go create mode 100755 Algorithms/0372.super-pow/README.md create mode 100755 Algorithms/0372.super-pow/super-pow.go create mode 100755 Algorithms/0372.super-pow/super-pow_test.go create mode 100755 Algorithms/0373.find-k-pairs-with-smallest-sums/README.md create mode 100755 Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums.go create mode 100755 Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums_test.go create mode 100755 Algorithms/0374.guess-number-higher-or-lower/README.md create mode 100755 Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower.go create mode 100755 Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower_test.go create mode 100755 Algorithms/0375.guess-number-higher-or-lower-ii/README.md create mode 100755 Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii.go create mode 100755 Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii_test.go create mode 100755 Algorithms/0376.wiggle-subsequence/README.md create mode 100755 Algorithms/0376.wiggle-subsequence/wiggle-subsequence.go create mode 100755 Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go create mode 100755 Algorithms/0377.combination-sum-iv/README.md create mode 100755 Algorithms/0377.combination-sum-iv/combination-sum-iv.go create mode 100755 Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go create mode 100755 Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/README.md create mode 100755 Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix.go create mode 100755 Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix_test.go create mode 100755 Algorithms/0379.design-phone-directory/README.md create mode 100755 Algorithms/0379.design-phone-directory/design-phone-directory.go create mode 100755 Algorithms/0379.design-phone-directory/design-phone-directory_test.go create mode 100755 Algorithms/0380.insert-delete-getrandom-o1/README.md create mode 100755 Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1.go create mode 100755 Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1_test.go create mode 100755 Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/README.md create mode 100755 Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed.go create mode 100755 Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed_test.go create mode 100755 Algorithms/0382.linked-list-random-node/README.md create mode 100755 Algorithms/0382.linked-list-random-node/linked-list-random-node.go create mode 100755 Algorithms/0382.linked-list-random-node/linked-list-random-node_test.go create mode 100755 Algorithms/0383.ransom-note/README.md create mode 100755 Algorithms/0383.ransom-note/ransom-note.go create mode 100755 Algorithms/0383.ransom-note/ransom-note_test.go create mode 100755 Algorithms/0384.shuffle-an-array/README.md create mode 100755 Algorithms/0384.shuffle-an-array/shuffle-an-array.go create mode 100755 Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go create mode 100755 Algorithms/0385.mini-parser/README.md create mode 100755 Algorithms/0385.mini-parser/mini-parser.go create mode 100755 Algorithms/0385.mini-parser/mini-parser_test.go create mode 100755 Algorithms/0386.lexicographical-numbers/README.md create mode 100755 Algorithms/0386.lexicographical-numbers/lexicographical-numbers.go create mode 100755 Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go create mode 100755 Algorithms/0387.first-unique-character-in-a-string/README.md create mode 100755 Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string.go create mode 100755 Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string_test.go create mode 100755 Algorithms/0388.longest-absolute-file-path/README.md create mode 100755 Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path.go create mode 100755 Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path_test.go create mode 100755 Algorithms/0389.find-the-difference/README.md create mode 100755 Algorithms/0389.find-the-difference/find-the-difference.go create mode 100755 Algorithms/0389.find-the-difference/find-the-difference_test.go create mode 100755 Algorithms/0390.elimination-game/README.md create mode 100755 Algorithms/0390.elimination-game/elimination-game.go create mode 100755 Algorithms/0390.elimination-game/elimination-game_test.go create mode 100755 Algorithms/0391.perfect-rectangle/README.md create mode 100755 Algorithms/0391.perfect-rectangle/perfect-rectangle.go create mode 100755 Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go create mode 100755 Algorithms/0392.is-subsequence/README.md create mode 100755 Algorithms/0392.is-subsequence/is-subsequence.go create mode 100755 Algorithms/0392.is-subsequence/is-subsequence_test.go create mode 100755 Algorithms/0393.utf-8-validation/README.md create mode 100755 Algorithms/0393.utf-8-validation/utf-8-validation.go create mode 100755 Algorithms/0393.utf-8-validation/utf-8-validation_test.go create mode 100755 Algorithms/0394.decode-string/README.md create mode 100755 Algorithms/0394.decode-string/decode-string.go create mode 100755 Algorithms/0394.decode-string/decode-string_test.go create mode 100755 Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/README.md create mode 100755 Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters.go create mode 100755 Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters_test.go create mode 100755 Algorithms/0396.rotate-function/README.md create mode 100755 Algorithms/0396.rotate-function/rotate-function.go create mode 100755 Algorithms/0396.rotate-function/rotate-function_test.go create mode 100755 Algorithms/0397.integer-replacement/README.md create mode 100755 Algorithms/0397.integer-replacement/integer-replacement.go create mode 100755 Algorithms/0397.integer-replacement/integer-replacement_test.go create mode 100755 Algorithms/0398.random-pick-index/README.md create mode 100755 Algorithms/0398.random-pick-index/random-pick-index.go create mode 100755 Algorithms/0398.random-pick-index/random-pick-index_test.go create mode 100755 Algorithms/0399.evaluate-division/README.md create mode 100755 Algorithms/0399.evaluate-division/evaluate-division.go create mode 100755 Algorithms/0399.evaluate-division/evaluate-division_test.go create mode 100755 Algorithms/0400.nth-digit/README.md create mode 100755 Algorithms/0400.nth-digit/nth-digit.go create mode 100755 Algorithms/0400.nth-digit/nth-digit_test.go create mode 100755 Algorithms/0401.binary-watch/README.md create mode 100755 Algorithms/0401.binary-watch/binary-watch.go create mode 100755 Algorithms/0401.binary-watch/binary-watch_test.go create mode 100755 Algorithms/0402.remove-k-digits/README.md create mode 100755 Algorithms/0402.remove-k-digits/remove-k-digits.go create mode 100755 Algorithms/0402.remove-k-digits/remove-k-digits_test.go create mode 100755 Algorithms/0403.frog-jump/README.md create mode 100755 Algorithms/0403.frog-jump/frog-jump.go create mode 100755 Algorithms/0403.frog-jump/frog-jump_test.go create mode 100755 Algorithms/0404.sum-of-left-leaves/README.md create mode 100755 Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves.go create mode 100755 Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves_test.go create mode 100755 Algorithms/0405.convert-a-number-to-hexadecimal/README.md create mode 100755 Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal.go create mode 100755 Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal_test.go create mode 100755 Algorithms/0406.queue-reconstruction-by-height/README.md create mode 100755 Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height.go create mode 100755 Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height_test.go create mode 100755 Algorithms/0407.trapping-rain-water-ii/README.md create mode 100755 Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii.go create mode 100755 Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii_test.go create mode 100755 Algorithms/0408.valid-word-abbreviation/README.md create mode 100755 Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation.go create mode 100755 Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go create mode 100755 Algorithms/0409.longest-palindrome/README.md create mode 100755 Algorithms/0409.longest-palindrome/longest-palindrome.go create mode 100755 Algorithms/0409.longest-palindrome/longest-palindrome_test.go create mode 100755 Algorithms/0410.split-array-largest-sum/README.md create mode 100755 Algorithms/0410.split-array-largest-sum/split-array-largest-sum.go create mode 100755 Algorithms/0410.split-array-largest-sum/split-array-largest-sum_test.go create mode 100755 Algorithms/0411.minimum-unique-word-abbreviation/README.md create mode 100755 Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation.go create mode 100755 Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation_test.go create mode 100755 Algorithms/0412.fizz-buzz/README.md create mode 100755 Algorithms/0412.fizz-buzz/fizz-buzz.go create mode 100755 Algorithms/0412.fizz-buzz/fizz-buzz_test.go create mode 100755 Algorithms/0413.arithmetic-slices/README.md create mode 100755 Algorithms/0413.arithmetic-slices/arithmetic-slices.go create mode 100755 Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go create mode 100755 Algorithms/0414.third-maximum-number/README.md create mode 100755 Algorithms/0414.third-maximum-number/third-maximum-number.go create mode 100755 Algorithms/0414.third-maximum-number/third-maximum-number_test.go create mode 100755 Algorithms/0415.add-strings/README.md create mode 100755 Algorithms/0415.add-strings/add-strings.go create mode 100755 Algorithms/0415.add-strings/add-strings_test.go create mode 100755 Algorithms/0416.partition-equal-subset-sum/README.md create mode 100755 Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum.go create mode 100755 Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum_test.go create mode 100755 Algorithms/0417.pacific-atlantic-water-flow/README.md create mode 100755 Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow.go create mode 100755 Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow_test.go create mode 100755 Algorithms/0418.sentence-screen-fitting/README.md create mode 100755 Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting.go create mode 100755 Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go create mode 100755 Algorithms/0419.battleships-in-a-board/README.md create mode 100755 Algorithms/0419.battleships-in-a-board/battleships-in-a-board.go create mode 100755 Algorithms/0419.battleships-in-a-board/battleships-in-a-board_test.go create mode 100755 Algorithms/0420.strong-password-checker/README.md create mode 100755 Algorithms/0420.strong-password-checker/strong-password-checker.go create mode 100755 Algorithms/0420.strong-password-checker/strong-password-checker_test.go create mode 100755 Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/README.md create mode 100755 Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array.go create mode 100755 Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array_test.go create mode 100755 Algorithms/0422.valid-word-square/README.md create mode 100755 Algorithms/0422.valid-word-square/valid-word-square.go create mode 100755 Algorithms/0422.valid-word-square/valid-word-square_test.go create mode 100755 Algorithms/0423.reconstruct-original-digits-from-english/README.md create mode 100755 Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english.go create mode 100755 Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english_test.go create mode 100755 Algorithms/0424.longest-repeating-character-replacement/README.md create mode 100755 Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement.go create mode 100755 Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement_test.go create mode 100755 Algorithms/0425.word-squares/README.md create mode 100755 Algorithms/0425.word-squares/word-squares.go create mode 100755 Algorithms/0425.word-squares/word-squares_test.go create mode 100755 Algorithms/0432.all-oone-data-structure/README.md create mode 100755 Algorithms/0432.all-oone-data-structure/all-oone-data-structure.go create mode 100755 Algorithms/0432.all-oone-data-structure/all-oone-data-structure_test.go create mode 100755 Algorithms/0434.number-of-segments-in-a-string/README.md create mode 100755 Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string.go create mode 100755 Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string_test.go create mode 100755 Algorithms/0435.non-overlapping-intervals/README.md create mode 100755 Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals.go create mode 100755 Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go create mode 100755 Algorithms/0436.find-right-interval/README.md create mode 100755 Algorithms/0436.find-right-interval/find-right-interval.go create mode 100755 Algorithms/0436.find-right-interval/find-right-interval_test.go create mode 100755 Algorithms/0437.path-sum-iii/README.md create mode 100755 Algorithms/0437.path-sum-iii/path-sum-iii.go create mode 100755 Algorithms/0437.path-sum-iii/path-sum-iii_test.go create mode 100755 Algorithms/0438.find-all-anagrams-in-a-string/README.md create mode 100755 Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string.go create mode 100755 Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string_test.go create mode 100755 Algorithms/0439.ternary-expression-parser/README.md create mode 100755 Algorithms/0439.ternary-expression-parser/ternary-expression-parser.go create mode 100755 Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go create mode 100755 Algorithms/0440.k-th-smallest-in-lexicographical-order/README.md create mode 100755 Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order.go create mode 100755 Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order_test.go create mode 100755 Algorithms/0441.arranging-coins/README.md create mode 100755 Algorithms/0441.arranging-coins/arranging-coins.go create mode 100755 Algorithms/0441.arranging-coins/arranging-coins_test.go create mode 100755 Algorithms/0442.find-all-duplicates-in-an-array/README.md create mode 100755 Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.go create mode 100755 Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array_test.go create mode 100755 Algorithms/0444.sequence-reconstruction/README.md create mode 100755 Algorithms/0444.sequence-reconstruction/sequence-reconstruction.go create mode 100755 Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go create mode 100755 Algorithms/0445.add-two-numbers-ii/README.md create mode 100755 Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii.go create mode 100755 Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii_test.go create mode 100755 Algorithms/0446.arithmetic-slices-ii-subsequence/README.md create mode 100755 Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence.go create mode 100755 Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence_test.go create mode 100755 Algorithms/0447.number-of-boomerangs/README.md create mode 100755 Algorithms/0447.number-of-boomerangs/number-of-boomerangs.go create mode 100755 Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go create mode 100755 Algorithms/0448.find-all-numbers-disappeared-in-an-array/README.md create mode 100755 Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array.go create mode 100755 Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array_test.go create mode 100755 Algorithms/0449.serialize-and-deserialize-bst/README.md create mode 100755 Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst.go create mode 100755 Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst_test.go create mode 100755 Algorithms/0450.delete-node-in-a-bst/README.md create mode 100755 Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst.go create mode 100755 Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst_test.go create mode 100755 Algorithms/0451.sort-characters-by-frequency/README.md create mode 100755 Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency.go create mode 100755 Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency_test.go create mode 100755 Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/README.md create mode 100755 Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons.go create mode 100755 Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons_test.go create mode 100755 Algorithms/0453.minimum-moves-to-equal-array-elements/README.md create mode 100755 Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements.go create mode 100755 Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements_test.go create mode 100755 Algorithms/0454.4sum-ii/4sum-ii.go create mode 100755 Algorithms/0454.4sum-ii/4sum-ii_test.go create mode 100755 Algorithms/0454.4sum-ii/README.md create mode 100755 Algorithms/0455.assign-cookies/README.md create mode 100755 Algorithms/0455.assign-cookies/assign-cookies.go create mode 100755 Algorithms/0455.assign-cookies/assign-cookies_test.go create mode 100755 Algorithms/0456.132-pattern/132-pattern.go create mode 100755 Algorithms/0456.132-pattern/132-pattern_test.go create mode 100755 Algorithms/0456.132-pattern/README.md create mode 100755 Algorithms/0459.repeated-substring-pattern/README.md create mode 100755 Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern.go create mode 100755 Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go create mode 100755 Algorithms/0460.lfu-cache/README.md create mode 100755 Algorithms/0460.lfu-cache/lfu-cache.go create mode 100755 Algorithms/0460.lfu-cache/lfu-cache_test.go create mode 100755 Algorithms/0461.hamming-distance/README.md create mode 100755 Algorithms/0461.hamming-distance/hamming-distance.go create mode 100755 Algorithms/0461.hamming-distance/hamming-distance_test.go create mode 100755 Algorithms/0462.minimum-moves-to-equal-array-elements-ii/README.md create mode 100755 Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii.go create mode 100755 Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii_test.go create mode 100755 Algorithms/0463.island-perimeter/README.md create mode 100755 Algorithms/0463.island-perimeter/island-perimeter.go create mode 100755 Algorithms/0463.island-perimeter/island-perimeter_test.go create mode 100755 Algorithms/0464.can-i-win/README.md create mode 100755 Algorithms/0464.can-i-win/can-i-win.go create mode 100755 Algorithms/0464.can-i-win/can-i-win_test.go create mode 100755 Algorithms/0465.optimal-account-balancing/README.md create mode 100755 Algorithms/0465.optimal-account-balancing/optimal-account-balancing.go create mode 100755 Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go create mode 100755 Algorithms/0466.count-the-repetitions/README.md create mode 100755 Algorithms/0466.count-the-repetitions/count-the-repetitions.go create mode 100755 Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go create mode 100755 Algorithms/0467.unique-substrings-in-wraparound-string/README.md create mode 100755 Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string.go create mode 100755 Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string_test.go create mode 100755 Algorithms/0468.validate-ip-address/README.md create mode 100755 Algorithms/0468.validate-ip-address/validate-ip-address.go create mode 100755 Algorithms/0468.validate-ip-address/validate-ip-address_test.go create mode 100755 Algorithms/0469.convex-polygon/README.md create mode 100755 Algorithms/0469.convex-polygon/convex-polygon.go create mode 100755 Algorithms/0469.convex-polygon/convex-polygon_test.go create mode 100755 Algorithms/0471.encode-string-with-shortest-length/README.md create mode 100755 Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length.go create mode 100755 Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length_test.go create mode 100755 Algorithms/0472.concatenated-words/README.md create mode 100755 Algorithms/0472.concatenated-words/concatenated-words.go create mode 100755 Algorithms/0472.concatenated-words/concatenated-words_test.go create mode 100755 Algorithms/0473.matchsticks-to-square/README.md create mode 100755 Algorithms/0473.matchsticks-to-square/matchsticks-to-square.go create mode 100755 Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go create mode 100755 Algorithms/0474.ones-and-zeroes/README.md create mode 100755 Algorithms/0474.ones-and-zeroes/ones-and-zeroes.go create mode 100755 Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go create mode 100755 Algorithms/0475.heaters/README.md create mode 100755 Algorithms/0475.heaters/heaters.go create mode 100755 Algorithms/0475.heaters/heaters_test.go create mode 100755 Algorithms/0476.number-complement/README.md create mode 100755 Algorithms/0476.number-complement/number-complement.go create mode 100755 Algorithms/0476.number-complement/number-complement_test.go create mode 100755 Algorithms/0477.total-hamming-distance/README.md create mode 100755 Algorithms/0477.total-hamming-distance/total-hamming-distance.go create mode 100755 Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go create mode 100755 Algorithms/0479.largest-palindrome-product/README.md create mode 100755 Algorithms/0479.largest-palindrome-product/largest-palindrome-product.go create mode 100755 Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go create mode 100755 Algorithms/0480.sliding-window-median/README.md create mode 100755 Algorithms/0480.sliding-window-median/sliding-window-median.go create mode 100755 Algorithms/0480.sliding-window-median/sliding-window-median_test.go create mode 100755 Algorithms/0481.magical-string/README.md create mode 100755 Algorithms/0481.magical-string/magical-string.go create mode 100755 Algorithms/0481.magical-string/magical-string_test.go create mode 100755 Algorithms/0482.license-key-formatting/README.md create mode 100755 Algorithms/0482.license-key-formatting/license-key-formatting.go create mode 100755 Algorithms/0482.license-key-formatting/license-key-formatting_test.go create mode 100755 Algorithms/0483.smallest-good-base/README.md create mode 100755 Algorithms/0483.smallest-good-base/smallest-good-base.go create mode 100755 Algorithms/0483.smallest-good-base/smallest-good-base_test.go create mode 100755 Algorithms/0484.find-permutation/README.md create mode 100755 Algorithms/0484.find-permutation/find-permutation.go create mode 100755 Algorithms/0484.find-permutation/find-permutation_test.go create mode 100755 Algorithms/0485.max-consecutive-ones/README.md create mode 100755 Algorithms/0485.max-consecutive-ones/max-consecutive-ones.go create mode 100755 Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go create mode 100755 Algorithms/0486.predict-the-winner/README.md create mode 100755 Algorithms/0486.predict-the-winner/predict-the-winner.go create mode 100755 Algorithms/0486.predict-the-winner/predict-the-winner_test.go create mode 100755 Algorithms/0487.max-consecutive-ones-ii/README.md create mode 100755 Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii.go create mode 100755 Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii_test.go create mode 100755 Algorithms/0488.zuma-game/README.md create mode 100755 Algorithms/0488.zuma-game/zuma-game.go create mode 100755 Algorithms/0488.zuma-game/zuma-game_test.go create mode 100755 Algorithms/0490.the-maze/README.md create mode 100755 Algorithms/0490.the-maze/the-maze.go create mode 100755 Algorithms/0490.the-maze/the-maze_test.go create mode 100755 Algorithms/0491.increasing-subsequences/README.md create mode 100755 Algorithms/0491.increasing-subsequences/increasing-subsequences.go create mode 100755 Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go create mode 100755 Algorithms/0492.construct-the-rectangle/README.md create mode 100755 Algorithms/0492.construct-the-rectangle/construct-the-rectangle.go create mode 100755 Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go create mode 100755 Algorithms/0493.reverse-pairs/README.md create mode 100755 Algorithms/0493.reverse-pairs/reverse-pairs.go create mode 100755 Algorithms/0493.reverse-pairs/reverse-pairs_test.go create mode 100755 Algorithms/0494.target-sum/README.md create mode 100755 Algorithms/0494.target-sum/target-sum.go create mode 100755 Algorithms/0494.target-sum/target-sum_test.go create mode 100755 Algorithms/0495.teemo-attacking/README.md create mode 100755 Algorithms/0495.teemo-attacking/teemo-attacking.go create mode 100755 Algorithms/0495.teemo-attacking/teemo-attacking_test.go create mode 100755 Algorithms/0496.next-greater-element-i/README.md create mode 100755 Algorithms/0496.next-greater-element-i/next-greater-element-i.go create mode 100755 Algorithms/0496.next-greater-element-i/next-greater-element-i_test.go create mode 100755 Algorithms/0498.diagonal-traverse/README.md create mode 100755 Algorithms/0498.diagonal-traverse/diagonal-traverse.go create mode 100755 Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go create mode 100755 Algorithms/0499.the-maze-iii/README.md create mode 100755 Algorithms/0499.the-maze-iii/the-maze-iii.go create mode 100755 Algorithms/0499.the-maze-iii/the-maze-iii_test.go create mode 100755 Algorithms/0500.keyboard-row/README.md create mode 100755 Algorithms/0500.keyboard-row/keyboard-row.go create mode 100755 Algorithms/0500.keyboard-row/keyboard-row_test.go create mode 100755 Algorithms/0501.find-mode-in-binary-search-tree/README.md create mode 100755 Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree.go create mode 100755 Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree_test.go create mode 100755 Algorithms/0502.ipo/README.md create mode 100755 Algorithms/0502.ipo/ipo.go create mode 100755 Algorithms/0502.ipo/ipo_test.go create mode 100755 Algorithms/0503.next-greater-element-ii/README.md create mode 100755 Algorithms/0503.next-greater-element-ii/next-greater-element-ii.go create mode 100755 Algorithms/0503.next-greater-element-ii/next-greater-element-ii_test.go create mode 100755 Algorithms/0504.base-7/README.md create mode 100755 Algorithms/0504.base-7/base-7.go create mode 100755 Algorithms/0504.base-7/base-7_test.go create mode 100755 Algorithms/0505.the-maze-ii/README.md create mode 100755 Algorithms/0505.the-maze-ii/the-maze-ii.go create mode 100755 Algorithms/0505.the-maze-ii/the-maze-ii_test.go create mode 100755 Algorithms/0506.relative-ranks/README.md create mode 100755 Algorithms/0506.relative-ranks/relative-ranks.go create mode 100755 Algorithms/0506.relative-ranks/relative-ranks_test.go create mode 100755 Algorithms/0507.perfect-number/README.md create mode 100755 Algorithms/0507.perfect-number/perfect-number.go create mode 100755 Algorithms/0507.perfect-number/perfect-number_test.go create mode 100755 Algorithms/0508.most-frequent-subtree-sum/README.md create mode 100755 Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum.go create mode 100755 Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum_test.go create mode 100755 Algorithms/0513.find-bottom-left-tree-value/README.md create mode 100755 Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value.go create mode 100755 Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value_test.go create mode 100755 Algorithms/0514.freedom-trail/README.md create mode 100755 Algorithms/0514.freedom-trail/freedom-trail.go create mode 100755 Algorithms/0514.freedom-trail/freedom-trail_test.go create mode 100755 Algorithms/0515.find-largest-value-in-each-tree-row/README.md create mode 100755 Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row.go create mode 100755 Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row_test.go create mode 100755 Algorithms/0516.longest-palindromic-subsequence/README.md create mode 100755 Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence.go create mode 100755 Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go create mode 100755 Algorithms/0517.super-washing-machines/README.md create mode 100755 Algorithms/0517.super-washing-machines/super-washing-machines.go create mode 100755 Algorithms/0517.super-washing-machines/super-washing-machines_test.go create mode 100755 Algorithms/0520.detect-capital/README.md create mode 100755 Algorithms/0520.detect-capital/detect-capital.go create mode 100755 Algorithms/0520.detect-capital/detect-capital_test.go create mode 100755 Algorithms/0521.longest-uncommon-subsequence-i/README.md create mode 100755 Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i.go create mode 100755 Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i_test.go create mode 100755 Algorithms/0522.longest-uncommon-subsequence-ii/README.md create mode 100755 Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii.go create mode 100755 Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii_test.go create mode 100755 Algorithms/0523.continuous-subarray-sum/README.md create mode 100755 Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum.go create mode 100755 Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go create mode 100755 Algorithms/0524.longest-word-in-dictionary-through-deleting/README.md create mode 100755 Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting.go create mode 100755 Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting_test.go create mode 100755 Algorithms/0525.contiguous-array/README.md create mode 100755 Algorithms/0525.contiguous-array/contiguous-array.go create mode 100755 Algorithms/0525.contiguous-array/contiguous-array_test.go create mode 100755 Algorithms/0526.beautiful-arrangement/README.md create mode 100755 Algorithms/0526.beautiful-arrangement/beautiful-arrangement.go create mode 100755 Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go create mode 100755 Algorithms/0527.word-abbreviation/README.md create mode 100755 Algorithms/0527.word-abbreviation/word-abbreviation.go create mode 100755 Algorithms/0527.word-abbreviation/word-abbreviation_test.go create mode 100755 Algorithms/0529.minesweeper/README.md create mode 100755 Algorithms/0529.minesweeper/minesweeper.go create mode 100755 Algorithms/0529.minesweeper/minesweeper_test.go create mode 100755 Algorithms/0530.minimum-absolute-difference-in-bst/README.md create mode 100755 Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst.go create mode 100755 Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst_test.go create mode 100755 Algorithms/0531.lonely-pixel-i/README.md create mode 100755 Algorithms/0531.lonely-pixel-i/lonely-pixel-i.go create mode 100755 Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go create mode 100755 Algorithms/0532.k-diff-pairs-in-an-array/README.md create mode 100755 Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array.go create mode 100755 Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array_test.go create mode 100755 Algorithms/0533.lonely-pixel-ii/README.md create mode 100755 Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii.go create mode 100755 Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go create mode 100755 Algorithms/0535.encode-and-decode-tinyurl/README.md create mode 100755 Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl.go create mode 100755 Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl_test.go create mode 100755 Algorithms/0536.construct-binary-tree-from-string/README.md create mode 100755 Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string.go create mode 100755 Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string_test.go create mode 100755 Algorithms/0537.complex-number-multiplication/README.md create mode 100755 Algorithms/0537.complex-number-multiplication/complex-number-multiplication.go create mode 100755 Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go create mode 100755 Algorithms/0538.convert-bst-to-greater-tree/README.md create mode 100755 Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree.go create mode 100755 Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree_test.go create mode 100755 Algorithms/0539.minimum-time-difference/README.md create mode 100755 Algorithms/0539.minimum-time-difference/minimum-time-difference.go create mode 100755 Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go create mode 100755 Algorithms/0540.single-element-in-a-sorted-array/README.md create mode 100755 Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array.go create mode 100755 Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array_test.go create mode 100755 Algorithms/0541.reverse-string-ii/README.md create mode 100755 Algorithms/0541.reverse-string-ii/reverse-string-ii.go create mode 100755 Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go create mode 100755 Algorithms/0542.01-matrix/01-matrix.go create mode 100755 Algorithms/0542.01-matrix/01-matrix_test.go create mode 100755 Algorithms/0542.01-matrix/README.md create mode 100755 Algorithms/0543.diameter-of-binary-tree/README.md create mode 100755 Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree.go create mode 100755 Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree_test.go create mode 100755 Algorithms/0544.output-contest-matches/README.md create mode 100755 Algorithms/0544.output-contest-matches/output-contest-matches.go create mode 100755 Algorithms/0544.output-contest-matches/output-contest-matches_test.go create mode 100755 Algorithms/0545.boundary-of-binary-tree/README.md create mode 100755 Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree.go create mode 100755 Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree_test.go create mode 100755 Algorithms/0546.remove-boxes/README.md create mode 100755 Algorithms/0546.remove-boxes/remove-boxes.go create mode 100755 Algorithms/0546.remove-boxes/remove-boxes_test.go create mode 100755 Algorithms/0547.friend-circles/README.md create mode 100755 Algorithms/0547.friend-circles/friend-circles.go create mode 100755 Algorithms/0547.friend-circles/friend-circles_test.go create mode 100755 Algorithms/0548.split-array-with-equal-sum/README.md create mode 100755 Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum.go create mode 100755 Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum_test.go create mode 100755 Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/README.md create mode 100755 Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii.go create mode 100755 Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii_test.go create mode 100755 Algorithms/0551.student-attendance-record-i/README.md create mode 100755 Algorithms/0551.student-attendance-record-i/student-attendance-record-i.go create mode 100755 Algorithms/0551.student-attendance-record-i/student-attendance-record-i_test.go create mode 100755 Algorithms/0552.student-attendance-record-ii/README.md create mode 100755 Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii.go create mode 100755 Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii_test.go create mode 100755 Algorithms/0553.optimal-division/README.md create mode 100755 Algorithms/0553.optimal-division/optimal-division.go create mode 100755 Algorithms/0553.optimal-division/optimal-division_test.go create mode 100755 Algorithms/0554.brick-wall/README.md create mode 100755 Algorithms/0554.brick-wall/brick-wall.go create mode 100755 Algorithms/0554.brick-wall/brick-wall_test.go create mode 100755 Algorithms/0555.split-concatenated-strings/README.md create mode 100755 Algorithms/0555.split-concatenated-strings/split-concatenated-strings.go create mode 100755 Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go create mode 100755 Algorithms/0556.next-greater-element-iii/README.md create mode 100755 Algorithms/0556.next-greater-element-iii/next-greater-element-iii.go create mode 100755 Algorithms/0556.next-greater-element-iii/next-greater-element-iii_test.go create mode 100755 Algorithms/0557.reverse-words-in-a-string-iii/README.md create mode 100755 Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.go create mode 100755 Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii_test.go create mode 100755 Algorithms/0560.subarray-sum-equals-k/README.md create mode 100755 Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k.go create mode 100755 Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k_test.go create mode 100755 Algorithms/0561.array-partition-i/README.md create mode 100755 Algorithms/0561.array-partition-i/array-partition-i.go create mode 100755 Algorithms/0561.array-partition-i/array-partition-i_test.go create mode 100755 Algorithms/0562.longest-line-of-consecutive-one-in-matrix/README.md create mode 100755 Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix.go create mode 100755 Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix_test.go create mode 100755 Algorithms/0563.binary-tree-tilt/README.md create mode 100755 Algorithms/0563.binary-tree-tilt/binary-tree-tilt.go create mode 100755 Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go create mode 100755 Algorithms/0564.find-the-closest-palindrome/README.md create mode 100755 Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome.go create mode 100755 Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome_test.go create mode 100755 Algorithms/0565.array-nesting/README.md create mode 100755 Algorithms/0565.array-nesting/array-nesting.go create mode 100755 Algorithms/0565.array-nesting/array-nesting_test.go create mode 100755 Algorithms/0566.reshape-the-matrix/README.md create mode 100755 Algorithms/0566.reshape-the-matrix/reshape-the-matrix.go create mode 100755 Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go create mode 100755 Algorithms/0567.permutation-in-string/README.md create mode 100755 Algorithms/0567.permutation-in-string/permutation-in-string.go create mode 100755 Algorithms/0567.permutation-in-string/permutation-in-string_test.go create mode 100755 Algorithms/0568.maximum-vacation-days/README.md create mode 100755 Algorithms/0568.maximum-vacation-days/maximum-vacation-days.go create mode 100755 Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go create mode 100755 Algorithms/0572.subtree-of-another-tree/README.md create mode 100755 Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree.go create mode 100755 Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree_test.go create mode 100755 Algorithms/0573.squirrel-simulation/README.md create mode 100755 Algorithms/0573.squirrel-simulation/squirrel-simulation.go create mode 100755 Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go create mode 100755 Algorithms/0575.distribute-candies/README.md create mode 100755 Algorithms/0575.distribute-candies/distribute-candies.go create mode 100755 Algorithms/0575.distribute-candies/distribute-candies_test.go create mode 100755 Algorithms/0576.out-of-boundary-paths/README.md create mode 100755 Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths.go create mode 100755 Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths_test.go create mode 100755 Algorithms/0581.shortest-unsorted-continuous-subarray/README.md create mode 100755 Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray.go create mode 100755 Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray_test.go create mode 100755 Algorithms/0582.kill-process/README.md create mode 100755 Algorithms/0582.kill-process/kill-process.go create mode 100755 Algorithms/0582.kill-process/kill-process_test.go create mode 100755 Algorithms/0583.delete-operation-for-two-strings/README.md create mode 100755 Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings.go create mode 100755 Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings_test.go create mode 100755 Algorithms/0587.erect-the-fence/README.md create mode 100755 Algorithms/0587.erect-the-fence/erect-the-fence.go create mode 100755 Algorithms/0587.erect-the-fence/erect-the-fence_test.go create mode 100755 Algorithms/0588.design-in-memory-file-system/README.md create mode 100755 Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system.go create mode 100755 Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system_test.go create mode 100755 Algorithms/0591.tag-validator/README.md create mode 100755 Algorithms/0591.tag-validator/tag-validator.go create mode 100755 Algorithms/0591.tag-validator/tag-validator_test.go create mode 100755 Algorithms/0592.fraction-addition-and-subtraction/README.md create mode 100755 Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction.go create mode 100755 Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction_test.go create mode 100755 Algorithms/0593.valid-square/README.md create mode 100755 Algorithms/0593.valid-square/valid-square.go create mode 100755 Algorithms/0593.valid-square/valid-square_test.go create mode 100755 Algorithms/0594.longest-harmonious-subsequence/README.md create mode 100755 Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence.go create mode 100755 Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go create mode 100755 Algorithms/0598.range-addition-ii/README.md create mode 100755 Algorithms/0598.range-addition-ii/range-addition-ii.go create mode 100755 Algorithms/0598.range-addition-ii/range-addition-ii_test.go create mode 100755 Algorithms/0599.minimum-index-sum-of-two-lists/README.md create mode 100755 Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists.go create mode 100755 Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists_test.go create mode 100755 Algorithms/0600.non-negative-integers-without-consecutive-ones/README.md create mode 100755 Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones.go create mode 100755 Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones_test.go create mode 100755 Algorithms/0604.design-compressed-string-iterator/README.md create mode 100755 Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator.go create mode 100755 Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator_test.go create mode 100755 Algorithms/0605.can-place-flowers/README.md create mode 100755 Algorithms/0605.can-place-flowers/can-place-flowers.go create mode 100755 Algorithms/0605.can-place-flowers/can-place-flowers_test.go create mode 100755 Algorithms/0606.construct-string-from-binary-tree/README.md create mode 100755 Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree.go create mode 100755 Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree_test.go create mode 100755 Algorithms/0609.find-duplicate-file-in-system/README.md create mode 100755 Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system.go create mode 100755 Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system_test.go create mode 100755 Algorithms/0611.valid-triangle-number/README.md create mode 100755 Algorithms/0611.valid-triangle-number/valid-triangle-number.go create mode 100755 Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go create mode 100755 Algorithms/0616.add-bold-tag-in-string/README.md create mode 100755 Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string.go create mode 100755 Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string_test.go create mode 100755 Algorithms/0617.merge-two-binary-trees/README.md create mode 100755 Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees.go create mode 100755 Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees_test.go create mode 100755 Algorithms/0621.task-scheduler/README.md create mode 100755 Algorithms/0621.task-scheduler/task-scheduler.go create mode 100755 Algorithms/0621.task-scheduler/task-scheduler_test.go create mode 100755 Algorithms/0623.add-one-row-to-tree/README.md create mode 100755 Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree.go create mode 100755 Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree_test.go create mode 100755 Algorithms/0624.maximum-distance-in-arrays/README.md create mode 100755 Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays.go create mode 100755 Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays_test.go create mode 100755 Algorithms/0625.minimum-factorization/README.md create mode 100755 Algorithms/0625.minimum-factorization/minimum-factorization.go create mode 100755 Algorithms/0625.minimum-factorization/minimum-factorization_test.go create mode 100755 Algorithms/0628.maximum-product-of-three-numbers/README.md create mode 100755 Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers.go create mode 100755 Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers_test.go create mode 100755 Algorithms/0629.k-inverse-pairs-array/README.md create mode 100755 Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array.go create mode 100755 Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array_test.go create mode 100755 Algorithms/0630.course-schedule-iii/README.md create mode 100755 Algorithms/0630.course-schedule-iii/course-schedule-iii.go create mode 100755 Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go create mode 100755 Algorithms/0631.design-excel-sum-formula/README.md create mode 100755 Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula.go create mode 100755 Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula_test.go create mode 100755 Algorithms/0632.smallest-range/README.md create mode 100755 Algorithms/0632.smallest-range/smallest-range.go create mode 100755 Algorithms/0632.smallest-range/smallest-range_test.go create mode 100755 Algorithms/0633.sum-of-square-numbers/README.md create mode 100755 Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers.go create mode 100755 Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers_test.go create mode 100755 Algorithms/0634.find-the-derangement-of-an-array/README.md create mode 100755 Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array.go create mode 100755 Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array_test.go create mode 100755 Algorithms/0635.design-log-storage-system/README.md create mode 100755 Algorithms/0635.design-log-storage-system/design-log-storage-system.go create mode 100755 Algorithms/0635.design-log-storage-system/design-log-storage-system_test.go create mode 100755 Algorithms/0636.exclusive-time-of-functions/README.md create mode 100755 Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions.go create mode 100755 Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions_test.go create mode 100755 Algorithms/0637.average-of-levels-in-binary-tree/README.md create mode 100755 Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree.go create mode 100755 Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree_test.go create mode 100755 Algorithms/0638.shopping-offers/README.md create mode 100755 Algorithms/0638.shopping-offers/shopping-offers.go create mode 100755 Algorithms/0638.shopping-offers/shopping-offers_test.go create mode 100755 Algorithms/0639.decode-ways-ii/README.md create mode 100755 Algorithms/0639.decode-ways-ii/decode-ways-ii.go create mode 100755 Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go create mode 100755 Algorithms/0640.solve-the-equation/README.md create mode 100755 Algorithms/0640.solve-the-equation/solve-the-equation.go create mode 100755 Algorithms/0640.solve-the-equation/solve-the-equation_test.go create mode 100755 Algorithms/0642.design-search-autocomplete-system/README.md create mode 100755 Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system.go create mode 100755 Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system_test.go create mode 100755 Algorithms/0643.maximum-average-subarray-i/README.md create mode 100755 Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i.go create mode 100755 Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i_test.go create mode 100755 Algorithms/0644.maximum-average-subarray-ii/README.md create mode 100755 Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii.go create mode 100755 Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii_test.go create mode 100755 Algorithms/0645.set-mismatch/README.md create mode 100755 Algorithms/0645.set-mismatch/set-mismatch.go create mode 100755 Algorithms/0645.set-mismatch/set-mismatch_test.go create mode 100755 Algorithms/0646.maximum-length-of-pair-chain/README.md create mode 100755 Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain.go create mode 100755 Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain_test.go create mode 100755 Algorithms/0647.palindromic-substrings/README.md create mode 100755 Algorithms/0647.palindromic-substrings/palindromic-substrings.go create mode 100755 Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go create mode 100755 Algorithms/0648.replace-words/README.md create mode 100755 Algorithms/0648.replace-words/replace-words.go create mode 100755 Algorithms/0648.replace-words/replace-words_test.go create mode 100755 Draft/0433.minimum-genetic-mutation/README.md create mode 100755 Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation.go create mode 100755 Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go create mode 100755 Draft/0457.circular-array-loop/README.md create mode 100755 Draft/0457.circular-array-loop/circular-array-loop.go create mode 100755 Draft/0457.circular-array-loop/circular-array-loop_test.go create mode 100755 Draft/0458.poor-pigs/README.md create mode 100755 Draft/0458.poor-pigs/poor-pigs.go create mode 100755 Draft/0458.poor-pigs/poor-pigs_test.go create mode 100755 Draft/0518.coin-change-2/README.md create mode 100755 Draft/0518.coin-change-2/coin-change-2.go create mode 100755 Draft/0518.coin-change-2/coin-change-2_test.go create mode 100755 Draft/0578.get-highest-answer-rate-question/README.md create mode 100755 Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question.go create mode 100755 Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question_test.go create mode 100755 Draft/0579.find-cumulative-salary-of-an-employee/README.md create mode 100755 Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee.go create mode 100755 Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee_test.go create mode 100755 Draft/0603.consecutive-available-seats/README.md create mode 100755 Draft/0603.consecutive-available-seats/consecutive-available-seats.go create mode 100755 Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go create mode 100755 Draft/0626.exchange-seats/README.md create mode 100755 Draft/0626.exchange-seats/exchange-seats.go create mode 100755 Draft/0626.exchange-seats/exchange-seats_test.go diff --git a/Algorithms/0011.container-with-most-water/README.md b/Algorithms/0011.container-with-most-water/README.md new file mode 100755 index 000000000..a63a0d07d --- /dev/null +++ b/Algorithms/0011.container-with-most-water/README.md @@ -0,0 +1,11 @@ +# [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0011.container-with-most-water/container-with-most-water.go b/Algorithms/0011.container-with-most-water/container-with-most-water.go new file mode 100755 index 000000000..0c046c343 --- /dev/null +++ b/Algorithms/0011.container-with-most-water/container-with-most-water.go @@ -0,0 +1,2 @@ +package Problem0011 + diff --git a/Algorithms/0011.container-with-most-water/container-with-most-water_test.go b/Algorithms/0011.container-with-most-water/container-with-most-water_test.go new file mode 100755 index 000000000..14cfce666 --- /dev/null +++ b/Algorithms/0011.container-with-most-water/container-with-most-water_test.go @@ -0,0 +1,43 @@ +package Problem0011 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0011(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0012.integer-to-roman/README.md b/Algorithms/0012.integer-to-roman/README.md new file mode 100755 index 000000000..f12dddee5 --- /dev/null +++ b/Algorithms/0012.integer-to-roman/README.md @@ -0,0 +1,11 @@ +# [12. Integer to Roman](https://leetcode.com/problems/integer-to-roman/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0012.integer-to-roman/integer-to-roman.go b/Algorithms/0012.integer-to-roman/integer-to-roman.go new file mode 100755 index 000000000..c80214ff4 --- /dev/null +++ b/Algorithms/0012.integer-to-roman/integer-to-roman.go @@ -0,0 +1,2 @@ +package Problem0012 + diff --git a/Algorithms/0012.integer-to-roman/integer-to-roman_test.go b/Algorithms/0012.integer-to-roman/integer-to-roman_test.go new file mode 100755 index 000000000..7735b3f9e --- /dev/null +++ b/Algorithms/0012.integer-to-roman/integer-to-roman_test.go @@ -0,0 +1,43 @@ +package Problem0012 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0012(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0013.roman-to-integer/README.md b/Algorithms/0013.roman-to-integer/README.md new file mode 100755 index 000000000..55c3304bb --- /dev/null +++ b/Algorithms/0013.roman-to-integer/README.md @@ -0,0 +1,11 @@ +# [13. Roman to Integer](https://leetcode.com/problems/roman-to-integer/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0013.roman-to-integer/roman-to-integer.go b/Algorithms/0013.roman-to-integer/roman-to-integer.go new file mode 100755 index 000000000..15c569df9 --- /dev/null +++ b/Algorithms/0013.roman-to-integer/roman-to-integer.go @@ -0,0 +1,2 @@ +package Problem0013 + diff --git a/Algorithms/0013.roman-to-integer/roman-to-integer_test.go b/Algorithms/0013.roman-to-integer/roman-to-integer_test.go new file mode 100755 index 000000000..34975cef6 --- /dev/null +++ b/Algorithms/0013.roman-to-integer/roman-to-integer_test.go @@ -0,0 +1,43 @@ +package Problem0013 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0013(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0014.longest-common-prefix/README.md b/Algorithms/0014.longest-common-prefix/README.md new file mode 100755 index 000000000..a36fdff6a --- /dev/null +++ b/Algorithms/0014.longest-common-prefix/README.md @@ -0,0 +1,11 @@ +# [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0014.longest-common-prefix/longest-common-prefix.go b/Algorithms/0014.longest-common-prefix/longest-common-prefix.go new file mode 100755 index 000000000..4c4bfb747 --- /dev/null +++ b/Algorithms/0014.longest-common-prefix/longest-common-prefix.go @@ -0,0 +1,2 @@ +package Problem0014 + diff --git a/Algorithms/0014.longest-common-prefix/longest-common-prefix_test.go b/Algorithms/0014.longest-common-prefix/longest-common-prefix_test.go new file mode 100755 index 000000000..61de644e3 --- /dev/null +++ b/Algorithms/0014.longest-common-prefix/longest-common-prefix_test.go @@ -0,0 +1,43 @@ +package Problem0014 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0014(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0015.3sum/3sum.go b/Algorithms/0015.3sum/3sum.go new file mode 100755 index 000000000..a43bdaf75 --- /dev/null +++ b/Algorithms/0015.3sum/3sum.go @@ -0,0 +1,2 @@ +package Problem0015 + diff --git a/Algorithms/0015.3sum/3sum_test.go b/Algorithms/0015.3sum/3sum_test.go new file mode 100755 index 000000000..db3e28548 --- /dev/null +++ b/Algorithms/0015.3sum/3sum_test.go @@ -0,0 +1,43 @@ +package Problem0015 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0015(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0015.3sum/README.md b/Algorithms/0015.3sum/README.md new file mode 100755 index 000000000..aac87bdb8 --- /dev/null +++ b/Algorithms/0015.3sum/README.md @@ -0,0 +1,11 @@ +# [15. 3Sum](https://leetcode.com/problems/3sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0016.3sum-closest/3sum-closest.go b/Algorithms/0016.3sum-closest/3sum-closest.go new file mode 100755 index 000000000..7c049feea --- /dev/null +++ b/Algorithms/0016.3sum-closest/3sum-closest.go @@ -0,0 +1,2 @@ +package Problem0016 + diff --git a/Algorithms/0016.3sum-closest/3sum-closest_test.go b/Algorithms/0016.3sum-closest/3sum-closest_test.go new file mode 100755 index 000000000..6a5b6e372 --- /dev/null +++ b/Algorithms/0016.3sum-closest/3sum-closest_test.go @@ -0,0 +1,43 @@ +package Problem0016 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0016(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0016.3sum-closest/README.md b/Algorithms/0016.3sum-closest/README.md new file mode 100755 index 000000000..3ee3da21b --- /dev/null +++ b/Algorithms/0016.3sum-closest/README.md @@ -0,0 +1,11 @@ +# [16. 3Sum Closest](https://leetcode.com/problems/3sum-closest/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0017.letter-combinations-of-a-phone-number/README.md b/Algorithms/0017.letter-combinations-of-a-phone-number/README.md new file mode 100755 index 000000000..85a12b88f --- /dev/null +++ b/Algorithms/0017.letter-combinations-of-a-phone-number/README.md @@ -0,0 +1,11 @@ +# [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.go b/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.go new file mode 100755 index 000000000..325d7e5b8 --- /dev/null +++ b/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.go @@ -0,0 +1,2 @@ +package Problem0017 + 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 new file mode 100755 index 000000000..6c64e13b1 --- /dev/null +++ b/Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go @@ -0,0 +1,43 @@ +package Problem0017 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0017(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0018.4sum/4sum.go b/Algorithms/0018.4sum/4sum.go new file mode 100755 index 000000000..01f11af8f --- /dev/null +++ b/Algorithms/0018.4sum/4sum.go @@ -0,0 +1,2 @@ +package Problem0018 + diff --git a/Algorithms/0018.4sum/4sum_test.go b/Algorithms/0018.4sum/4sum_test.go new file mode 100755 index 000000000..35e360b60 --- /dev/null +++ b/Algorithms/0018.4sum/4sum_test.go @@ -0,0 +1,43 @@ +package Problem0018 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0018(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0018.4sum/README.md b/Algorithms/0018.4sum/README.md new file mode 100755 index 000000000..7384b2ac7 --- /dev/null +++ b/Algorithms/0018.4sum/README.md @@ -0,0 +1,11 @@ +# [18. 4Sum](https://leetcode.com/problems/4sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0019.remove-nth-node-from-end-of-list/README.md b/Algorithms/0019.remove-nth-node-from-end-of-list/README.md new file mode 100755 index 000000000..b31f73a19 --- /dev/null +++ b/Algorithms/0019.remove-nth-node-from-end-of-list/README.md @@ -0,0 +1,11 @@ +# [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.go b/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.go new file mode 100755 index 000000000..b124b39a6 --- /dev/null +++ b/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.go @@ -0,0 +1,2 @@ +package Problem0019 + 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 new file mode 100755 index 000000000..36eb050e8 --- /dev/null +++ b/Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go @@ -0,0 +1,43 @@ +package Problem0019 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0019(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0020.valid-parentheses/README.md b/Algorithms/0020.valid-parentheses/README.md new file mode 100755 index 000000000..cbd026e60 --- /dev/null +++ b/Algorithms/0020.valid-parentheses/README.md @@ -0,0 +1,11 @@ +# [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0020.valid-parentheses/valid-parentheses.go b/Algorithms/0020.valid-parentheses/valid-parentheses.go new file mode 100755 index 000000000..d7ce9b3c9 --- /dev/null +++ b/Algorithms/0020.valid-parentheses/valid-parentheses.go @@ -0,0 +1,2 @@ +package Problem0020 + diff --git a/Algorithms/0020.valid-parentheses/valid-parentheses_test.go b/Algorithms/0020.valid-parentheses/valid-parentheses_test.go new file mode 100755 index 000000000..c776be47a --- /dev/null +++ b/Algorithms/0020.valid-parentheses/valid-parentheses_test.go @@ -0,0 +1,43 @@ +package Problem0020 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0020(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0021.merge-two-sorted-lists/README.md b/Algorithms/0021.merge-two-sorted-lists/README.md new file mode 100755 index 000000000..841562daa --- /dev/null +++ b/Algorithms/0021.merge-two-sorted-lists/README.md @@ -0,0 +1,11 @@ +# [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists.go b/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists.go new file mode 100755 index 000000000..9cc6a49e1 --- /dev/null +++ b/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists.go @@ -0,0 +1,2 @@ +package Problem0021 + 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 new file mode 100755 index 000000000..0c44adfda --- /dev/null +++ b/Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go @@ -0,0 +1,43 @@ +package Problem0021 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0021(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0022.generate-parentheses/README.md b/Algorithms/0022.generate-parentheses/README.md new file mode 100755 index 000000000..3ce662912 --- /dev/null +++ b/Algorithms/0022.generate-parentheses/README.md @@ -0,0 +1,11 @@ +# [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0022.generate-parentheses/generate-parentheses.go b/Algorithms/0022.generate-parentheses/generate-parentheses.go new file mode 100755 index 000000000..f78df99e8 --- /dev/null +++ b/Algorithms/0022.generate-parentheses/generate-parentheses.go @@ -0,0 +1,2 @@ +package Problem0022 + diff --git a/Algorithms/0022.generate-parentheses/generate-parentheses_test.go b/Algorithms/0022.generate-parentheses/generate-parentheses_test.go new file mode 100755 index 000000000..2048fda87 --- /dev/null +++ b/Algorithms/0022.generate-parentheses/generate-parentheses_test.go @@ -0,0 +1,43 @@ +package Problem0022 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0022(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0023.merge-k-sorted-lists/README.md b/Algorithms/0023.merge-k-sorted-lists/README.md new file mode 100755 index 000000000..c04c08b99 --- /dev/null +++ b/Algorithms/0023.merge-k-sorted-lists/README.md @@ -0,0 +1,11 @@ +# [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists.go b/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists.go new file mode 100755 index 000000000..8953cc797 --- /dev/null +++ b/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists.go @@ -0,0 +1,2 @@ +package Problem0023 + 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 new file mode 100755 index 000000000..1264fa5e3 --- /dev/null +++ b/Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go @@ -0,0 +1,43 @@ +package Problem0023 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0023(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0024.swap-nodes-in-pairs/README.md b/Algorithms/0024.swap-nodes-in-pairs/README.md new file mode 100755 index 000000000..07ee10c1d --- /dev/null +++ b/Algorithms/0024.swap-nodes-in-pairs/README.md @@ -0,0 +1,11 @@ +# [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs.go b/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs.go new file mode 100755 index 000000000..cfa90ed0e --- /dev/null +++ b/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs.go @@ -0,0 +1,2 @@ +package Problem0024 + 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 new file mode 100755 index 000000000..318247cab --- /dev/null +++ b/Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go @@ -0,0 +1,43 @@ +package Problem0024 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0024(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0025.reverse-nodes-in-k-group/README.md b/Algorithms/0025.reverse-nodes-in-k-group/README.md new file mode 100755 index 000000000..25723afe2 --- /dev/null +++ b/Algorithms/0025.reverse-nodes-in-k-group/README.md @@ -0,0 +1,11 @@ +# [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group.go b/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group.go new file mode 100755 index 000000000..e2c2abfe7 --- /dev/null +++ b/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group.go @@ -0,0 +1,2 @@ +package Problem0025 + 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 new file mode 100755 index 000000000..2dfa52693 --- /dev/null +++ b/Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go @@ -0,0 +1,43 @@ +package Problem0025 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0025(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0026.remove-duplicates-from-sorted-array/README.md b/Algorithms/0026.remove-duplicates-from-sorted-array/README.md new file mode 100755 index 000000000..db19fa663 --- /dev/null +++ b/Algorithms/0026.remove-duplicates-from-sorted-array/README.md @@ -0,0 +1,11 @@ +# [26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.go b/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.go new file mode 100755 index 000000000..6ea3ab332 --- /dev/null +++ b/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.go @@ -0,0 +1,2 @@ +package Problem0026 + 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 new file mode 100755 index 000000000..b6a7d9e07 --- /dev/null +++ b/Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go @@ -0,0 +1,43 @@ +package Problem0026 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0026(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0027.remove-element/README.md b/Algorithms/0027.remove-element/README.md new file mode 100755 index 000000000..4beccd2ad --- /dev/null +++ b/Algorithms/0027.remove-element/README.md @@ -0,0 +1,11 @@ +# [27. Remove Element](https://leetcode.com/problems/remove-element/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0027.remove-element/remove-element.go b/Algorithms/0027.remove-element/remove-element.go new file mode 100755 index 000000000..72a0878b5 --- /dev/null +++ b/Algorithms/0027.remove-element/remove-element.go @@ -0,0 +1,2 @@ +package Problem0027 + diff --git a/Algorithms/0027.remove-element/remove-element_test.go b/Algorithms/0027.remove-element/remove-element_test.go new file mode 100755 index 000000000..4912ea0a8 --- /dev/null +++ b/Algorithms/0027.remove-element/remove-element_test.go @@ -0,0 +1,43 @@ +package Problem0027 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0027(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0028.implement-strstr/README.md b/Algorithms/0028.implement-strstr/README.md new file mode 100755 index 000000000..a96a07999 --- /dev/null +++ b/Algorithms/0028.implement-strstr/README.md @@ -0,0 +1,11 @@ +# [28. Implement strStr()](https://leetcode.com/problems/implement-strstr/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0028.implement-strstr/implement-strstr.go b/Algorithms/0028.implement-strstr/implement-strstr.go new file mode 100755 index 000000000..9a988ee18 --- /dev/null +++ b/Algorithms/0028.implement-strstr/implement-strstr.go @@ -0,0 +1,2 @@ +package Problem0028 + diff --git a/Algorithms/0028.implement-strstr/implement-strstr_test.go b/Algorithms/0028.implement-strstr/implement-strstr_test.go new file mode 100755 index 000000000..2d2f3b242 --- /dev/null +++ b/Algorithms/0028.implement-strstr/implement-strstr_test.go @@ -0,0 +1,43 @@ +package Problem0028 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0028(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0029.divide-two-integers/README.md b/Algorithms/0029.divide-two-integers/README.md new file mode 100755 index 000000000..e609fda66 --- /dev/null +++ b/Algorithms/0029.divide-two-integers/README.md @@ -0,0 +1,11 @@ +# [29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0029.divide-two-integers/divide-two-integers.go b/Algorithms/0029.divide-two-integers/divide-two-integers.go new file mode 100755 index 000000000..060c3f3d0 --- /dev/null +++ b/Algorithms/0029.divide-two-integers/divide-two-integers.go @@ -0,0 +1,2 @@ +package Problem0029 + diff --git a/Algorithms/0029.divide-two-integers/divide-two-integers_test.go b/Algorithms/0029.divide-two-integers/divide-two-integers_test.go new file mode 100755 index 000000000..3a426f179 --- /dev/null +++ b/Algorithms/0029.divide-two-integers/divide-two-integers_test.go @@ -0,0 +1,43 @@ +package Problem0029 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0029(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0030.substring-with-concatenation-of-all-words/README.md b/Algorithms/0030.substring-with-concatenation-of-all-words/README.md new file mode 100755 index 000000000..867465619 --- /dev/null +++ b/Algorithms/0030.substring-with-concatenation-of-all-words/README.md @@ -0,0 +1,11 @@ +# [30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words.go b/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words.go new file mode 100755 index 000000000..3371f83ce --- /dev/null +++ b/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words.go @@ -0,0 +1,2 @@ +package Problem0030 + 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 new file mode 100755 index 000000000..5269fb2ce --- /dev/null +++ b/Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go @@ -0,0 +1,43 @@ +package Problem0030 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0030(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0031.next-permutation/README.md b/Algorithms/0031.next-permutation/README.md new file mode 100755 index 000000000..aebfc0c9f --- /dev/null +++ b/Algorithms/0031.next-permutation/README.md @@ -0,0 +1,11 @@ +# [31. Next Permutation](https://leetcode.com/problems/next-permutation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0031.next-permutation/next-permutation.go b/Algorithms/0031.next-permutation/next-permutation.go new file mode 100755 index 000000000..d0cd1b03d --- /dev/null +++ b/Algorithms/0031.next-permutation/next-permutation.go @@ -0,0 +1,2 @@ +package Problem0031 + diff --git a/Algorithms/0031.next-permutation/next-permutation_test.go b/Algorithms/0031.next-permutation/next-permutation_test.go new file mode 100755 index 000000000..fec18dc98 --- /dev/null +++ b/Algorithms/0031.next-permutation/next-permutation_test.go @@ -0,0 +1,43 @@ +package Problem0031 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0031(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0032.longest-valid-parentheses/README.md b/Algorithms/0032.longest-valid-parentheses/README.md new file mode 100755 index 000000000..735bac0cd --- /dev/null +++ b/Algorithms/0032.longest-valid-parentheses/README.md @@ -0,0 +1,11 @@ +# [32. Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses.go b/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses.go new file mode 100755 index 000000000..4deda3492 --- /dev/null +++ b/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses.go @@ -0,0 +1,2 @@ +package Problem0032 + diff --git a/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go b/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go new file mode 100755 index 000000000..f38d2ba3f --- /dev/null +++ b/Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go @@ -0,0 +1,43 @@ +package Problem0032 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0032(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0033.search-in-rotated-sorted-array/README.md b/Algorithms/0033.search-in-rotated-sorted-array/README.md new file mode 100755 index 000000000..4823983af --- /dev/null +++ b/Algorithms/0033.search-in-rotated-sorted-array/README.md @@ -0,0 +1,11 @@ +# [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.go b/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.go new file mode 100755 index 000000000..0d6b6cb8b --- /dev/null +++ b/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.go @@ -0,0 +1,2 @@ +package Problem0033 + 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 new file mode 100755 index 000000000..f7570194b --- /dev/null +++ b/Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go @@ -0,0 +1,43 @@ +package Problem0033 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0033(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0034.search-for-a-range/README.md b/Algorithms/0034.search-for-a-range/README.md new file mode 100755 index 000000000..3feff9ead --- /dev/null +++ b/Algorithms/0034.search-for-a-range/README.md @@ -0,0 +1,11 @@ +# [34. Search for a Range](https://leetcode.com/problems/search-for-a-range/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0034.search-for-a-range/search-for-a-range.go b/Algorithms/0034.search-for-a-range/search-for-a-range.go new file mode 100755 index 000000000..5235ff766 --- /dev/null +++ b/Algorithms/0034.search-for-a-range/search-for-a-range.go @@ -0,0 +1,2 @@ +package Problem0034 + 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 new file mode 100755 index 000000000..697924ffc --- /dev/null +++ b/Algorithms/0034.search-for-a-range/search-for-a-range_test.go @@ -0,0 +1,43 @@ +package Problem0034 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0034(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0035.search-insert-position/README.md b/Algorithms/0035.search-insert-position/README.md new file mode 100755 index 000000000..d1b0477ea --- /dev/null +++ b/Algorithms/0035.search-insert-position/README.md @@ -0,0 +1,11 @@ +# [35. Search Insert Position](https://leetcode.com/problems/search-insert-position/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0035.search-insert-position/search-insert-position.go b/Algorithms/0035.search-insert-position/search-insert-position.go new file mode 100755 index 000000000..6b92eed6a --- /dev/null +++ b/Algorithms/0035.search-insert-position/search-insert-position.go @@ -0,0 +1,2 @@ +package Problem0035 + diff --git a/Algorithms/0035.search-insert-position/search-insert-position_test.go b/Algorithms/0035.search-insert-position/search-insert-position_test.go new file mode 100755 index 000000000..25ffe2c26 --- /dev/null +++ b/Algorithms/0035.search-insert-position/search-insert-position_test.go @@ -0,0 +1,43 @@ +package Problem0035 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0035(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0036.valid-sudoku/README.md b/Algorithms/0036.valid-sudoku/README.md new file mode 100755 index 000000000..47a9f5bae --- /dev/null +++ b/Algorithms/0036.valid-sudoku/README.md @@ -0,0 +1,11 @@ +# [36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0036.valid-sudoku/valid-sudoku.go b/Algorithms/0036.valid-sudoku/valid-sudoku.go new file mode 100755 index 000000000..2b6e4a766 --- /dev/null +++ b/Algorithms/0036.valid-sudoku/valid-sudoku.go @@ -0,0 +1,2 @@ +package Problem0036 + diff --git a/Algorithms/0036.valid-sudoku/valid-sudoku_test.go b/Algorithms/0036.valid-sudoku/valid-sudoku_test.go new file mode 100755 index 000000000..1f9afb7bb --- /dev/null +++ b/Algorithms/0036.valid-sudoku/valid-sudoku_test.go @@ -0,0 +1,43 @@ +package Problem0036 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0036(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0037.sudoku-solver/README.md b/Algorithms/0037.sudoku-solver/README.md new file mode 100755 index 000000000..41bfb07ca --- /dev/null +++ b/Algorithms/0037.sudoku-solver/README.md @@ -0,0 +1,11 @@ +# [37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0037.sudoku-solver/sudoku-solver.go b/Algorithms/0037.sudoku-solver/sudoku-solver.go new file mode 100755 index 000000000..87af8071c --- /dev/null +++ b/Algorithms/0037.sudoku-solver/sudoku-solver.go @@ -0,0 +1,2 @@ +package Problem0037 + diff --git a/Algorithms/0037.sudoku-solver/sudoku-solver_test.go b/Algorithms/0037.sudoku-solver/sudoku-solver_test.go new file mode 100755 index 000000000..01eb07d66 --- /dev/null +++ b/Algorithms/0037.sudoku-solver/sudoku-solver_test.go @@ -0,0 +1,43 @@ +package Problem0037 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0037(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0038.count-and-say/README.md b/Algorithms/0038.count-and-say/README.md new file mode 100755 index 000000000..d8d9927d6 --- /dev/null +++ b/Algorithms/0038.count-and-say/README.md @@ -0,0 +1,11 @@ +# [38. Count and Say](https://leetcode.com/problems/count-and-say/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0038.count-and-say/count-and-say.go b/Algorithms/0038.count-and-say/count-and-say.go new file mode 100755 index 000000000..0c1872cd0 --- /dev/null +++ b/Algorithms/0038.count-and-say/count-and-say.go @@ -0,0 +1,2 @@ +package Problem0038 + diff --git a/Algorithms/0038.count-and-say/count-and-say_test.go b/Algorithms/0038.count-and-say/count-and-say_test.go new file mode 100755 index 000000000..aad91e00c --- /dev/null +++ b/Algorithms/0038.count-and-say/count-and-say_test.go @@ -0,0 +1,43 @@ +package Problem0038 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0038(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0039.combination-sum/README.md b/Algorithms/0039.combination-sum/README.md new file mode 100755 index 000000000..ce3a07250 --- /dev/null +++ b/Algorithms/0039.combination-sum/README.md @@ -0,0 +1,11 @@ +# [39. Combination Sum](https://leetcode.com/problems/combination-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0039.combination-sum/combination-sum.go b/Algorithms/0039.combination-sum/combination-sum.go new file mode 100755 index 000000000..120b668fe --- /dev/null +++ b/Algorithms/0039.combination-sum/combination-sum.go @@ -0,0 +1,2 @@ +package Problem0039 + diff --git a/Algorithms/0039.combination-sum/combination-sum_test.go b/Algorithms/0039.combination-sum/combination-sum_test.go new file mode 100755 index 000000000..ee19032d6 --- /dev/null +++ b/Algorithms/0039.combination-sum/combination-sum_test.go @@ -0,0 +1,43 @@ +package Problem0039 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0039(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0040.combination-sum-ii/README.md b/Algorithms/0040.combination-sum-ii/README.md new file mode 100755 index 000000000..5bc5f0157 --- /dev/null +++ b/Algorithms/0040.combination-sum-ii/README.md @@ -0,0 +1,11 @@ +# [40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0040.combination-sum-ii/combination-sum-ii.go b/Algorithms/0040.combination-sum-ii/combination-sum-ii.go new file mode 100755 index 000000000..dbe27b1df --- /dev/null +++ b/Algorithms/0040.combination-sum-ii/combination-sum-ii.go @@ -0,0 +1,2 @@ +package Problem0040 + diff --git a/Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go b/Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go new file mode 100755 index 000000000..e262e0d71 --- /dev/null +++ b/Algorithms/0040.combination-sum-ii/combination-sum-ii_test.go @@ -0,0 +1,43 @@ +package Problem0040 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0040(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0041.first-missing-positive/README.md b/Algorithms/0041.first-missing-positive/README.md new file mode 100755 index 000000000..38f40014f --- /dev/null +++ b/Algorithms/0041.first-missing-positive/README.md @@ -0,0 +1,11 @@ +# [41. First Missing Positive](https://leetcode.com/problems/first-missing-positive/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0041.first-missing-positive/first-missing-positive.go b/Algorithms/0041.first-missing-positive/first-missing-positive.go new file mode 100755 index 000000000..bcd671c00 --- /dev/null +++ b/Algorithms/0041.first-missing-positive/first-missing-positive.go @@ -0,0 +1,2 @@ +package Problem0041 + diff --git a/Algorithms/0041.first-missing-positive/first-missing-positive_test.go b/Algorithms/0041.first-missing-positive/first-missing-positive_test.go new file mode 100755 index 000000000..2d9e288a7 --- /dev/null +++ b/Algorithms/0041.first-missing-positive/first-missing-positive_test.go @@ -0,0 +1,43 @@ +package Problem0041 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0041(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0042.trapping-rain-water/README.md b/Algorithms/0042.trapping-rain-water/README.md new file mode 100755 index 000000000..302be4c4e --- /dev/null +++ b/Algorithms/0042.trapping-rain-water/README.md @@ -0,0 +1,11 @@ +# [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0042.trapping-rain-water/trapping-rain-water.go b/Algorithms/0042.trapping-rain-water/trapping-rain-water.go new file mode 100755 index 000000000..32aa7bef9 --- /dev/null +++ b/Algorithms/0042.trapping-rain-water/trapping-rain-water.go @@ -0,0 +1,2 @@ +package Problem0042 + diff --git a/Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go b/Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go new file mode 100755 index 000000000..cdb5db478 --- /dev/null +++ b/Algorithms/0042.trapping-rain-water/trapping-rain-water_test.go @@ -0,0 +1,43 @@ +package Problem0042 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0042(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0043.multiply-strings/README.md b/Algorithms/0043.multiply-strings/README.md new file mode 100755 index 000000000..c7bbf7e74 --- /dev/null +++ b/Algorithms/0043.multiply-strings/README.md @@ -0,0 +1,11 @@ +# [43. Multiply Strings](https://leetcode.com/problems/multiply-strings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0043.multiply-strings/multiply-strings.go b/Algorithms/0043.multiply-strings/multiply-strings.go new file mode 100755 index 000000000..75ddc29d5 --- /dev/null +++ b/Algorithms/0043.multiply-strings/multiply-strings.go @@ -0,0 +1,2 @@ +package Problem0043 + diff --git a/Algorithms/0043.multiply-strings/multiply-strings_test.go b/Algorithms/0043.multiply-strings/multiply-strings_test.go new file mode 100755 index 000000000..89cc0f5bb --- /dev/null +++ b/Algorithms/0043.multiply-strings/multiply-strings_test.go @@ -0,0 +1,43 @@ +package Problem0043 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0043(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0044.wildcard-matching/README.md b/Algorithms/0044.wildcard-matching/README.md new file mode 100755 index 000000000..75b8f876d --- /dev/null +++ b/Algorithms/0044.wildcard-matching/README.md @@ -0,0 +1,11 @@ +# [44. Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0044.wildcard-matching/wildcard-matching.go b/Algorithms/0044.wildcard-matching/wildcard-matching.go new file mode 100755 index 000000000..6763352fb --- /dev/null +++ b/Algorithms/0044.wildcard-matching/wildcard-matching.go @@ -0,0 +1,2 @@ +package Problem0044 + diff --git a/Algorithms/0044.wildcard-matching/wildcard-matching_test.go b/Algorithms/0044.wildcard-matching/wildcard-matching_test.go new file mode 100755 index 000000000..236e313e4 --- /dev/null +++ b/Algorithms/0044.wildcard-matching/wildcard-matching_test.go @@ -0,0 +1,43 @@ +package Problem0044 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0044(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0045.jump-game-ii/README.md b/Algorithms/0045.jump-game-ii/README.md new file mode 100755 index 000000000..586cc647e --- /dev/null +++ b/Algorithms/0045.jump-game-ii/README.md @@ -0,0 +1,11 @@ +# [45. Jump Game II](https://leetcode.com/problems/jump-game-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0045.jump-game-ii/jump-game-ii.go b/Algorithms/0045.jump-game-ii/jump-game-ii.go new file mode 100755 index 000000000..ee463516e --- /dev/null +++ b/Algorithms/0045.jump-game-ii/jump-game-ii.go @@ -0,0 +1,2 @@ +package Problem0045 + diff --git a/Algorithms/0045.jump-game-ii/jump-game-ii_test.go b/Algorithms/0045.jump-game-ii/jump-game-ii_test.go new file mode 100755 index 000000000..1901730be --- /dev/null +++ b/Algorithms/0045.jump-game-ii/jump-game-ii_test.go @@ -0,0 +1,43 @@ +package Problem0045 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0045(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0046.permutations/README.md b/Algorithms/0046.permutations/README.md new file mode 100755 index 000000000..694536bb3 --- /dev/null +++ b/Algorithms/0046.permutations/README.md @@ -0,0 +1,11 @@ +# [46. Permutations](https://leetcode.com/problems/permutations/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0046.permutations/permutations.go b/Algorithms/0046.permutations/permutations.go new file mode 100755 index 000000000..0c6466a22 --- /dev/null +++ b/Algorithms/0046.permutations/permutations.go @@ -0,0 +1,2 @@ +package Problem0046 + diff --git a/Algorithms/0046.permutations/permutations_test.go b/Algorithms/0046.permutations/permutations_test.go new file mode 100755 index 000000000..29d9be265 --- /dev/null +++ b/Algorithms/0046.permutations/permutations_test.go @@ -0,0 +1,43 @@ +package Problem0046 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0046(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0047.permutations-ii/README.md b/Algorithms/0047.permutations-ii/README.md new file mode 100755 index 000000000..27de24aa6 --- /dev/null +++ b/Algorithms/0047.permutations-ii/README.md @@ -0,0 +1,11 @@ +# [47. Permutations II](https://leetcode.com/problems/permutations-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0047.permutations-ii/permutations-ii.go b/Algorithms/0047.permutations-ii/permutations-ii.go new file mode 100755 index 000000000..7d35ac1c7 --- /dev/null +++ b/Algorithms/0047.permutations-ii/permutations-ii.go @@ -0,0 +1,2 @@ +package Problem0047 + diff --git a/Algorithms/0047.permutations-ii/permutations-ii_test.go b/Algorithms/0047.permutations-ii/permutations-ii_test.go new file mode 100755 index 000000000..fc31f0b50 --- /dev/null +++ b/Algorithms/0047.permutations-ii/permutations-ii_test.go @@ -0,0 +1,43 @@ +package Problem0047 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0047(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0048.rotate-image/README.md b/Algorithms/0048.rotate-image/README.md new file mode 100755 index 000000000..2ff6e47e7 --- /dev/null +++ b/Algorithms/0048.rotate-image/README.md @@ -0,0 +1,11 @@ +# [48. Rotate Image](https://leetcode.com/problems/rotate-image/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0048.rotate-image/rotate-image.go b/Algorithms/0048.rotate-image/rotate-image.go new file mode 100755 index 000000000..a2d84440f --- /dev/null +++ b/Algorithms/0048.rotate-image/rotate-image.go @@ -0,0 +1,2 @@ +package Problem0048 + diff --git a/Algorithms/0048.rotate-image/rotate-image_test.go b/Algorithms/0048.rotate-image/rotate-image_test.go new file mode 100755 index 000000000..5bfd92493 --- /dev/null +++ b/Algorithms/0048.rotate-image/rotate-image_test.go @@ -0,0 +1,43 @@ +package Problem0048 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0048(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0049.group-anagrams/README.md b/Algorithms/0049.group-anagrams/README.md new file mode 100755 index 000000000..653595335 --- /dev/null +++ b/Algorithms/0049.group-anagrams/README.md @@ -0,0 +1,11 @@ +# [49. Group Anagrams](https://leetcode.com/problems/group-anagrams/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0049.group-anagrams/group-anagrams.go b/Algorithms/0049.group-anagrams/group-anagrams.go new file mode 100755 index 000000000..5c4dea996 --- /dev/null +++ b/Algorithms/0049.group-anagrams/group-anagrams.go @@ -0,0 +1,2 @@ +package Problem0049 + diff --git a/Algorithms/0049.group-anagrams/group-anagrams_test.go b/Algorithms/0049.group-anagrams/group-anagrams_test.go new file mode 100755 index 000000000..4073dad8b --- /dev/null +++ b/Algorithms/0049.group-anagrams/group-anagrams_test.go @@ -0,0 +1,43 @@ +package Problem0049 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0049(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0050.powx-n/README.md b/Algorithms/0050.powx-n/README.md new file mode 100755 index 000000000..dc1640774 --- /dev/null +++ b/Algorithms/0050.powx-n/README.md @@ -0,0 +1,11 @@ +# [50. Pow(x, n)](https://leetcode.com/problems/powx-n/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0050.powx-n/powx-n.go b/Algorithms/0050.powx-n/powx-n.go new file mode 100755 index 000000000..7cc390279 --- /dev/null +++ b/Algorithms/0050.powx-n/powx-n.go @@ -0,0 +1,2 @@ +package Problem0050 + diff --git a/Algorithms/0050.powx-n/powx-n_test.go b/Algorithms/0050.powx-n/powx-n_test.go new file mode 100755 index 000000000..57a6086a3 --- /dev/null +++ b/Algorithms/0050.powx-n/powx-n_test.go @@ -0,0 +1,43 @@ +package Problem0050 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0050(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0051.n-queens/README.md b/Algorithms/0051.n-queens/README.md new file mode 100755 index 000000000..4fcbdd1d5 --- /dev/null +++ b/Algorithms/0051.n-queens/README.md @@ -0,0 +1,11 @@ +# [51. N-Queens](https://leetcode.com/problems/n-queens/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0051.n-queens/n-queens.go b/Algorithms/0051.n-queens/n-queens.go new file mode 100755 index 000000000..9fa8886a5 --- /dev/null +++ b/Algorithms/0051.n-queens/n-queens.go @@ -0,0 +1,2 @@ +package Problem0051 + diff --git a/Algorithms/0051.n-queens/n-queens_test.go b/Algorithms/0051.n-queens/n-queens_test.go new file mode 100755 index 000000000..bcdf21535 --- /dev/null +++ b/Algorithms/0051.n-queens/n-queens_test.go @@ -0,0 +1,43 @@ +package Problem0051 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0051(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0052.n-queens-ii/README.md b/Algorithms/0052.n-queens-ii/README.md new file mode 100755 index 000000000..728dc1bb8 --- /dev/null +++ b/Algorithms/0052.n-queens-ii/README.md @@ -0,0 +1,11 @@ +# [52. N-Queens II](https://leetcode.com/problems/n-queens-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0052.n-queens-ii/n-queens-ii.go b/Algorithms/0052.n-queens-ii/n-queens-ii.go new file mode 100755 index 000000000..71816b64c --- /dev/null +++ b/Algorithms/0052.n-queens-ii/n-queens-ii.go @@ -0,0 +1,2 @@ +package Problem0052 + diff --git a/Algorithms/0052.n-queens-ii/n-queens-ii_test.go b/Algorithms/0052.n-queens-ii/n-queens-ii_test.go new file mode 100755 index 000000000..f0d811dd0 --- /dev/null +++ b/Algorithms/0052.n-queens-ii/n-queens-ii_test.go @@ -0,0 +1,43 @@ +package Problem0052 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0052(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0053.maximum-subarray/README.md b/Algorithms/0053.maximum-subarray/README.md new file mode 100755 index 000000000..8db570cc4 --- /dev/null +++ b/Algorithms/0053.maximum-subarray/README.md @@ -0,0 +1,11 @@ +# [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0053.maximum-subarray/maximum-subarray.go b/Algorithms/0053.maximum-subarray/maximum-subarray.go new file mode 100755 index 000000000..4d8031699 --- /dev/null +++ b/Algorithms/0053.maximum-subarray/maximum-subarray.go @@ -0,0 +1,2 @@ +package Problem0053 + diff --git a/Algorithms/0053.maximum-subarray/maximum-subarray_test.go b/Algorithms/0053.maximum-subarray/maximum-subarray_test.go new file mode 100755 index 000000000..64af53676 --- /dev/null +++ b/Algorithms/0053.maximum-subarray/maximum-subarray_test.go @@ -0,0 +1,43 @@ +package Problem0053 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0053(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0054.spiral-matrix/README.md b/Algorithms/0054.spiral-matrix/README.md new file mode 100755 index 000000000..6ef60c42f --- /dev/null +++ b/Algorithms/0054.spiral-matrix/README.md @@ -0,0 +1,11 @@ +# [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0054.spiral-matrix/spiral-matrix.go b/Algorithms/0054.spiral-matrix/spiral-matrix.go new file mode 100755 index 000000000..cb19c2034 --- /dev/null +++ b/Algorithms/0054.spiral-matrix/spiral-matrix.go @@ -0,0 +1,2 @@ +package Problem0054 + diff --git a/Algorithms/0054.spiral-matrix/spiral-matrix_test.go b/Algorithms/0054.spiral-matrix/spiral-matrix_test.go new file mode 100755 index 000000000..a9935ae79 --- /dev/null +++ b/Algorithms/0054.spiral-matrix/spiral-matrix_test.go @@ -0,0 +1,43 @@ +package Problem0054 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0054(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0055.jump-game/README.md b/Algorithms/0055.jump-game/README.md new file mode 100755 index 000000000..7d32caa54 --- /dev/null +++ b/Algorithms/0055.jump-game/README.md @@ -0,0 +1,11 @@ +# [55. Jump Game](https://leetcode.com/problems/jump-game/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0055.jump-game/jump-game.go b/Algorithms/0055.jump-game/jump-game.go new file mode 100755 index 000000000..5baa23b3a --- /dev/null +++ b/Algorithms/0055.jump-game/jump-game.go @@ -0,0 +1,2 @@ +package Problem0055 + diff --git a/Algorithms/0055.jump-game/jump-game_test.go b/Algorithms/0055.jump-game/jump-game_test.go new file mode 100755 index 000000000..12db39270 --- /dev/null +++ b/Algorithms/0055.jump-game/jump-game_test.go @@ -0,0 +1,43 @@ +package Problem0055 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0055(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0056.merge-intervals/README.md b/Algorithms/0056.merge-intervals/README.md new file mode 100755 index 000000000..eca52faff --- /dev/null +++ b/Algorithms/0056.merge-intervals/README.md @@ -0,0 +1,11 @@ +# [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0056.merge-intervals/merge-intervals.go b/Algorithms/0056.merge-intervals/merge-intervals.go new file mode 100755 index 000000000..658674a57 --- /dev/null +++ b/Algorithms/0056.merge-intervals/merge-intervals.go @@ -0,0 +1,2 @@ +package Problem0056 + diff --git a/Algorithms/0056.merge-intervals/merge-intervals_test.go b/Algorithms/0056.merge-intervals/merge-intervals_test.go new file mode 100755 index 000000000..fe6db22b5 --- /dev/null +++ b/Algorithms/0056.merge-intervals/merge-intervals_test.go @@ -0,0 +1,43 @@ +package Problem0056 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0056(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0057.insert-interval/README.md b/Algorithms/0057.insert-interval/README.md new file mode 100755 index 000000000..4f914edf3 --- /dev/null +++ b/Algorithms/0057.insert-interval/README.md @@ -0,0 +1,11 @@ +# [57. Insert Interval](https://leetcode.com/problems/insert-interval/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0057.insert-interval/insert-interval.go b/Algorithms/0057.insert-interval/insert-interval.go new file mode 100755 index 000000000..5ee082330 --- /dev/null +++ b/Algorithms/0057.insert-interval/insert-interval.go @@ -0,0 +1,2 @@ +package Problem0057 + diff --git a/Algorithms/0057.insert-interval/insert-interval_test.go b/Algorithms/0057.insert-interval/insert-interval_test.go new file mode 100755 index 000000000..17846fcd2 --- /dev/null +++ b/Algorithms/0057.insert-interval/insert-interval_test.go @@ -0,0 +1,43 @@ +package Problem0057 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0057(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0058.length-of-last-word/README.md b/Algorithms/0058.length-of-last-word/README.md new file mode 100755 index 000000000..76711d611 --- /dev/null +++ b/Algorithms/0058.length-of-last-word/README.md @@ -0,0 +1,11 @@ +# [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0058.length-of-last-word/length-of-last-word.go b/Algorithms/0058.length-of-last-word/length-of-last-word.go new file mode 100755 index 000000000..a7e9d701b --- /dev/null +++ b/Algorithms/0058.length-of-last-word/length-of-last-word.go @@ -0,0 +1,2 @@ +package Problem0058 + 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 new file mode 100755 index 000000000..eb80c1ba8 --- /dev/null +++ b/Algorithms/0058.length-of-last-word/length-of-last-word_test.go @@ -0,0 +1,43 @@ +package Problem0058 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0058(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0059.spiral-matrix-ii/README.md b/Algorithms/0059.spiral-matrix-ii/README.md new file mode 100755 index 000000000..cc6a8db0b --- /dev/null +++ b/Algorithms/0059.spiral-matrix-ii/README.md @@ -0,0 +1,11 @@ +# [59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii.go b/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii.go new file mode 100755 index 000000000..53152c091 --- /dev/null +++ b/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii.go @@ -0,0 +1,2 @@ +package Problem0059 + diff --git a/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go b/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go new file mode 100755 index 000000000..4b9d77946 --- /dev/null +++ b/Algorithms/0059.spiral-matrix-ii/spiral-matrix-ii_test.go @@ -0,0 +1,43 @@ +package Problem0059 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0059(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0060.permutation-sequence/README.md b/Algorithms/0060.permutation-sequence/README.md new file mode 100755 index 000000000..30fa3578c --- /dev/null +++ b/Algorithms/0060.permutation-sequence/README.md @@ -0,0 +1,11 @@ +# [60. Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0060.permutation-sequence/permutation-sequence.go b/Algorithms/0060.permutation-sequence/permutation-sequence.go new file mode 100755 index 000000000..d8befdf9f --- /dev/null +++ b/Algorithms/0060.permutation-sequence/permutation-sequence.go @@ -0,0 +1,2 @@ +package Problem0060 + diff --git a/Algorithms/0060.permutation-sequence/permutation-sequence_test.go b/Algorithms/0060.permutation-sequence/permutation-sequence_test.go new file mode 100755 index 000000000..5f27acd27 --- /dev/null +++ b/Algorithms/0060.permutation-sequence/permutation-sequence_test.go @@ -0,0 +1,43 @@ +package Problem0060 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0060(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0061.rotate-list/README.md b/Algorithms/0061.rotate-list/README.md new file mode 100755 index 000000000..fca5e001f --- /dev/null +++ b/Algorithms/0061.rotate-list/README.md @@ -0,0 +1,11 @@ +# [61. Rotate List](https://leetcode.com/problems/rotate-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0061.rotate-list/rotate-list.go b/Algorithms/0061.rotate-list/rotate-list.go new file mode 100755 index 000000000..b0cad8020 --- /dev/null +++ b/Algorithms/0061.rotate-list/rotate-list.go @@ -0,0 +1,2 @@ +package Problem0061 + diff --git a/Algorithms/0061.rotate-list/rotate-list_test.go b/Algorithms/0061.rotate-list/rotate-list_test.go new file mode 100755 index 000000000..b73eb5967 --- /dev/null +++ b/Algorithms/0061.rotate-list/rotate-list_test.go @@ -0,0 +1,43 @@ +package Problem0061 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0061(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0062.unique-paths/README.md b/Algorithms/0062.unique-paths/README.md new file mode 100755 index 000000000..1c4818243 --- /dev/null +++ b/Algorithms/0062.unique-paths/README.md @@ -0,0 +1,11 @@ +# [62. Unique Paths](https://leetcode.com/problems/unique-paths/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0062.unique-paths/unique-paths.go b/Algorithms/0062.unique-paths/unique-paths.go new file mode 100755 index 000000000..c4f0fae8c --- /dev/null +++ b/Algorithms/0062.unique-paths/unique-paths.go @@ -0,0 +1,2 @@ +package Problem0062 + diff --git a/Algorithms/0062.unique-paths/unique-paths_test.go b/Algorithms/0062.unique-paths/unique-paths_test.go new file mode 100755 index 000000000..530658820 --- /dev/null +++ b/Algorithms/0062.unique-paths/unique-paths_test.go @@ -0,0 +1,43 @@ +package Problem0062 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0062(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0063.unique-paths-ii/README.md b/Algorithms/0063.unique-paths-ii/README.md new file mode 100755 index 000000000..acd22ab84 --- /dev/null +++ b/Algorithms/0063.unique-paths-ii/README.md @@ -0,0 +1,11 @@ +# [63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0063.unique-paths-ii/unique-paths-ii.go b/Algorithms/0063.unique-paths-ii/unique-paths-ii.go new file mode 100755 index 000000000..375ea5f93 --- /dev/null +++ b/Algorithms/0063.unique-paths-ii/unique-paths-ii.go @@ -0,0 +1,2 @@ +package Problem0063 + diff --git a/Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go b/Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go new file mode 100755 index 000000000..6c42558a3 --- /dev/null +++ b/Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go @@ -0,0 +1,43 @@ +package Problem0063 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0063(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0064.minimum-path-sum/README.md b/Algorithms/0064.minimum-path-sum/README.md new file mode 100755 index 000000000..78504874f --- /dev/null +++ b/Algorithms/0064.minimum-path-sum/README.md @@ -0,0 +1,11 @@ +# [64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0064.minimum-path-sum/minimum-path-sum.go b/Algorithms/0064.minimum-path-sum/minimum-path-sum.go new file mode 100755 index 000000000..ff8d8da94 --- /dev/null +++ b/Algorithms/0064.minimum-path-sum/minimum-path-sum.go @@ -0,0 +1,2 @@ +package Problem0064 + diff --git a/Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go b/Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go new file mode 100755 index 000000000..ee474da14 --- /dev/null +++ b/Algorithms/0064.minimum-path-sum/minimum-path-sum_test.go @@ -0,0 +1,43 @@ +package Problem0064 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0064(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0065.valid-number/README.md b/Algorithms/0065.valid-number/README.md new file mode 100755 index 000000000..6c7326af2 --- /dev/null +++ b/Algorithms/0065.valid-number/README.md @@ -0,0 +1,11 @@ +# [65. Valid Number](https://leetcode.com/problems/valid-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0065.valid-number/valid-number.go b/Algorithms/0065.valid-number/valid-number.go new file mode 100755 index 000000000..0f0c4fbdb --- /dev/null +++ b/Algorithms/0065.valid-number/valid-number.go @@ -0,0 +1,2 @@ +package Problem0065 + diff --git a/Algorithms/0065.valid-number/valid-number_test.go b/Algorithms/0065.valid-number/valid-number_test.go new file mode 100755 index 000000000..0def5e875 --- /dev/null +++ b/Algorithms/0065.valid-number/valid-number_test.go @@ -0,0 +1,43 @@ +package Problem0065 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0065(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0066.plus-one/README.md b/Algorithms/0066.plus-one/README.md new file mode 100755 index 000000000..e99b9cf79 --- /dev/null +++ b/Algorithms/0066.plus-one/README.md @@ -0,0 +1,11 @@ +# [66. Plus One](https://leetcode.com/problems/plus-one/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0066.plus-one/plus-one.go b/Algorithms/0066.plus-one/plus-one.go new file mode 100755 index 000000000..18177c1f9 --- /dev/null +++ b/Algorithms/0066.plus-one/plus-one.go @@ -0,0 +1,2 @@ +package Problem0066 + diff --git a/Algorithms/0066.plus-one/plus-one_test.go b/Algorithms/0066.plus-one/plus-one_test.go new file mode 100755 index 000000000..5eddef4eb --- /dev/null +++ b/Algorithms/0066.plus-one/plus-one_test.go @@ -0,0 +1,43 @@ +package Problem0066 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0066(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0067.add-binary/README.md b/Algorithms/0067.add-binary/README.md new file mode 100755 index 000000000..6da37b115 --- /dev/null +++ b/Algorithms/0067.add-binary/README.md @@ -0,0 +1,11 @@ +# [67. Add Binary](https://leetcode.com/problems/add-binary/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0067.add-binary/add-binary.go b/Algorithms/0067.add-binary/add-binary.go new file mode 100755 index 000000000..d35de30c3 --- /dev/null +++ b/Algorithms/0067.add-binary/add-binary.go @@ -0,0 +1,2 @@ +package Problem0067 + diff --git a/Algorithms/0067.add-binary/add-binary_test.go b/Algorithms/0067.add-binary/add-binary_test.go new file mode 100755 index 000000000..95fcf8003 --- /dev/null +++ b/Algorithms/0067.add-binary/add-binary_test.go @@ -0,0 +1,43 @@ +package Problem0067 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0067(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0068.text-justification/README.md b/Algorithms/0068.text-justification/README.md new file mode 100755 index 000000000..ed443d83b --- /dev/null +++ b/Algorithms/0068.text-justification/README.md @@ -0,0 +1,11 @@ +# [68. Text Justification](https://leetcode.com/problems/text-justification/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0068.text-justification/text-justification.go b/Algorithms/0068.text-justification/text-justification.go new file mode 100755 index 000000000..cd980afbe --- /dev/null +++ b/Algorithms/0068.text-justification/text-justification.go @@ -0,0 +1,2 @@ +package Problem0068 + diff --git a/Algorithms/0068.text-justification/text-justification_test.go b/Algorithms/0068.text-justification/text-justification_test.go new file mode 100755 index 000000000..f980d9519 --- /dev/null +++ b/Algorithms/0068.text-justification/text-justification_test.go @@ -0,0 +1,43 @@ +package Problem0068 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0068(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0069.sqrtx/README.md b/Algorithms/0069.sqrtx/README.md new file mode 100755 index 000000000..b4b1ec576 --- /dev/null +++ b/Algorithms/0069.sqrtx/README.md @@ -0,0 +1,11 @@ +# [69. Sqrt(x)](https://leetcode.com/problems/sqrtx/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0069.sqrtx/sqrtx.go b/Algorithms/0069.sqrtx/sqrtx.go new file mode 100755 index 000000000..f1c53fe59 --- /dev/null +++ b/Algorithms/0069.sqrtx/sqrtx.go @@ -0,0 +1,2 @@ +package Problem0069 + diff --git a/Algorithms/0069.sqrtx/sqrtx_test.go b/Algorithms/0069.sqrtx/sqrtx_test.go new file mode 100755 index 000000000..42add7fde --- /dev/null +++ b/Algorithms/0069.sqrtx/sqrtx_test.go @@ -0,0 +1,43 @@ +package Problem0069 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0069(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0070.climbing-stairs/README.md b/Algorithms/0070.climbing-stairs/README.md new file mode 100755 index 000000000..c9d3a3317 --- /dev/null +++ b/Algorithms/0070.climbing-stairs/README.md @@ -0,0 +1,11 @@ +# [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0070.climbing-stairs/climbing-stairs.go b/Algorithms/0070.climbing-stairs/climbing-stairs.go new file mode 100755 index 000000000..f896cae6c --- /dev/null +++ b/Algorithms/0070.climbing-stairs/climbing-stairs.go @@ -0,0 +1,2 @@ +package Problem0070 + diff --git a/Algorithms/0070.climbing-stairs/climbing-stairs_test.go b/Algorithms/0070.climbing-stairs/climbing-stairs_test.go new file mode 100755 index 000000000..ded09bf64 --- /dev/null +++ b/Algorithms/0070.climbing-stairs/climbing-stairs_test.go @@ -0,0 +1,43 @@ +package Problem0070 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0070(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0071.simplify-path/README.md b/Algorithms/0071.simplify-path/README.md new file mode 100755 index 000000000..0cfa189db --- /dev/null +++ b/Algorithms/0071.simplify-path/README.md @@ -0,0 +1,11 @@ +# [71. Simplify Path](https://leetcode.com/problems/simplify-path/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0071.simplify-path/simplify-path.go b/Algorithms/0071.simplify-path/simplify-path.go new file mode 100755 index 000000000..3dd9fe59c --- /dev/null +++ b/Algorithms/0071.simplify-path/simplify-path.go @@ -0,0 +1,2 @@ +package Problem0071 + diff --git a/Algorithms/0071.simplify-path/simplify-path_test.go b/Algorithms/0071.simplify-path/simplify-path_test.go new file mode 100755 index 000000000..16e978f51 --- /dev/null +++ b/Algorithms/0071.simplify-path/simplify-path_test.go @@ -0,0 +1,43 @@ +package Problem0071 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0071(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0072.edit-distance/README.md b/Algorithms/0072.edit-distance/README.md new file mode 100755 index 000000000..613bf7e50 --- /dev/null +++ b/Algorithms/0072.edit-distance/README.md @@ -0,0 +1,11 @@ +# [72. Edit Distance](https://leetcode.com/problems/edit-distance/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0072.edit-distance/edit-distance.go b/Algorithms/0072.edit-distance/edit-distance.go new file mode 100755 index 000000000..549292fe3 --- /dev/null +++ b/Algorithms/0072.edit-distance/edit-distance.go @@ -0,0 +1,2 @@ +package Problem0072 + diff --git a/Algorithms/0072.edit-distance/edit-distance_test.go b/Algorithms/0072.edit-distance/edit-distance_test.go new file mode 100755 index 000000000..b26499742 --- /dev/null +++ b/Algorithms/0072.edit-distance/edit-distance_test.go @@ -0,0 +1,43 @@ +package Problem0072 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0072(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0073.set-matrix-zeroes/README.md b/Algorithms/0073.set-matrix-zeroes/README.md new file mode 100755 index 000000000..664e39449 --- /dev/null +++ b/Algorithms/0073.set-matrix-zeroes/README.md @@ -0,0 +1,11 @@ +# [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes.go b/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes.go new file mode 100755 index 000000000..6af0c6f1e --- /dev/null +++ b/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes.go @@ -0,0 +1,2 @@ +package Problem0073 + diff --git a/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go b/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go new file mode 100755 index 000000000..38b2c58a6 --- /dev/null +++ b/Algorithms/0073.set-matrix-zeroes/set-matrix-zeroes_test.go @@ -0,0 +1,43 @@ +package Problem0073 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0073(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0074.search-a-2d-matrix/README.md b/Algorithms/0074.search-a-2d-matrix/README.md new file mode 100755 index 000000000..7ac9b1b5c --- /dev/null +++ b/Algorithms/0074.search-a-2d-matrix/README.md @@ -0,0 +1,11 @@ +# [74. Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix.go b/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix.go new file mode 100755 index 000000000..ce4e1a5dc --- /dev/null +++ b/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix.go @@ -0,0 +1,2 @@ +package Problem0074 + 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 new file mode 100755 index 000000000..6e0034213 --- /dev/null +++ b/Algorithms/0074.search-a-2d-matrix/search-a-2d-matrix_test.go @@ -0,0 +1,43 @@ +package Problem0074 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0074(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0075.sort-colors/README.md b/Algorithms/0075.sort-colors/README.md new file mode 100755 index 000000000..98574bf5c --- /dev/null +++ b/Algorithms/0075.sort-colors/README.md @@ -0,0 +1,11 @@ +# [75. Sort Colors](https://leetcode.com/problems/sort-colors/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0075.sort-colors/sort-colors.go b/Algorithms/0075.sort-colors/sort-colors.go new file mode 100755 index 000000000..431165699 --- /dev/null +++ b/Algorithms/0075.sort-colors/sort-colors.go @@ -0,0 +1,2 @@ +package Problem0075 + diff --git a/Algorithms/0075.sort-colors/sort-colors_test.go b/Algorithms/0075.sort-colors/sort-colors_test.go new file mode 100755 index 000000000..129a83a43 --- /dev/null +++ b/Algorithms/0075.sort-colors/sort-colors_test.go @@ -0,0 +1,43 @@ +package Problem0075 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0075(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0076.minimum-window-substring/README.md b/Algorithms/0076.minimum-window-substring/README.md new file mode 100755 index 000000000..148b6c0b7 --- /dev/null +++ b/Algorithms/0076.minimum-window-substring/README.md @@ -0,0 +1,11 @@ +# [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0076.minimum-window-substring/minimum-window-substring.go b/Algorithms/0076.minimum-window-substring/minimum-window-substring.go new file mode 100755 index 000000000..6d57294f0 --- /dev/null +++ b/Algorithms/0076.minimum-window-substring/minimum-window-substring.go @@ -0,0 +1,2 @@ +package Problem0076 + diff --git a/Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go b/Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go new file mode 100755 index 000000000..75db222fa --- /dev/null +++ b/Algorithms/0076.minimum-window-substring/minimum-window-substring_test.go @@ -0,0 +1,43 @@ +package Problem0076 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0076(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0077.combinations/README.md b/Algorithms/0077.combinations/README.md new file mode 100755 index 000000000..0182e32c4 --- /dev/null +++ b/Algorithms/0077.combinations/README.md @@ -0,0 +1,11 @@ +# [77. Combinations](https://leetcode.com/problems/combinations/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0077.combinations/combinations.go b/Algorithms/0077.combinations/combinations.go new file mode 100755 index 000000000..425706a01 --- /dev/null +++ b/Algorithms/0077.combinations/combinations.go @@ -0,0 +1,2 @@ +package Problem0077 + diff --git a/Algorithms/0077.combinations/combinations_test.go b/Algorithms/0077.combinations/combinations_test.go new file mode 100755 index 000000000..88e663f21 --- /dev/null +++ b/Algorithms/0077.combinations/combinations_test.go @@ -0,0 +1,43 @@ +package Problem0077 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0077(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0078.subsets/README.md b/Algorithms/0078.subsets/README.md new file mode 100755 index 000000000..d9e31fe43 --- /dev/null +++ b/Algorithms/0078.subsets/README.md @@ -0,0 +1,11 @@ +# [78. Subsets](https://leetcode.com/problems/subsets/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0078.subsets/subsets.go b/Algorithms/0078.subsets/subsets.go new file mode 100755 index 000000000..c7c9aa1b7 --- /dev/null +++ b/Algorithms/0078.subsets/subsets.go @@ -0,0 +1,2 @@ +package Problem0078 + diff --git a/Algorithms/0078.subsets/subsets_test.go b/Algorithms/0078.subsets/subsets_test.go new file mode 100755 index 000000000..31e5b9d6d --- /dev/null +++ b/Algorithms/0078.subsets/subsets_test.go @@ -0,0 +1,43 @@ +package Problem0078 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0078(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0079.word-search/README.md b/Algorithms/0079.word-search/README.md new file mode 100755 index 000000000..f00b107bd --- /dev/null +++ b/Algorithms/0079.word-search/README.md @@ -0,0 +1,11 @@ +# [79. Word Search](https://leetcode.com/problems/word-search/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0079.word-search/word-search.go b/Algorithms/0079.word-search/word-search.go new file mode 100755 index 000000000..f6c885a4f --- /dev/null +++ b/Algorithms/0079.word-search/word-search.go @@ -0,0 +1,2 @@ +package Problem0079 + diff --git a/Algorithms/0079.word-search/word-search_test.go b/Algorithms/0079.word-search/word-search_test.go new file mode 100755 index 000000000..6245bc956 --- /dev/null +++ b/Algorithms/0079.word-search/word-search_test.go @@ -0,0 +1,43 @@ +package Problem0079 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0079(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0080.remove-duplicates-from-sorted-array-ii/README.md b/Algorithms/0080.remove-duplicates-from-sorted-array-ii/README.md new file mode 100755 index 000000000..fce50efc4 --- /dev/null +++ b/Algorithms/0080.remove-duplicates-from-sorted-array-ii/README.md @@ -0,0 +1,11 @@ +# [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.go b/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.go new file mode 100755 index 000000000..f0a573538 --- /dev/null +++ b/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.go @@ -0,0 +1,2 @@ +package Problem0080 + 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 new file mode 100755 index 000000000..d7d769c86 --- /dev/null +++ b/Algorithms/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii_test.go @@ -0,0 +1,43 @@ +package Problem0080 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0080(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0081.search-in-rotated-sorted-array-ii/README.md b/Algorithms/0081.search-in-rotated-sorted-array-ii/README.md new file mode 100755 index 000000000..e65b2fbc3 --- /dev/null +++ b/Algorithms/0081.search-in-rotated-sorted-array-ii/README.md @@ -0,0 +1,11 @@ +# [81. Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii.go b/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii.go new file mode 100755 index 000000000..6efdd98ec --- /dev/null +++ b/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii.go @@ -0,0 +1,2 @@ +package Problem0081 + 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 new file mode 100755 index 000000000..6fb3d1e84 --- /dev/null +++ b/Algorithms/0081.search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii_test.go @@ -0,0 +1,43 @@ +package Problem0081 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0081(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0082.remove-duplicates-from-sorted-list-ii/README.md b/Algorithms/0082.remove-duplicates-from-sorted-list-ii/README.md new file mode 100755 index 000000000..4407fd0a7 --- /dev/null +++ b/Algorithms/0082.remove-duplicates-from-sorted-list-ii/README.md @@ -0,0 +1,11 @@ +# [82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.go b/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.go new file mode 100755 index 000000000..ac5ce0566 --- /dev/null +++ b/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.go @@ -0,0 +1,2 @@ +package Problem0082 + 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 new file mode 100755 index 000000000..aeb277a54 --- /dev/null +++ b/Algorithms/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii_test.go @@ -0,0 +1,43 @@ +package Problem0082 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0082(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0083.remove-duplicates-from-sorted-list/README.md b/Algorithms/0083.remove-duplicates-from-sorted-list/README.md new file mode 100755 index 000000000..7e9f4a909 --- /dev/null +++ b/Algorithms/0083.remove-duplicates-from-sorted-list/README.md @@ -0,0 +1,11 @@ +# [83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.go b/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.go new file mode 100755 index 000000000..a74c5d4b6 --- /dev/null +++ b/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.go @@ -0,0 +1,2 @@ +package Problem0083 + 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 new file mode 100755 index 000000000..0f3916d5d --- /dev/null +++ b/Algorithms/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list_test.go @@ -0,0 +1,43 @@ +package Problem0083 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0083(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0084.largest-rectangle-in-histogram/README.md b/Algorithms/0084.largest-rectangle-in-histogram/README.md new file mode 100755 index 000000000..7083b7150 --- /dev/null +++ b/Algorithms/0084.largest-rectangle-in-histogram/README.md @@ -0,0 +1,11 @@ +# [84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram.go b/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram.go new file mode 100755 index 000000000..f3be9d3c7 --- /dev/null +++ b/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram.go @@ -0,0 +1,2 @@ +package Problem0084 + 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 new file mode 100755 index 000000000..7f07dceb0 --- /dev/null +++ b/Algorithms/0084.largest-rectangle-in-histogram/largest-rectangle-in-histogram_test.go @@ -0,0 +1,43 @@ +package Problem0084 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0084(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0085.maximal-rectangle/README.md b/Algorithms/0085.maximal-rectangle/README.md new file mode 100755 index 000000000..5360718ac --- /dev/null +++ b/Algorithms/0085.maximal-rectangle/README.md @@ -0,0 +1,11 @@ +# [85. Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0085.maximal-rectangle/maximal-rectangle.go b/Algorithms/0085.maximal-rectangle/maximal-rectangle.go new file mode 100755 index 000000000..39cff070b --- /dev/null +++ b/Algorithms/0085.maximal-rectangle/maximal-rectangle.go @@ -0,0 +1,2 @@ +package Problem0085 + diff --git a/Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go b/Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go new file mode 100755 index 000000000..f2510199a --- /dev/null +++ b/Algorithms/0085.maximal-rectangle/maximal-rectangle_test.go @@ -0,0 +1,43 @@ +package Problem0085 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0085(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0086.partition-list/README.md b/Algorithms/0086.partition-list/README.md new file mode 100755 index 000000000..d7f86679a --- /dev/null +++ b/Algorithms/0086.partition-list/README.md @@ -0,0 +1,11 @@ +# [86. Partition List](https://leetcode.com/problems/partition-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0086.partition-list/partition-list.go b/Algorithms/0086.partition-list/partition-list.go new file mode 100755 index 000000000..973d654d1 --- /dev/null +++ b/Algorithms/0086.partition-list/partition-list.go @@ -0,0 +1,2 @@ +package Problem0086 + diff --git a/Algorithms/0086.partition-list/partition-list_test.go b/Algorithms/0086.partition-list/partition-list_test.go new file mode 100755 index 000000000..efd35178b --- /dev/null +++ b/Algorithms/0086.partition-list/partition-list_test.go @@ -0,0 +1,43 @@ +package Problem0086 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0086(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0087.scramble-string/README.md b/Algorithms/0087.scramble-string/README.md new file mode 100755 index 000000000..6aad018e3 --- /dev/null +++ b/Algorithms/0087.scramble-string/README.md @@ -0,0 +1,11 @@ +# [87. Scramble String](https://leetcode.com/problems/scramble-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0087.scramble-string/scramble-string.go b/Algorithms/0087.scramble-string/scramble-string.go new file mode 100755 index 000000000..ad1da43a5 --- /dev/null +++ b/Algorithms/0087.scramble-string/scramble-string.go @@ -0,0 +1,2 @@ +package Problem0087 + diff --git a/Algorithms/0087.scramble-string/scramble-string_test.go b/Algorithms/0087.scramble-string/scramble-string_test.go new file mode 100755 index 000000000..d1066e87f --- /dev/null +++ b/Algorithms/0087.scramble-string/scramble-string_test.go @@ -0,0 +1,43 @@ +package Problem0087 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0087(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0088.merge-sorted-array/README.md b/Algorithms/0088.merge-sorted-array/README.md new file mode 100755 index 000000000..e9ac0aeb2 --- /dev/null +++ b/Algorithms/0088.merge-sorted-array/README.md @@ -0,0 +1,11 @@ +# [88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0088.merge-sorted-array/merge-sorted-array.go b/Algorithms/0088.merge-sorted-array/merge-sorted-array.go new file mode 100755 index 000000000..7e9cfd27e --- /dev/null +++ b/Algorithms/0088.merge-sorted-array/merge-sorted-array.go @@ -0,0 +1,2 @@ +package Problem0088 + diff --git a/Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go b/Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go new file mode 100755 index 000000000..854eb3a28 --- /dev/null +++ b/Algorithms/0088.merge-sorted-array/merge-sorted-array_test.go @@ -0,0 +1,43 @@ +package Problem0088 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0088(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0089.gray-code/README.md b/Algorithms/0089.gray-code/README.md new file mode 100755 index 000000000..0d5d64658 --- /dev/null +++ b/Algorithms/0089.gray-code/README.md @@ -0,0 +1,11 @@ +# [89. Gray Code](https://leetcode.com/problems/gray-code/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0089.gray-code/gray-code.go b/Algorithms/0089.gray-code/gray-code.go new file mode 100755 index 000000000..76cf5232e --- /dev/null +++ b/Algorithms/0089.gray-code/gray-code.go @@ -0,0 +1,2 @@ +package Problem0089 + diff --git a/Algorithms/0089.gray-code/gray-code_test.go b/Algorithms/0089.gray-code/gray-code_test.go new file mode 100755 index 000000000..8e7cb7e7c --- /dev/null +++ b/Algorithms/0089.gray-code/gray-code_test.go @@ -0,0 +1,43 @@ +package Problem0089 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0089(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0090.subsets-ii/README.md b/Algorithms/0090.subsets-ii/README.md new file mode 100755 index 000000000..ae6d6fc8a --- /dev/null +++ b/Algorithms/0090.subsets-ii/README.md @@ -0,0 +1,11 @@ +# [90. Subsets II](https://leetcode.com/problems/subsets-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0090.subsets-ii/subsets-ii.go b/Algorithms/0090.subsets-ii/subsets-ii.go new file mode 100755 index 000000000..6e4370ff7 --- /dev/null +++ b/Algorithms/0090.subsets-ii/subsets-ii.go @@ -0,0 +1,2 @@ +package Problem0090 + diff --git a/Algorithms/0090.subsets-ii/subsets-ii_test.go b/Algorithms/0090.subsets-ii/subsets-ii_test.go new file mode 100755 index 000000000..82e6b132b --- /dev/null +++ b/Algorithms/0090.subsets-ii/subsets-ii_test.go @@ -0,0 +1,43 @@ +package Problem0090 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0090(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0091.decode-ways/README.md b/Algorithms/0091.decode-ways/README.md new file mode 100755 index 000000000..2ed1932e6 --- /dev/null +++ b/Algorithms/0091.decode-ways/README.md @@ -0,0 +1,11 @@ +# [91. Decode Ways](https://leetcode.com/problems/decode-ways/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0091.decode-ways/decode-ways.go b/Algorithms/0091.decode-ways/decode-ways.go new file mode 100755 index 000000000..9fb494c49 --- /dev/null +++ b/Algorithms/0091.decode-ways/decode-ways.go @@ -0,0 +1,2 @@ +package Problem0091 + diff --git a/Algorithms/0091.decode-ways/decode-ways_test.go b/Algorithms/0091.decode-ways/decode-ways_test.go new file mode 100755 index 000000000..ffb84cf44 --- /dev/null +++ b/Algorithms/0091.decode-ways/decode-ways_test.go @@ -0,0 +1,43 @@ +package Problem0091 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0091(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0092.reverse-linked-list-ii/README.md b/Algorithms/0092.reverse-linked-list-ii/README.md new file mode 100755 index 000000000..5da4205d9 --- /dev/null +++ b/Algorithms/0092.reverse-linked-list-ii/README.md @@ -0,0 +1,11 @@ +# [92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii.go b/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii.go new file mode 100755 index 000000000..b56185972 --- /dev/null +++ b/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii.go @@ -0,0 +1,2 @@ +package Problem0092 + 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 new file mode 100755 index 000000000..edaba15af --- /dev/null +++ b/Algorithms/0092.reverse-linked-list-ii/reverse-linked-list-ii_test.go @@ -0,0 +1,43 @@ +package Problem0092 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0092(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0093.restore-ip-addresses/README.md b/Algorithms/0093.restore-ip-addresses/README.md new file mode 100755 index 000000000..723e524f7 --- /dev/null +++ b/Algorithms/0093.restore-ip-addresses/README.md @@ -0,0 +1,11 @@ +# [93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0093.restore-ip-addresses/restore-ip-addresses.go b/Algorithms/0093.restore-ip-addresses/restore-ip-addresses.go new file mode 100755 index 000000000..b2afc8d38 --- /dev/null +++ b/Algorithms/0093.restore-ip-addresses/restore-ip-addresses.go @@ -0,0 +1,2 @@ +package Problem0093 + diff --git a/Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go b/Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go new file mode 100755 index 000000000..c181e8e06 --- /dev/null +++ b/Algorithms/0093.restore-ip-addresses/restore-ip-addresses_test.go @@ -0,0 +1,43 @@ +package Problem0093 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0093(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0094.binary-tree-inorder-traversal/README.md b/Algorithms/0094.binary-tree-inorder-traversal/README.md new file mode 100755 index 000000000..627d2ef5d --- /dev/null +++ b/Algorithms/0094.binary-tree-inorder-traversal/README.md @@ -0,0 +1,11 @@ +# [94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal.go b/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal.go new file mode 100755 index 000000000..4801f0a00 --- /dev/null +++ b/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal.go @@ -0,0 +1,2 @@ +package Problem0094 + 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 new file mode 100755 index 000000000..4f4d23a74 --- /dev/null +++ b/Algorithms/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0094 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0094(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0095.unique-binary-search-trees-ii/README.md b/Algorithms/0095.unique-binary-search-trees-ii/README.md new file mode 100755 index 000000000..9149ae92c --- /dev/null +++ b/Algorithms/0095.unique-binary-search-trees-ii/README.md @@ -0,0 +1,11 @@ +# [95. Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii.go b/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii.go new file mode 100755 index 000000000..46e609a08 --- /dev/null +++ b/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii.go @@ -0,0 +1,2 @@ +package Problem0095 + 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 new file mode 100755 index 000000000..1df4e79a4 --- /dev/null +++ b/Algorithms/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii_test.go @@ -0,0 +1,43 @@ +package Problem0095 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0095(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0096.unique-binary-search-trees/README.md b/Algorithms/0096.unique-binary-search-trees/README.md new file mode 100755 index 000000000..f3c68b7f7 --- /dev/null +++ b/Algorithms/0096.unique-binary-search-trees/README.md @@ -0,0 +1,11 @@ +# [96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees.go b/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees.go new file mode 100755 index 000000000..a950aaa46 --- /dev/null +++ b/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees.go @@ -0,0 +1,2 @@ +package Problem0096 + 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 new file mode 100755 index 000000000..691cada30 --- /dev/null +++ b/Algorithms/0096.unique-binary-search-trees/unique-binary-search-trees_test.go @@ -0,0 +1,43 @@ +package Problem0096 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0096(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0097.interleaving-string/README.md b/Algorithms/0097.interleaving-string/README.md new file mode 100755 index 000000000..bbc27c568 --- /dev/null +++ b/Algorithms/0097.interleaving-string/README.md @@ -0,0 +1,11 @@ +# [97. Interleaving String](https://leetcode.com/problems/interleaving-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0097.interleaving-string/interleaving-string.go b/Algorithms/0097.interleaving-string/interleaving-string.go new file mode 100755 index 000000000..b21afeec2 --- /dev/null +++ b/Algorithms/0097.interleaving-string/interleaving-string.go @@ -0,0 +1,2 @@ +package Problem0097 + diff --git a/Algorithms/0097.interleaving-string/interleaving-string_test.go b/Algorithms/0097.interleaving-string/interleaving-string_test.go new file mode 100755 index 000000000..f541035ab --- /dev/null +++ b/Algorithms/0097.interleaving-string/interleaving-string_test.go @@ -0,0 +1,43 @@ +package Problem0097 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0097(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0098.validate-binary-search-tree/README.md b/Algorithms/0098.validate-binary-search-tree/README.md new file mode 100755 index 000000000..8c0d3b492 --- /dev/null +++ b/Algorithms/0098.validate-binary-search-tree/README.md @@ -0,0 +1,11 @@ +# [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree.go b/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree.go new file mode 100755 index 000000000..c4e86a273 --- /dev/null +++ b/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree.go @@ -0,0 +1,2 @@ +package Problem0098 + 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 new file mode 100755 index 000000000..b8229a259 --- /dev/null +++ b/Algorithms/0098.validate-binary-search-tree/validate-binary-search-tree_test.go @@ -0,0 +1,43 @@ +package Problem0098 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0098(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0099.recover-binary-search-tree/README.md b/Algorithms/0099.recover-binary-search-tree/README.md new file mode 100755 index 000000000..96e8ab124 --- /dev/null +++ b/Algorithms/0099.recover-binary-search-tree/README.md @@ -0,0 +1,11 @@ +# [99. Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree.go b/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree.go new file mode 100755 index 000000000..2f35b434e --- /dev/null +++ b/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree.go @@ -0,0 +1,2 @@ +package Problem0099 + 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 new file mode 100755 index 000000000..809bed7e3 --- /dev/null +++ b/Algorithms/0099.recover-binary-search-tree/recover-binary-search-tree_test.go @@ -0,0 +1,43 @@ +package Problem0099 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0099(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0100.same-tree/README.md b/Algorithms/0100.same-tree/README.md new file mode 100755 index 000000000..04f6db162 --- /dev/null +++ b/Algorithms/0100.same-tree/README.md @@ -0,0 +1,11 @@ +# [100. Same Tree](https://leetcode.com/problems/same-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0100.same-tree/same-tree.go b/Algorithms/0100.same-tree/same-tree.go new file mode 100755 index 000000000..47127470b --- /dev/null +++ b/Algorithms/0100.same-tree/same-tree.go @@ -0,0 +1,2 @@ +package Problem0100 + diff --git a/Algorithms/0100.same-tree/same-tree_test.go b/Algorithms/0100.same-tree/same-tree_test.go new file mode 100755 index 000000000..d47e42356 --- /dev/null +++ b/Algorithms/0100.same-tree/same-tree_test.go @@ -0,0 +1,43 @@ +package Problem0100 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0100(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0101.symmetric-tree/README.md b/Algorithms/0101.symmetric-tree/README.md new file mode 100755 index 000000000..fd85ec43a --- /dev/null +++ b/Algorithms/0101.symmetric-tree/README.md @@ -0,0 +1,11 @@ +# [101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0101.symmetric-tree/symmetric-tree.go b/Algorithms/0101.symmetric-tree/symmetric-tree.go new file mode 100755 index 000000000..ff1eeabb4 --- /dev/null +++ b/Algorithms/0101.symmetric-tree/symmetric-tree.go @@ -0,0 +1,2 @@ +package Problem0101 + diff --git a/Algorithms/0101.symmetric-tree/symmetric-tree_test.go b/Algorithms/0101.symmetric-tree/symmetric-tree_test.go new file mode 100755 index 000000000..0b7c6c992 --- /dev/null +++ b/Algorithms/0101.symmetric-tree/symmetric-tree_test.go @@ -0,0 +1,43 @@ +package Problem0101 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0101(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0102.binary-tree-level-order-traversal/README.md b/Algorithms/0102.binary-tree-level-order-traversal/README.md new file mode 100755 index 000000000..ae4e504f4 --- /dev/null +++ b/Algorithms/0102.binary-tree-level-order-traversal/README.md @@ -0,0 +1,11 @@ +# [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal.go b/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal.go new file mode 100755 index 000000000..c3269f7fa --- /dev/null +++ b/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal.go @@ -0,0 +1,2 @@ +package Problem0102 + 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 new file mode 100755 index 000000000..0d4c3393b --- /dev/null +++ b/Algorithms/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0102 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0102(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0103.binary-tree-zigzag-level-order-traversal/README.md b/Algorithms/0103.binary-tree-zigzag-level-order-traversal/README.md new file mode 100755 index 000000000..efb34fb58 --- /dev/null +++ b/Algorithms/0103.binary-tree-zigzag-level-order-traversal/README.md @@ -0,0 +1,11 @@ +# [103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal.go b/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal.go new file mode 100755 index 000000000..31fc9f529 --- /dev/null +++ b/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal.go @@ -0,0 +1,2 @@ +package Problem0103 + 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 new file mode 100755 index 000000000..721caba79 --- /dev/null +++ b/Algorithms/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0103 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0103(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0104.maximum-depth-of-binary-tree/README.md b/Algorithms/0104.maximum-depth-of-binary-tree/README.md new file mode 100755 index 000000000..3de521e96 --- /dev/null +++ b/Algorithms/0104.maximum-depth-of-binary-tree/README.md @@ -0,0 +1,11 @@ +# [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.go b/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.go new file mode 100755 index 000000000..ae3f0194f --- /dev/null +++ b/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0104 + 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 new file mode 100755 index 000000000..4d07fc4d3 --- /dev/null +++ b/Algorithms/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0104 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0104(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/README.md b/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/README.md new file mode 100755 index 000000000..7f3e7de5d --- /dev/null +++ b/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/README.md @@ -0,0 +1,11 @@ +# [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal.go b/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal.go new file mode 100755 index 000000000..8f4263215 --- /dev/null +++ b/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal.go @@ -0,0 +1,2 @@ +package Problem0105 + 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 new file mode 100755 index 000000000..3a336d32a --- /dev/null +++ b/Algorithms/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0105 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0105(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/README.md b/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/README.md new file mode 100755 index 000000000..9e01d9eba --- /dev/null +++ b/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/README.md @@ -0,0 +1,11 @@ +# [106. Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.go b/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.go new file mode 100755 index 000000000..0ce4fd2f4 --- /dev/null +++ b/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.go @@ -0,0 +1,2 @@ +package Problem0106 + 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 new file mode 100755 index 000000000..080781ccd --- /dev/null +++ b/Algorithms/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0106 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0106(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0107.binary-tree-level-order-traversal-ii/README.md b/Algorithms/0107.binary-tree-level-order-traversal-ii/README.md new file mode 100755 index 000000000..572ba0c55 --- /dev/null +++ b/Algorithms/0107.binary-tree-level-order-traversal-ii/README.md @@ -0,0 +1,11 @@ +# [107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii.go b/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii.go new file mode 100755 index 000000000..9a01cf220 --- /dev/null +++ b/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii.go @@ -0,0 +1,2 @@ +package Problem0107 + 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 new file mode 100755 index 000000000..8d0692215 --- /dev/null +++ b/Algorithms/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii_test.go @@ -0,0 +1,43 @@ +package Problem0107 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0107(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0108.convert-sorted-array-to-binary-search-tree/README.md b/Algorithms/0108.convert-sorted-array-to-binary-search-tree/README.md new file mode 100755 index 000000000..54e5c1323 --- /dev/null +++ b/Algorithms/0108.convert-sorted-array-to-binary-search-tree/README.md @@ -0,0 +1,11 @@ +# [108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree.go b/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree.go new file mode 100755 index 000000000..6cf1ba96b --- /dev/null +++ b/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree.go @@ -0,0 +1,2 @@ +package Problem0108 + 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 new file mode 100755 index 000000000..4fc335769 --- /dev/null +++ b/Algorithms/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree_test.go @@ -0,0 +1,43 @@ +package Problem0108 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0108(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0109.convert-sorted-list-to-binary-search-tree/README.md b/Algorithms/0109.convert-sorted-list-to-binary-search-tree/README.md new file mode 100755 index 000000000..45c2975d9 --- /dev/null +++ b/Algorithms/0109.convert-sorted-list-to-binary-search-tree/README.md @@ -0,0 +1,11 @@ +# [109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.go b/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.go new file mode 100755 index 000000000..1e885cba7 --- /dev/null +++ b/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.go @@ -0,0 +1,2 @@ +package Problem0109 + 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 new file mode 100755 index 000000000..38a6c6919 --- /dev/null +++ b/Algorithms/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree_test.go @@ -0,0 +1,43 @@ +package Problem0109 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0109(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0110.balanced-binary-tree/README.md b/Algorithms/0110.balanced-binary-tree/README.md new file mode 100755 index 000000000..18de4cbed --- /dev/null +++ b/Algorithms/0110.balanced-binary-tree/README.md @@ -0,0 +1,11 @@ +# [110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0110.balanced-binary-tree/balanced-binary-tree.go b/Algorithms/0110.balanced-binary-tree/balanced-binary-tree.go new file mode 100755 index 000000000..106eaaeb8 --- /dev/null +++ b/Algorithms/0110.balanced-binary-tree/balanced-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0110 + diff --git a/Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go b/Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go new file mode 100755 index 000000000..ce35dffc4 --- /dev/null +++ b/Algorithms/0110.balanced-binary-tree/balanced-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0110 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0110(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0111.minimum-depth-of-binary-tree/README.md b/Algorithms/0111.minimum-depth-of-binary-tree/README.md new file mode 100755 index 000000000..3da581908 --- /dev/null +++ b/Algorithms/0111.minimum-depth-of-binary-tree/README.md @@ -0,0 +1,11 @@ +# [111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.go b/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.go new file mode 100755 index 000000000..cf53e8872 --- /dev/null +++ b/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0111 + 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 new file mode 100755 index 000000000..7e83639e7 --- /dev/null +++ b/Algorithms/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0111 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0111(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0112.path-sum/README.md b/Algorithms/0112.path-sum/README.md new file mode 100755 index 000000000..b225333b8 --- /dev/null +++ b/Algorithms/0112.path-sum/README.md @@ -0,0 +1,11 @@ +# [112. Path Sum](https://leetcode.com/problems/path-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0112.path-sum/path-sum.go b/Algorithms/0112.path-sum/path-sum.go new file mode 100755 index 000000000..b16b83155 --- /dev/null +++ b/Algorithms/0112.path-sum/path-sum.go @@ -0,0 +1,2 @@ +package Problem0112 + diff --git a/Algorithms/0112.path-sum/path-sum_test.go b/Algorithms/0112.path-sum/path-sum_test.go new file mode 100755 index 000000000..c5d87d806 --- /dev/null +++ b/Algorithms/0112.path-sum/path-sum_test.go @@ -0,0 +1,43 @@ +package Problem0112 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0112(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0113.path-sum-ii/README.md b/Algorithms/0113.path-sum-ii/README.md new file mode 100755 index 000000000..db80c79e8 --- /dev/null +++ b/Algorithms/0113.path-sum-ii/README.md @@ -0,0 +1,11 @@ +# [113. Path Sum II](https://leetcode.com/problems/path-sum-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0113.path-sum-ii/path-sum-ii.go b/Algorithms/0113.path-sum-ii/path-sum-ii.go new file mode 100755 index 000000000..fda244bbc --- /dev/null +++ b/Algorithms/0113.path-sum-ii/path-sum-ii.go @@ -0,0 +1,2 @@ +package Problem0113 + diff --git a/Algorithms/0113.path-sum-ii/path-sum-ii_test.go b/Algorithms/0113.path-sum-ii/path-sum-ii_test.go new file mode 100755 index 000000000..b8280cbcc --- /dev/null +++ b/Algorithms/0113.path-sum-ii/path-sum-ii_test.go @@ -0,0 +1,43 @@ +package Problem0113 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0113(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0114.flatten-binary-tree-to-linked-list/README.md b/Algorithms/0114.flatten-binary-tree-to-linked-list/README.md new file mode 100755 index 000000000..1156c9c67 --- /dev/null +++ b/Algorithms/0114.flatten-binary-tree-to-linked-list/README.md @@ -0,0 +1,11 @@ +# [114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list.go b/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list.go new file mode 100755 index 000000000..9857bc473 --- /dev/null +++ b/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list.go @@ -0,0 +1,2 @@ +package Problem0114 + 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 new file mode 100755 index 000000000..9cf96d0a3 --- /dev/null +++ b/Algorithms/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list_test.go @@ -0,0 +1,43 @@ +package Problem0114 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0114(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0115.distinct-subsequences/README.md b/Algorithms/0115.distinct-subsequences/README.md new file mode 100755 index 000000000..75214412b --- /dev/null +++ b/Algorithms/0115.distinct-subsequences/README.md @@ -0,0 +1,11 @@ +# [115. Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0115.distinct-subsequences/distinct-subsequences.go b/Algorithms/0115.distinct-subsequences/distinct-subsequences.go new file mode 100755 index 000000000..7db997c94 --- /dev/null +++ b/Algorithms/0115.distinct-subsequences/distinct-subsequences.go @@ -0,0 +1,2 @@ +package Problem0115 + diff --git a/Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go b/Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go new file mode 100755 index 000000000..c085488bb --- /dev/null +++ b/Algorithms/0115.distinct-subsequences/distinct-subsequences_test.go @@ -0,0 +1,43 @@ +package Problem0115 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0115(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0116.populating-next-right-pointers-in-each-node/README.md b/Algorithms/0116.populating-next-right-pointers-in-each-node/README.md new file mode 100755 index 000000000..122a4a71b --- /dev/null +++ b/Algorithms/0116.populating-next-right-pointers-in-each-node/README.md @@ -0,0 +1,11 @@ +# [116. Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node.go b/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node.go new file mode 100755 index 000000000..bacee8474 --- /dev/null +++ b/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node.go @@ -0,0 +1,2 @@ +package Problem0116 + 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 new file mode 100755 index 000000000..248f8e825 --- /dev/null +++ b/Algorithms/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node_test.go @@ -0,0 +1,43 @@ +package Problem0116 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0116(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/README.md b/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/README.md new file mode 100755 index 000000000..45cea73d3 --- /dev/null +++ b/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/README.md @@ -0,0 +1,11 @@ +# [117. Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii.go b/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii.go new file mode 100755 index 000000000..6dc364612 --- /dev/null +++ b/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii.go @@ -0,0 +1,2 @@ +package Problem0117 + 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 new file mode 100755 index 000000000..52506a718 --- /dev/null +++ b/Algorithms/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii_test.go @@ -0,0 +1,43 @@ +package Problem0117 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0117(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0118.pascals-triangle/README.md b/Algorithms/0118.pascals-triangle/README.md new file mode 100755 index 000000000..71cc927dd --- /dev/null +++ b/Algorithms/0118.pascals-triangle/README.md @@ -0,0 +1,11 @@ +# [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0118.pascals-triangle/pascals-triangle.go b/Algorithms/0118.pascals-triangle/pascals-triangle.go new file mode 100755 index 000000000..e310fd40f --- /dev/null +++ b/Algorithms/0118.pascals-triangle/pascals-triangle.go @@ -0,0 +1,2 @@ +package Problem0118 + diff --git a/Algorithms/0118.pascals-triangle/pascals-triangle_test.go b/Algorithms/0118.pascals-triangle/pascals-triangle_test.go new file mode 100755 index 000000000..399f4e8fd --- /dev/null +++ b/Algorithms/0118.pascals-triangle/pascals-triangle_test.go @@ -0,0 +1,43 @@ +package Problem0118 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0118(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0119.pascals-triangle-ii/README.md b/Algorithms/0119.pascals-triangle-ii/README.md new file mode 100755 index 000000000..94418051f --- /dev/null +++ b/Algorithms/0119.pascals-triangle-ii/README.md @@ -0,0 +1,11 @@ +# [119. Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii.go b/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii.go new file mode 100755 index 000000000..42df0401d --- /dev/null +++ b/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii.go @@ -0,0 +1,2 @@ +package Problem0119 + diff --git a/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go b/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go new file mode 100755 index 000000000..64890583b --- /dev/null +++ b/Algorithms/0119.pascals-triangle-ii/pascals-triangle-ii_test.go @@ -0,0 +1,43 @@ +package Problem0119 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0119(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0120.triangle/README.md b/Algorithms/0120.triangle/README.md new file mode 100755 index 000000000..7486c0d8b --- /dev/null +++ b/Algorithms/0120.triangle/README.md @@ -0,0 +1,11 @@ +# [120. Triangle](https://leetcode.com/problems/triangle/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0120.triangle/triangle.go b/Algorithms/0120.triangle/triangle.go new file mode 100755 index 000000000..690f642d5 --- /dev/null +++ b/Algorithms/0120.triangle/triangle.go @@ -0,0 +1,2 @@ +package Problem0120 + diff --git a/Algorithms/0120.triangle/triangle_test.go b/Algorithms/0120.triangle/triangle_test.go new file mode 100755 index 000000000..f9c21e890 --- /dev/null +++ b/Algorithms/0120.triangle/triangle_test.go @@ -0,0 +1,43 @@ +package Problem0120 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0120(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0121.best-time-to-buy-and-sell-stock/README.md b/Algorithms/0121.best-time-to-buy-and-sell-stock/README.md new file mode 100755 index 000000000..ccdade85a --- /dev/null +++ b/Algorithms/0121.best-time-to-buy-and-sell-stock/README.md @@ -0,0 +1,11 @@ +# [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.go b/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.go new file mode 100755 index 000000000..dfd1fd30c --- /dev/null +++ b/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.go @@ -0,0 +1,2 @@ +package Problem0121 + 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 new file mode 100755 index 000000000..ba323fc3a --- /dev/null +++ b/Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock_test.go @@ -0,0 +1,43 @@ +package Problem0121 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0121(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/README.md b/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/README.md new file mode 100755 index 000000000..7d71b6c21 --- /dev/null +++ b/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/README.md @@ -0,0 +1,11 @@ +# [122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.go b/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.go new file mode 100755 index 000000000..7e0f6cfa1 --- /dev/null +++ b/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.go @@ -0,0 +1,2 @@ +package Problem0122 + 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 new file mode 100755 index 000000000..911b18886 --- /dev/null +++ b/Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii_test.go @@ -0,0 +1,43 @@ +package Problem0122 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0122(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/README.md b/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/README.md new file mode 100755 index 000000000..7577af7ed --- /dev/null +++ b/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/README.md @@ -0,0 +1,11 @@ +# [123. Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii.go b/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii.go new file mode 100755 index 000000000..75b6d1a3a --- /dev/null +++ b/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii.go @@ -0,0 +1,2 @@ +package Problem0123 + 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 new file mode 100755 index 000000000..87e06fde4 --- /dev/null +++ b/Algorithms/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii_test.go @@ -0,0 +1,43 @@ +package Problem0123 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0123(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0124.binary-tree-maximum-path-sum/README.md b/Algorithms/0124.binary-tree-maximum-path-sum/README.md new file mode 100755 index 000000000..24d908c7d --- /dev/null +++ b/Algorithms/0124.binary-tree-maximum-path-sum/README.md @@ -0,0 +1,11 @@ +# [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum.go b/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum.go new file mode 100755 index 000000000..0777e98e3 --- /dev/null +++ b/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum.go @@ -0,0 +1,2 @@ +package Problem0124 + 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 new file mode 100755 index 000000000..07070aecc --- /dev/null +++ b/Algorithms/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum_test.go @@ -0,0 +1,43 @@ +package Problem0124 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0124(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0125.valid-palindrome/README.md b/Algorithms/0125.valid-palindrome/README.md new file mode 100755 index 000000000..1fef57000 --- /dev/null +++ b/Algorithms/0125.valid-palindrome/README.md @@ -0,0 +1,11 @@ +# [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0125.valid-palindrome/valid-palindrome.go b/Algorithms/0125.valid-palindrome/valid-palindrome.go new file mode 100755 index 000000000..9ba87e369 --- /dev/null +++ b/Algorithms/0125.valid-palindrome/valid-palindrome.go @@ -0,0 +1,2 @@ +package Problem0125 + diff --git a/Algorithms/0125.valid-palindrome/valid-palindrome_test.go b/Algorithms/0125.valid-palindrome/valid-palindrome_test.go new file mode 100755 index 000000000..d9c7499e7 --- /dev/null +++ b/Algorithms/0125.valid-palindrome/valid-palindrome_test.go @@ -0,0 +1,43 @@ +package Problem0125 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0125(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0126.word-ladder-ii/README.md b/Algorithms/0126.word-ladder-ii/README.md new file mode 100755 index 000000000..24fdfe517 --- /dev/null +++ b/Algorithms/0126.word-ladder-ii/README.md @@ -0,0 +1,11 @@ +# [126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0126.word-ladder-ii/word-ladder-ii.go b/Algorithms/0126.word-ladder-ii/word-ladder-ii.go new file mode 100755 index 000000000..79a6dd658 --- /dev/null +++ b/Algorithms/0126.word-ladder-ii/word-ladder-ii.go @@ -0,0 +1,2 @@ +package Problem0126 + diff --git a/Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go b/Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go new file mode 100755 index 000000000..dbd66e695 --- /dev/null +++ b/Algorithms/0126.word-ladder-ii/word-ladder-ii_test.go @@ -0,0 +1,43 @@ +package Problem0126 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0126(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0127.word-ladder/README.md b/Algorithms/0127.word-ladder/README.md new file mode 100755 index 000000000..91e234cfc --- /dev/null +++ b/Algorithms/0127.word-ladder/README.md @@ -0,0 +1,11 @@ +# [127. Word Ladder](https://leetcode.com/problems/word-ladder/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0127.word-ladder/word-ladder.go b/Algorithms/0127.word-ladder/word-ladder.go new file mode 100755 index 000000000..69194973a --- /dev/null +++ b/Algorithms/0127.word-ladder/word-ladder.go @@ -0,0 +1,2 @@ +package Problem0127 + diff --git a/Algorithms/0127.word-ladder/word-ladder_test.go b/Algorithms/0127.word-ladder/word-ladder_test.go new file mode 100755 index 000000000..a28985b0c --- /dev/null +++ b/Algorithms/0127.word-ladder/word-ladder_test.go @@ -0,0 +1,43 @@ +package Problem0127 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0127(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0128.longest-consecutive-sequence/README.md b/Algorithms/0128.longest-consecutive-sequence/README.md new file mode 100755 index 000000000..dec1b057d --- /dev/null +++ b/Algorithms/0128.longest-consecutive-sequence/README.md @@ -0,0 +1,11 @@ +# [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence.go b/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence.go new file mode 100755 index 000000000..99b6a2807 --- /dev/null +++ b/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence.go @@ -0,0 +1,2 @@ +package Problem0128 + diff --git a/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go b/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go new file mode 100755 index 000000000..62b3a5fdb --- /dev/null +++ b/Algorithms/0128.longest-consecutive-sequence/longest-consecutive-sequence_test.go @@ -0,0 +1,43 @@ +package Problem0128 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0128(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0129.sum-root-to-leaf-numbers/README.md b/Algorithms/0129.sum-root-to-leaf-numbers/README.md new file mode 100755 index 000000000..ea61bd097 --- /dev/null +++ b/Algorithms/0129.sum-root-to-leaf-numbers/README.md @@ -0,0 +1,11 @@ +# [129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.go b/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.go new file mode 100755 index 000000000..eea64d3c3 --- /dev/null +++ b/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.go @@ -0,0 +1,2 @@ +package Problem0129 + 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 new file mode 100755 index 000000000..ea34e66b4 --- /dev/null +++ b/Algorithms/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers_test.go @@ -0,0 +1,43 @@ +package Problem0129 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0129(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0130.surrounded-regions/README.md b/Algorithms/0130.surrounded-regions/README.md new file mode 100755 index 000000000..8c74ffd30 --- /dev/null +++ b/Algorithms/0130.surrounded-regions/README.md @@ -0,0 +1,11 @@ +# [130. Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0130.surrounded-regions/surrounded-regions.go b/Algorithms/0130.surrounded-regions/surrounded-regions.go new file mode 100755 index 000000000..2c9591359 --- /dev/null +++ b/Algorithms/0130.surrounded-regions/surrounded-regions.go @@ -0,0 +1,2 @@ +package Problem0130 + diff --git a/Algorithms/0130.surrounded-regions/surrounded-regions_test.go b/Algorithms/0130.surrounded-regions/surrounded-regions_test.go new file mode 100755 index 000000000..9c446e76b --- /dev/null +++ b/Algorithms/0130.surrounded-regions/surrounded-regions_test.go @@ -0,0 +1,43 @@ +package Problem0130 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0130(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0131.palindrome-partitioning/README.md b/Algorithms/0131.palindrome-partitioning/README.md new file mode 100755 index 000000000..a59c8194e --- /dev/null +++ b/Algorithms/0131.palindrome-partitioning/README.md @@ -0,0 +1,11 @@ +# [131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0131.palindrome-partitioning/palindrome-partitioning.go b/Algorithms/0131.palindrome-partitioning/palindrome-partitioning.go new file mode 100755 index 000000000..99982ef29 --- /dev/null +++ b/Algorithms/0131.palindrome-partitioning/palindrome-partitioning.go @@ -0,0 +1,2 @@ +package Problem0131 + diff --git a/Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go b/Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go new file mode 100755 index 000000000..ece2fd4fc --- /dev/null +++ b/Algorithms/0131.palindrome-partitioning/palindrome-partitioning_test.go @@ -0,0 +1,43 @@ +package Problem0131 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0131(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0132.palindrome-partitioning-ii/README.md b/Algorithms/0132.palindrome-partitioning-ii/README.md new file mode 100755 index 000000000..2e89c19df --- /dev/null +++ b/Algorithms/0132.palindrome-partitioning-ii/README.md @@ -0,0 +1,11 @@ +# [132. Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii.go b/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii.go new file mode 100755 index 000000000..197f3068b --- /dev/null +++ b/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii.go @@ -0,0 +1,2 @@ +package Problem0132 + diff --git a/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go b/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go new file mode 100755 index 000000000..8e4b17c69 --- /dev/null +++ b/Algorithms/0132.palindrome-partitioning-ii/palindrome-partitioning-ii_test.go @@ -0,0 +1,43 @@ +package Problem0132 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0132(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0133.clone-graph/README.md b/Algorithms/0133.clone-graph/README.md new file mode 100755 index 000000000..b5e21b731 --- /dev/null +++ b/Algorithms/0133.clone-graph/README.md @@ -0,0 +1,11 @@ +# [133. Clone Graph](https://leetcode.com/problems/clone-graph/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0133.clone-graph/clone-graph.go b/Algorithms/0133.clone-graph/clone-graph.go new file mode 100755 index 000000000..0b029c4d7 --- /dev/null +++ b/Algorithms/0133.clone-graph/clone-graph.go @@ -0,0 +1,2 @@ +package Problem0133 + diff --git a/Algorithms/0133.clone-graph/clone-graph_test.go b/Algorithms/0133.clone-graph/clone-graph_test.go new file mode 100755 index 000000000..949c9dbb3 --- /dev/null +++ b/Algorithms/0133.clone-graph/clone-graph_test.go @@ -0,0 +1,43 @@ +package Problem0133 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0133(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0134.gas-station/README.md b/Algorithms/0134.gas-station/README.md new file mode 100755 index 000000000..151c498b7 --- /dev/null +++ b/Algorithms/0134.gas-station/README.md @@ -0,0 +1,11 @@ +# [134. Gas Station](https://leetcode.com/problems/gas-station/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0134.gas-station/gas-station.go b/Algorithms/0134.gas-station/gas-station.go new file mode 100755 index 000000000..ed9fc9dea --- /dev/null +++ b/Algorithms/0134.gas-station/gas-station.go @@ -0,0 +1,2 @@ +package Problem0134 + diff --git a/Algorithms/0134.gas-station/gas-station_test.go b/Algorithms/0134.gas-station/gas-station_test.go new file mode 100755 index 000000000..440b49aa9 --- /dev/null +++ b/Algorithms/0134.gas-station/gas-station_test.go @@ -0,0 +1,43 @@ +package Problem0134 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0134(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0135.candy/README.md b/Algorithms/0135.candy/README.md new file mode 100755 index 000000000..10eb761e8 --- /dev/null +++ b/Algorithms/0135.candy/README.md @@ -0,0 +1,11 @@ +# [135. Candy](https://leetcode.com/problems/candy/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0135.candy/candy.go b/Algorithms/0135.candy/candy.go new file mode 100755 index 000000000..a72ff4c7e --- /dev/null +++ b/Algorithms/0135.candy/candy.go @@ -0,0 +1,2 @@ +package Problem0135 + diff --git a/Algorithms/0135.candy/candy_test.go b/Algorithms/0135.candy/candy_test.go new file mode 100755 index 000000000..425157698 --- /dev/null +++ b/Algorithms/0135.candy/candy_test.go @@ -0,0 +1,43 @@ +package Problem0135 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0135(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0136.single-number/README.md b/Algorithms/0136.single-number/README.md new file mode 100755 index 000000000..1d3f1c816 --- /dev/null +++ b/Algorithms/0136.single-number/README.md @@ -0,0 +1,11 @@ +# [136. Single Number](https://leetcode.com/problems/single-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0136.single-number/single-number.go b/Algorithms/0136.single-number/single-number.go new file mode 100755 index 000000000..e702ee724 --- /dev/null +++ b/Algorithms/0136.single-number/single-number.go @@ -0,0 +1,2 @@ +package Problem0136 + diff --git a/Algorithms/0136.single-number/single-number_test.go b/Algorithms/0136.single-number/single-number_test.go new file mode 100755 index 000000000..dea2c8aaa --- /dev/null +++ b/Algorithms/0136.single-number/single-number_test.go @@ -0,0 +1,43 @@ +package Problem0136 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0136(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0137.single-number-ii/README.md b/Algorithms/0137.single-number-ii/README.md new file mode 100755 index 000000000..b20588e13 --- /dev/null +++ b/Algorithms/0137.single-number-ii/README.md @@ -0,0 +1,11 @@ +# [137. Single Number II](https://leetcode.com/problems/single-number-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0137.single-number-ii/single-number-ii.go b/Algorithms/0137.single-number-ii/single-number-ii.go new file mode 100755 index 000000000..341ad6a6b --- /dev/null +++ b/Algorithms/0137.single-number-ii/single-number-ii.go @@ -0,0 +1,2 @@ +package Problem0137 + diff --git a/Algorithms/0137.single-number-ii/single-number-ii_test.go b/Algorithms/0137.single-number-ii/single-number-ii_test.go new file mode 100755 index 000000000..a67a5872c --- /dev/null +++ b/Algorithms/0137.single-number-ii/single-number-ii_test.go @@ -0,0 +1,43 @@ +package Problem0137 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0137(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0138.copy-list-with-random-pointer/README.md b/Algorithms/0138.copy-list-with-random-pointer/README.md new file mode 100755 index 000000000..dc4d1c063 --- /dev/null +++ b/Algorithms/0138.copy-list-with-random-pointer/README.md @@ -0,0 +1,11 @@ +# [138. Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer.go b/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer.go new file mode 100755 index 000000000..7c26ae333 --- /dev/null +++ b/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer.go @@ -0,0 +1,2 @@ +package Problem0138 + 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 new file mode 100755 index 000000000..85b2b81c1 --- /dev/null +++ b/Algorithms/0138.copy-list-with-random-pointer/copy-list-with-random-pointer_test.go @@ -0,0 +1,43 @@ +package Problem0138 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0138(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0139.word-break/README.md b/Algorithms/0139.word-break/README.md new file mode 100755 index 000000000..7ccf54488 --- /dev/null +++ b/Algorithms/0139.word-break/README.md @@ -0,0 +1,11 @@ +# [139. Word Break](https://leetcode.com/problems/word-break/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0139.word-break/word-break.go b/Algorithms/0139.word-break/word-break.go new file mode 100755 index 000000000..c2f9b6b30 --- /dev/null +++ b/Algorithms/0139.word-break/word-break.go @@ -0,0 +1,2 @@ +package Problem0139 + diff --git a/Algorithms/0139.word-break/word-break_test.go b/Algorithms/0139.word-break/word-break_test.go new file mode 100755 index 000000000..1e22650f8 --- /dev/null +++ b/Algorithms/0139.word-break/word-break_test.go @@ -0,0 +1,43 @@ +package Problem0139 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0139(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0140.word-break-ii/README.md b/Algorithms/0140.word-break-ii/README.md new file mode 100755 index 000000000..df5d9799f --- /dev/null +++ b/Algorithms/0140.word-break-ii/README.md @@ -0,0 +1,11 @@ +# [140. Word Break II](https://leetcode.com/problems/word-break-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0140.word-break-ii/word-break-ii.go b/Algorithms/0140.word-break-ii/word-break-ii.go new file mode 100755 index 000000000..854d97cab --- /dev/null +++ b/Algorithms/0140.word-break-ii/word-break-ii.go @@ -0,0 +1,2 @@ +package Problem0140 + diff --git a/Algorithms/0140.word-break-ii/word-break-ii_test.go b/Algorithms/0140.word-break-ii/word-break-ii_test.go new file mode 100755 index 000000000..ffbcb76fe --- /dev/null +++ b/Algorithms/0140.word-break-ii/word-break-ii_test.go @@ -0,0 +1,43 @@ +package Problem0140 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0140(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0141.linked-list-cycle/README.md b/Algorithms/0141.linked-list-cycle/README.md new file mode 100755 index 000000000..52b981814 --- /dev/null +++ b/Algorithms/0141.linked-list-cycle/README.md @@ -0,0 +1,11 @@ +# [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0141.linked-list-cycle/linked-list-cycle.go b/Algorithms/0141.linked-list-cycle/linked-list-cycle.go new file mode 100755 index 000000000..665da6c21 --- /dev/null +++ b/Algorithms/0141.linked-list-cycle/linked-list-cycle.go @@ -0,0 +1,2 @@ +package Problem0141 + diff --git a/Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go b/Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go new file mode 100755 index 000000000..f3b7d795d --- /dev/null +++ b/Algorithms/0141.linked-list-cycle/linked-list-cycle_test.go @@ -0,0 +1,43 @@ +package Problem0141 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0141(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0142.linked-list-cycle-ii/README.md b/Algorithms/0142.linked-list-cycle-ii/README.md new file mode 100755 index 000000000..33c05dea4 --- /dev/null +++ b/Algorithms/0142.linked-list-cycle-ii/README.md @@ -0,0 +1,11 @@ +# [142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii.go b/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii.go new file mode 100755 index 000000000..e573f7987 --- /dev/null +++ b/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii.go @@ -0,0 +1,2 @@ +package Problem0142 + 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 new file mode 100755 index 000000000..a804e7a4b --- /dev/null +++ b/Algorithms/0142.linked-list-cycle-ii/linked-list-cycle-ii_test.go @@ -0,0 +1,43 @@ +package Problem0142 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0142(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0143.reorder-list/README.md b/Algorithms/0143.reorder-list/README.md new file mode 100755 index 000000000..c1aecf1f6 --- /dev/null +++ b/Algorithms/0143.reorder-list/README.md @@ -0,0 +1,11 @@ +# [143. Reorder List](https://leetcode.com/problems/reorder-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0143.reorder-list/reorder-list.go b/Algorithms/0143.reorder-list/reorder-list.go new file mode 100755 index 000000000..c4d60aa51 --- /dev/null +++ b/Algorithms/0143.reorder-list/reorder-list.go @@ -0,0 +1,2 @@ +package Problem0143 + diff --git a/Algorithms/0143.reorder-list/reorder-list_test.go b/Algorithms/0143.reorder-list/reorder-list_test.go new file mode 100755 index 000000000..3c0c0869a --- /dev/null +++ b/Algorithms/0143.reorder-list/reorder-list_test.go @@ -0,0 +1,43 @@ +package Problem0143 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0143(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0144.binary-tree-preorder-traversal/README.md b/Algorithms/0144.binary-tree-preorder-traversal/README.md new file mode 100755 index 000000000..42878210f --- /dev/null +++ b/Algorithms/0144.binary-tree-preorder-traversal/README.md @@ -0,0 +1,11 @@ +# [144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal.go b/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal.go new file mode 100755 index 000000000..9cabedc0d --- /dev/null +++ b/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal.go @@ -0,0 +1,2 @@ +package Problem0144 + 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 new file mode 100755 index 000000000..14f410829 --- /dev/null +++ b/Algorithms/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0144 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0144(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0145.binary-tree-postorder-traversal/README.md b/Algorithms/0145.binary-tree-postorder-traversal/README.md new file mode 100755 index 000000000..b4c812eb5 --- /dev/null +++ b/Algorithms/0145.binary-tree-postorder-traversal/README.md @@ -0,0 +1,11 @@ +# [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal.go b/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal.go new file mode 100755 index 000000000..d6f222570 --- /dev/null +++ b/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal.go @@ -0,0 +1,2 @@ +package Problem0145 + 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 new file mode 100755 index 000000000..fa337eb85 --- /dev/null +++ b/Algorithms/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0145 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0145(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0146.lru-cache/README.md b/Algorithms/0146.lru-cache/README.md new file mode 100755 index 000000000..f5eb745cf --- /dev/null +++ b/Algorithms/0146.lru-cache/README.md @@ -0,0 +1,11 @@ +# [146. LRU Cache](https://leetcode.com/problems/lru-cache/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0146.lru-cache/lru-cache.go b/Algorithms/0146.lru-cache/lru-cache.go new file mode 100755 index 000000000..b6d781a19 --- /dev/null +++ b/Algorithms/0146.lru-cache/lru-cache.go @@ -0,0 +1,2 @@ +package Problem0146 + diff --git a/Algorithms/0146.lru-cache/lru-cache_test.go b/Algorithms/0146.lru-cache/lru-cache_test.go new file mode 100755 index 000000000..e28a70488 --- /dev/null +++ b/Algorithms/0146.lru-cache/lru-cache_test.go @@ -0,0 +1,43 @@ +package Problem0146 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0146(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0147.insertion-sort-list/README.md b/Algorithms/0147.insertion-sort-list/README.md new file mode 100755 index 000000000..f152bc392 --- /dev/null +++ b/Algorithms/0147.insertion-sort-list/README.md @@ -0,0 +1,11 @@ +# [147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0147.insertion-sort-list/insertion-sort-list.go b/Algorithms/0147.insertion-sort-list/insertion-sort-list.go new file mode 100755 index 000000000..3f5664a33 --- /dev/null +++ b/Algorithms/0147.insertion-sort-list/insertion-sort-list.go @@ -0,0 +1,2 @@ +package Problem0147 + diff --git a/Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go b/Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go new file mode 100755 index 000000000..f373b5b7e --- /dev/null +++ b/Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go @@ -0,0 +1,43 @@ +package Problem0147 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0147(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0148.sort-list/README.md b/Algorithms/0148.sort-list/README.md new file mode 100755 index 000000000..2f5d297ab --- /dev/null +++ b/Algorithms/0148.sort-list/README.md @@ -0,0 +1,11 @@ +# [148. Sort List](https://leetcode.com/problems/sort-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0148.sort-list/sort-list.go b/Algorithms/0148.sort-list/sort-list.go new file mode 100755 index 000000000..7e4d06901 --- /dev/null +++ b/Algorithms/0148.sort-list/sort-list.go @@ -0,0 +1,2 @@ +package Problem0148 + diff --git a/Algorithms/0148.sort-list/sort-list_test.go b/Algorithms/0148.sort-list/sort-list_test.go new file mode 100755 index 000000000..2a7876046 --- /dev/null +++ b/Algorithms/0148.sort-list/sort-list_test.go @@ -0,0 +1,43 @@ +package Problem0148 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0148(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0149.max-points-on-a-line/README.md b/Algorithms/0149.max-points-on-a-line/README.md new file mode 100755 index 000000000..89d506287 --- /dev/null +++ b/Algorithms/0149.max-points-on-a-line/README.md @@ -0,0 +1,11 @@ +# [149. Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0149.max-points-on-a-line/max-points-on-a-line.go b/Algorithms/0149.max-points-on-a-line/max-points-on-a-line.go new file mode 100755 index 000000000..48fa9c6b0 --- /dev/null +++ b/Algorithms/0149.max-points-on-a-line/max-points-on-a-line.go @@ -0,0 +1,2 @@ +package Problem0149 + 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 new file mode 100755 index 000000000..1e95f17e4 --- /dev/null +++ b/Algorithms/0149.max-points-on-a-line/max-points-on-a-line_test.go @@ -0,0 +1,43 @@ +package Problem0149 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0149(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0150.evaluate-reverse-polish-notation/README.md b/Algorithms/0150.evaluate-reverse-polish-notation/README.md new file mode 100755 index 000000000..f1423f3ed --- /dev/null +++ b/Algorithms/0150.evaluate-reverse-polish-notation/README.md @@ -0,0 +1,11 @@ +# [150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation.go b/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation.go new file mode 100755 index 000000000..5ecdad359 --- /dev/null +++ b/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation.go @@ -0,0 +1,2 @@ +package Problem0150 + 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 new file mode 100755 index 000000000..c7d55ec2d --- /dev/null +++ b/Algorithms/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation_test.go @@ -0,0 +1,43 @@ +package Problem0150 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0150(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0151.reverse-words-in-a-string/README.md b/Algorithms/0151.reverse-words-in-a-string/README.md new file mode 100755 index 000000000..2a3de1efc --- /dev/null +++ b/Algorithms/0151.reverse-words-in-a-string/README.md @@ -0,0 +1,11 @@ +# [151. Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string.go b/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string.go new file mode 100755 index 000000000..686439d26 --- /dev/null +++ b/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string.go @@ -0,0 +1,2 @@ +package Problem0151 + 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 new file mode 100755 index 000000000..478463ce2 --- /dev/null +++ b/Algorithms/0151.reverse-words-in-a-string/reverse-words-in-a-string_test.go @@ -0,0 +1,43 @@ +package Problem0151 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0151(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0152.maximum-product-subarray/README.md b/Algorithms/0152.maximum-product-subarray/README.md new file mode 100755 index 000000000..529693217 --- /dev/null +++ b/Algorithms/0152.maximum-product-subarray/README.md @@ -0,0 +1,11 @@ +# [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0152.maximum-product-subarray/maximum-product-subarray.go b/Algorithms/0152.maximum-product-subarray/maximum-product-subarray.go new file mode 100755 index 000000000..9045b7a34 --- /dev/null +++ b/Algorithms/0152.maximum-product-subarray/maximum-product-subarray.go @@ -0,0 +1,2 @@ +package Problem0152 + diff --git a/Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go b/Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go new file mode 100755 index 000000000..2f8375df3 --- /dev/null +++ b/Algorithms/0152.maximum-product-subarray/maximum-product-subarray_test.go @@ -0,0 +1,43 @@ +package Problem0152 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0152(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0153.find-minimum-in-rotated-sorted-array/README.md b/Algorithms/0153.find-minimum-in-rotated-sorted-array/README.md new file mode 100755 index 000000000..a21a6be6f --- /dev/null +++ b/Algorithms/0153.find-minimum-in-rotated-sorted-array/README.md @@ -0,0 +1,11 @@ +# [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.go b/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.go new file mode 100755 index 000000000..9e7def54a --- /dev/null +++ b/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.go @@ -0,0 +1,2 @@ +package Problem0153 + 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 new file mode 100755 index 000000000..093845db6 --- /dev/null +++ b/Algorithms/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array_test.go @@ -0,0 +1,43 @@ +package Problem0153 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0153(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/README.md b/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/README.md new file mode 100755 index 000000000..00e5e7d5b --- /dev/null +++ b/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/README.md @@ -0,0 +1,11 @@ +# [154. Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii.go b/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii.go new file mode 100755 index 000000000..7022db3a6 --- /dev/null +++ b/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii.go @@ -0,0 +1,2 @@ +package Problem0154 + 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 new file mode 100755 index 000000000..1c43d4916 --- /dev/null +++ b/Algorithms/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii_test.go @@ -0,0 +1,43 @@ +package Problem0154 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0154(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0155.min-stack/README.md b/Algorithms/0155.min-stack/README.md new file mode 100755 index 000000000..27f55acba --- /dev/null +++ b/Algorithms/0155.min-stack/README.md @@ -0,0 +1,11 @@ +# [155. Min Stack](https://leetcode.com/problems/min-stack/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0155.min-stack/min-stack.go b/Algorithms/0155.min-stack/min-stack.go new file mode 100755 index 000000000..a75851c7a --- /dev/null +++ b/Algorithms/0155.min-stack/min-stack.go @@ -0,0 +1,2 @@ +package Problem0155 + diff --git a/Algorithms/0155.min-stack/min-stack_test.go b/Algorithms/0155.min-stack/min-stack_test.go new file mode 100755 index 000000000..ca0f9463a --- /dev/null +++ b/Algorithms/0155.min-stack/min-stack_test.go @@ -0,0 +1,43 @@ +package Problem0155 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0155(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0156.binary-tree-upside-down/README.md b/Algorithms/0156.binary-tree-upside-down/README.md new file mode 100755 index 000000000..252e8e8c9 --- /dev/null +++ b/Algorithms/0156.binary-tree-upside-down/README.md @@ -0,0 +1,11 @@ +# [156. Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down.go b/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down.go new file mode 100755 index 000000000..39efb8159 --- /dev/null +++ b/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down.go @@ -0,0 +1,2 @@ +package Problem0156 + 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 new file mode 100755 index 000000000..41877230d --- /dev/null +++ b/Algorithms/0156.binary-tree-upside-down/binary-tree-upside-down_test.go @@ -0,0 +1,43 @@ +package Problem0156 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0156(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0157.read-n-characters-given-read4/README.md b/Algorithms/0157.read-n-characters-given-read4/README.md new file mode 100755 index 000000000..3ce91124f --- /dev/null +++ b/Algorithms/0157.read-n-characters-given-read4/README.md @@ -0,0 +1,11 @@ +# [157. Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4.go b/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4.go new file mode 100755 index 000000000..f4fc790ca --- /dev/null +++ b/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4.go @@ -0,0 +1,2 @@ +package Problem0157 + 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 new file mode 100755 index 000000000..25f5ba0a8 --- /dev/null +++ b/Algorithms/0157.read-n-characters-given-read4/read-n-characters-given-read4_test.go @@ -0,0 +1,43 @@ +package Problem0157 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0157(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/README.md b/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/README.md new file mode 100755 index 000000000..976aa606e --- /dev/null +++ b/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/README.md @@ -0,0 +1,11 @@ +# [158. Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times.go b/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times.go new file mode 100755 index 000000000..f5eb53582 --- /dev/null +++ b/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times.go @@ -0,0 +1,2 @@ +package Problem0158 + 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 new file mode 100755 index 000000000..274863099 --- /dev/null +++ b/Algorithms/0158.read-n-characters-given-read4-ii-call-multiple-times/read-n-characters-given-read4-ii-call-multiple-times_test.go @@ -0,0 +1,43 @@ +package Problem0158 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0158(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/README.md b/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/README.md new file mode 100755 index 000000000..01a1bd4ce --- /dev/null +++ b/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/README.md @@ -0,0 +1,11 @@ +# [159. Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters.go b/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters.go new file mode 100755 index 000000000..bde0f4dc8 --- /dev/null +++ b/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters.go @@ -0,0 +1,2 @@ +package Problem0159 + 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 new file mode 100755 index 000000000..e39cd5869 --- /dev/null +++ b/Algorithms/0159.longest-substring-with-at-most-two-distinct-characters/longest-substring-with-at-most-two-distinct-characters_test.go @@ -0,0 +1,43 @@ +package Problem0159 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0159(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0160.intersection-of-two-linked-lists/README.md b/Algorithms/0160.intersection-of-two-linked-lists/README.md new file mode 100755 index 000000000..c26153f0a --- /dev/null +++ b/Algorithms/0160.intersection-of-two-linked-lists/README.md @@ -0,0 +1,11 @@ +# [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists.go b/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists.go new file mode 100755 index 000000000..6a377e5ef --- /dev/null +++ b/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists.go @@ -0,0 +1,2 @@ +package Problem0160 + 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 new file mode 100755 index 000000000..f6f5e6ac4 --- /dev/null +++ b/Algorithms/0160.intersection-of-two-linked-lists/intersection-of-two-linked-lists_test.go @@ -0,0 +1,43 @@ +package Problem0160 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0160(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0161.one-edit-distance/README.md b/Algorithms/0161.one-edit-distance/README.md new file mode 100755 index 000000000..0fab97158 --- /dev/null +++ b/Algorithms/0161.one-edit-distance/README.md @@ -0,0 +1,11 @@ +# [161. One Edit Distance](https://leetcode.com/problems/one-edit-distance/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0161.one-edit-distance/one-edit-distance.go b/Algorithms/0161.one-edit-distance/one-edit-distance.go new file mode 100755 index 000000000..c3bcc7bc5 --- /dev/null +++ b/Algorithms/0161.one-edit-distance/one-edit-distance.go @@ -0,0 +1,2 @@ +package Problem0161 + diff --git a/Algorithms/0161.one-edit-distance/one-edit-distance_test.go b/Algorithms/0161.one-edit-distance/one-edit-distance_test.go new file mode 100755 index 000000000..b9ee0f7a8 --- /dev/null +++ b/Algorithms/0161.one-edit-distance/one-edit-distance_test.go @@ -0,0 +1,43 @@ +package Problem0161 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0161(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0162.find-peak-element/README.md b/Algorithms/0162.find-peak-element/README.md new file mode 100755 index 000000000..c2ce69fcc --- /dev/null +++ b/Algorithms/0162.find-peak-element/README.md @@ -0,0 +1,11 @@ +# [162. Find Peak Element](https://leetcode.com/problems/find-peak-element/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0162.find-peak-element/find-peak-element.go b/Algorithms/0162.find-peak-element/find-peak-element.go new file mode 100755 index 000000000..91d55da8c --- /dev/null +++ b/Algorithms/0162.find-peak-element/find-peak-element.go @@ -0,0 +1,2 @@ +package Problem0162 + diff --git a/Algorithms/0162.find-peak-element/find-peak-element_test.go b/Algorithms/0162.find-peak-element/find-peak-element_test.go new file mode 100755 index 000000000..4bdef56e2 --- /dev/null +++ b/Algorithms/0162.find-peak-element/find-peak-element_test.go @@ -0,0 +1,43 @@ +package Problem0162 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0162(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0163.missing-ranges/README.md b/Algorithms/0163.missing-ranges/README.md new file mode 100755 index 000000000..1dac1398f --- /dev/null +++ b/Algorithms/0163.missing-ranges/README.md @@ -0,0 +1,11 @@ +# [163. Missing Ranges](https://leetcode.com/problems/missing-ranges/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0163.missing-ranges/missing-ranges.go b/Algorithms/0163.missing-ranges/missing-ranges.go new file mode 100755 index 000000000..e956f7040 --- /dev/null +++ b/Algorithms/0163.missing-ranges/missing-ranges.go @@ -0,0 +1,2 @@ +package Problem0163 + diff --git a/Algorithms/0163.missing-ranges/missing-ranges_test.go b/Algorithms/0163.missing-ranges/missing-ranges_test.go new file mode 100755 index 000000000..ecf889491 --- /dev/null +++ b/Algorithms/0163.missing-ranges/missing-ranges_test.go @@ -0,0 +1,43 @@ +package Problem0163 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0163(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0164.maximum-gap/README.md b/Algorithms/0164.maximum-gap/README.md new file mode 100755 index 000000000..c7b676a78 --- /dev/null +++ b/Algorithms/0164.maximum-gap/README.md @@ -0,0 +1,11 @@ +# [164. Maximum Gap](https://leetcode.com/problems/maximum-gap/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0164.maximum-gap/maximum-gap.go b/Algorithms/0164.maximum-gap/maximum-gap.go new file mode 100755 index 000000000..e65d0bdba --- /dev/null +++ b/Algorithms/0164.maximum-gap/maximum-gap.go @@ -0,0 +1,2 @@ +package Problem0164 + diff --git a/Algorithms/0164.maximum-gap/maximum-gap_test.go b/Algorithms/0164.maximum-gap/maximum-gap_test.go new file mode 100755 index 000000000..ddd4ae2d8 --- /dev/null +++ b/Algorithms/0164.maximum-gap/maximum-gap_test.go @@ -0,0 +1,43 @@ +package Problem0164 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0164(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0165.compare-version-numbers/README.md b/Algorithms/0165.compare-version-numbers/README.md new file mode 100755 index 000000000..97b86dd88 --- /dev/null +++ b/Algorithms/0165.compare-version-numbers/README.md @@ -0,0 +1,11 @@ +# [165. Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0165.compare-version-numbers/compare-version-numbers.go b/Algorithms/0165.compare-version-numbers/compare-version-numbers.go new file mode 100755 index 000000000..a2b877672 --- /dev/null +++ b/Algorithms/0165.compare-version-numbers/compare-version-numbers.go @@ -0,0 +1,2 @@ +package Problem0165 + diff --git a/Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go b/Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go new file mode 100755 index 000000000..12c8055f1 --- /dev/null +++ b/Algorithms/0165.compare-version-numbers/compare-version-numbers_test.go @@ -0,0 +1,43 @@ +package Problem0165 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0165(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0166.fraction-to-recurring-decimal/README.md b/Algorithms/0166.fraction-to-recurring-decimal/README.md new file mode 100755 index 000000000..325a0b9aa --- /dev/null +++ b/Algorithms/0166.fraction-to-recurring-decimal/README.md @@ -0,0 +1,11 @@ +# [166. Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal.go b/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal.go new file mode 100755 index 000000000..70ae32db8 --- /dev/null +++ b/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal.go @@ -0,0 +1,2 @@ +package Problem0166 + 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 new file mode 100755 index 000000000..8a0c952bf --- /dev/null +++ b/Algorithms/0166.fraction-to-recurring-decimal/fraction-to-recurring-decimal_test.go @@ -0,0 +1,43 @@ +package Problem0166 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0166(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0167.two-sum-ii-input-array-is-sorted/README.md b/Algorithms/0167.two-sum-ii-input-array-is-sorted/README.md new file mode 100755 index 000000000..fc600d248 --- /dev/null +++ b/Algorithms/0167.two-sum-ii-input-array-is-sorted/README.md @@ -0,0 +1,11 @@ +# [167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.go b/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.go new file mode 100755 index 000000000..dca781179 --- /dev/null +++ b/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.go @@ -0,0 +1,2 @@ +package Problem0167 + 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 new file mode 100755 index 000000000..64ad4f78c --- /dev/null +++ b/Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted_test.go @@ -0,0 +1,43 @@ +package Problem0167 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0167(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0168.excel-sheet-column-title/README.md b/Algorithms/0168.excel-sheet-column-title/README.md new file mode 100755 index 000000000..bd10b5a96 --- /dev/null +++ b/Algorithms/0168.excel-sheet-column-title/README.md @@ -0,0 +1,11 @@ +# [168. Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title.go b/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title.go new file mode 100755 index 000000000..5358af617 --- /dev/null +++ b/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title.go @@ -0,0 +1,2 @@ +package Problem0168 + 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 new file mode 100755 index 000000000..684dc0a2e --- /dev/null +++ b/Algorithms/0168.excel-sheet-column-title/excel-sheet-column-title_test.go @@ -0,0 +1,43 @@ +package Problem0168 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0168(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0169.majority-element/README.md b/Algorithms/0169.majority-element/README.md new file mode 100755 index 000000000..ba4c86e57 --- /dev/null +++ b/Algorithms/0169.majority-element/README.md @@ -0,0 +1,11 @@ +# [169. Majority Element](https://leetcode.com/problems/majority-element/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0169.majority-element/majority-element.go b/Algorithms/0169.majority-element/majority-element.go new file mode 100755 index 000000000..c11c8ec93 --- /dev/null +++ b/Algorithms/0169.majority-element/majority-element.go @@ -0,0 +1,2 @@ +package Problem0169 + diff --git a/Algorithms/0169.majority-element/majority-element_test.go b/Algorithms/0169.majority-element/majority-element_test.go new file mode 100755 index 000000000..8920a49a5 --- /dev/null +++ b/Algorithms/0169.majority-element/majority-element_test.go @@ -0,0 +1,43 @@ +package Problem0169 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0169(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0170.two-sum-iii-data-structure-design/README.md b/Algorithms/0170.two-sum-iii-data-structure-design/README.md new file mode 100755 index 000000000..291123d3b --- /dev/null +++ b/Algorithms/0170.two-sum-iii-data-structure-design/README.md @@ -0,0 +1,11 @@ +# [170. Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design.go b/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design.go new file mode 100755 index 000000000..29774ba18 --- /dev/null +++ b/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design.go @@ -0,0 +1,2 @@ +package Problem0170 + 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 new file mode 100755 index 000000000..c4072e821 --- /dev/null +++ b/Algorithms/0170.two-sum-iii-data-structure-design/two-sum-iii-data-structure-design_test.go @@ -0,0 +1,43 @@ +package Problem0170 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0170(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0171.excel-sheet-column-number/README.md b/Algorithms/0171.excel-sheet-column-number/README.md new file mode 100755 index 000000000..25f24e582 --- /dev/null +++ b/Algorithms/0171.excel-sheet-column-number/README.md @@ -0,0 +1,11 @@ +# [171. Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number.go b/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number.go new file mode 100755 index 000000000..292823092 --- /dev/null +++ b/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number.go @@ -0,0 +1,2 @@ +package Problem0171 + 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 new file mode 100755 index 000000000..83d08dbcc --- /dev/null +++ b/Algorithms/0171.excel-sheet-column-number/excel-sheet-column-number_test.go @@ -0,0 +1,43 @@ +package Problem0171 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0171(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0172.factorial-trailing-zeroes/README.md b/Algorithms/0172.factorial-trailing-zeroes/README.md new file mode 100755 index 000000000..9db2966ac --- /dev/null +++ b/Algorithms/0172.factorial-trailing-zeroes/README.md @@ -0,0 +1,11 @@ +# [172. Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes.go b/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes.go new file mode 100755 index 000000000..032cd5f67 --- /dev/null +++ b/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes.go @@ -0,0 +1,2 @@ +package Problem0172 + diff --git a/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go b/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go new file mode 100755 index 000000000..d555f8f22 --- /dev/null +++ b/Algorithms/0172.factorial-trailing-zeroes/factorial-trailing-zeroes_test.go @@ -0,0 +1,43 @@ +package Problem0172 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0172(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0173.binary-search-tree-iterator/README.md b/Algorithms/0173.binary-search-tree-iterator/README.md new file mode 100755 index 000000000..2ea169888 --- /dev/null +++ b/Algorithms/0173.binary-search-tree-iterator/README.md @@ -0,0 +1,11 @@ +# [173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go b/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go new file mode 100755 index 000000000..cacb74751 --- /dev/null +++ b/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go @@ -0,0 +1,2 @@ +package Problem0173 + 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 new file mode 100755 index 000000000..1f442c40d --- /dev/null +++ b/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator_test.go @@ -0,0 +1,43 @@ +package Problem0173 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0173(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0174.dungeon-game/README.md b/Algorithms/0174.dungeon-game/README.md new file mode 100755 index 000000000..b32027ede --- /dev/null +++ b/Algorithms/0174.dungeon-game/README.md @@ -0,0 +1,11 @@ +# [174. Dungeon Game](https://leetcode.com/problems/dungeon-game/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0174.dungeon-game/dungeon-game.go b/Algorithms/0174.dungeon-game/dungeon-game.go new file mode 100755 index 000000000..a0ba9791b --- /dev/null +++ b/Algorithms/0174.dungeon-game/dungeon-game.go @@ -0,0 +1,2 @@ +package Problem0174 + diff --git a/Algorithms/0174.dungeon-game/dungeon-game_test.go b/Algorithms/0174.dungeon-game/dungeon-game_test.go new file mode 100755 index 000000000..83687c985 --- /dev/null +++ b/Algorithms/0174.dungeon-game/dungeon-game_test.go @@ -0,0 +1,43 @@ +package Problem0174 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0174(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0179.largest-number/README.md b/Algorithms/0179.largest-number/README.md new file mode 100755 index 000000000..ff565618d --- /dev/null +++ b/Algorithms/0179.largest-number/README.md @@ -0,0 +1,11 @@ +# [179. Largest Number](https://leetcode.com/problems/largest-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0179.largest-number/largest-number.go b/Algorithms/0179.largest-number/largest-number.go new file mode 100755 index 000000000..6f5b22cd1 --- /dev/null +++ b/Algorithms/0179.largest-number/largest-number.go @@ -0,0 +1,2 @@ +package Problem0179 + diff --git a/Algorithms/0179.largest-number/largest-number_test.go b/Algorithms/0179.largest-number/largest-number_test.go new file mode 100755 index 000000000..9cb6c015b --- /dev/null +++ b/Algorithms/0179.largest-number/largest-number_test.go @@ -0,0 +1,43 @@ +package Problem0179 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0179(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0186.reverse-words-in-a-string-ii/README.md b/Algorithms/0186.reverse-words-in-a-string-ii/README.md new file mode 100755 index 000000000..4ed9d44f1 --- /dev/null +++ b/Algorithms/0186.reverse-words-in-a-string-ii/README.md @@ -0,0 +1,11 @@ +# [186. Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii.go b/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii.go new file mode 100755 index 000000000..43231362d --- /dev/null +++ b/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii.go @@ -0,0 +1,2 @@ +package Problem0186 + 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 new file mode 100755 index 000000000..a4f9dfa31 --- /dev/null +++ b/Algorithms/0186.reverse-words-in-a-string-ii/reverse-words-in-a-string-ii_test.go @@ -0,0 +1,43 @@ +package Problem0186 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0186(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0187.repeated-dna-sequences/README.md b/Algorithms/0187.repeated-dna-sequences/README.md new file mode 100755 index 000000000..0410f21de --- /dev/null +++ b/Algorithms/0187.repeated-dna-sequences/README.md @@ -0,0 +1,11 @@ +# [187. Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences.go b/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences.go new file mode 100755 index 000000000..cf5e6bb8a --- /dev/null +++ b/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences.go @@ -0,0 +1,2 @@ +package Problem0187 + diff --git a/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go b/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go new file mode 100755 index 000000000..c7f28ea41 --- /dev/null +++ b/Algorithms/0187.repeated-dna-sequences/repeated-dna-sequences_test.go @@ -0,0 +1,43 @@ +package Problem0187 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0187(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/README.md b/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/README.md new file mode 100755 index 000000000..145170b82 --- /dev/null +++ b/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/README.md @@ -0,0 +1,11 @@ +# [188. Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv.go b/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv.go new file mode 100755 index 000000000..88d89f7a2 --- /dev/null +++ b/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv.go @@ -0,0 +1,2 @@ +package Problem0188 + 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 new file mode 100755 index 000000000..d50072a99 --- /dev/null +++ b/Algorithms/0188.best-time-to-buy-and-sell-stock-iv/best-time-to-buy-and-sell-stock-iv_test.go @@ -0,0 +1,43 @@ +package Problem0188 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0188(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0189.rotate-array/README.md b/Algorithms/0189.rotate-array/README.md new file mode 100755 index 000000000..0820c0c68 --- /dev/null +++ b/Algorithms/0189.rotate-array/README.md @@ -0,0 +1,11 @@ +# [189. Rotate Array](https://leetcode.com/problems/rotate-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0189.rotate-array/rotate-array.go b/Algorithms/0189.rotate-array/rotate-array.go new file mode 100755 index 000000000..9619a1fdc --- /dev/null +++ b/Algorithms/0189.rotate-array/rotate-array.go @@ -0,0 +1,2 @@ +package Problem0189 + diff --git a/Algorithms/0189.rotate-array/rotate-array_test.go b/Algorithms/0189.rotate-array/rotate-array_test.go new file mode 100755 index 000000000..e1c7cc4c4 --- /dev/null +++ b/Algorithms/0189.rotate-array/rotate-array_test.go @@ -0,0 +1,43 @@ +package Problem0189 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0189(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0190.reverse-bits/README.md b/Algorithms/0190.reverse-bits/README.md new file mode 100755 index 000000000..8ba76e4ed --- /dev/null +++ b/Algorithms/0190.reverse-bits/README.md @@ -0,0 +1,11 @@ +# [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0190.reverse-bits/reverse-bits.go b/Algorithms/0190.reverse-bits/reverse-bits.go new file mode 100755 index 000000000..08d2f0164 --- /dev/null +++ b/Algorithms/0190.reverse-bits/reverse-bits.go @@ -0,0 +1,2 @@ +package Problem0190 + diff --git a/Algorithms/0190.reverse-bits/reverse-bits_test.go b/Algorithms/0190.reverse-bits/reverse-bits_test.go new file mode 100755 index 000000000..b46aee4df --- /dev/null +++ b/Algorithms/0190.reverse-bits/reverse-bits_test.go @@ -0,0 +1,43 @@ +package Problem0190 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0190(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0191.number-of-1-bits/README.md b/Algorithms/0191.number-of-1-bits/README.md new file mode 100755 index 000000000..be86a68a7 --- /dev/null +++ b/Algorithms/0191.number-of-1-bits/README.md @@ -0,0 +1,11 @@ +# [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0191.number-of-1-bits/number-of-1-bits.go b/Algorithms/0191.number-of-1-bits/number-of-1-bits.go new file mode 100755 index 000000000..c37cfeb23 --- /dev/null +++ b/Algorithms/0191.number-of-1-bits/number-of-1-bits.go @@ -0,0 +1,2 @@ +package Problem0191 + 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 new file mode 100755 index 000000000..b807ab180 --- /dev/null +++ b/Algorithms/0191.number-of-1-bits/number-of-1-bits_test.go @@ -0,0 +1,43 @@ +package Problem0191 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0191(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0198.house-robber/README.md b/Algorithms/0198.house-robber/README.md new file mode 100755 index 000000000..bbdf136d9 --- /dev/null +++ b/Algorithms/0198.house-robber/README.md @@ -0,0 +1,11 @@ +# [198. House Robber](https://leetcode.com/problems/house-robber/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0198.house-robber/house-robber.go b/Algorithms/0198.house-robber/house-robber.go new file mode 100755 index 000000000..6ae537f76 --- /dev/null +++ b/Algorithms/0198.house-robber/house-robber.go @@ -0,0 +1,2 @@ +package Problem0198 + diff --git a/Algorithms/0198.house-robber/house-robber_test.go b/Algorithms/0198.house-robber/house-robber_test.go new file mode 100755 index 000000000..12c1c8cb2 --- /dev/null +++ b/Algorithms/0198.house-robber/house-robber_test.go @@ -0,0 +1,43 @@ +package Problem0198 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0198(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0199.binary-tree-right-side-view/README.md b/Algorithms/0199.binary-tree-right-side-view/README.md new file mode 100755 index 000000000..5c7c3e972 --- /dev/null +++ b/Algorithms/0199.binary-tree-right-side-view/README.md @@ -0,0 +1,11 @@ +# [199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view.go b/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view.go new file mode 100755 index 000000000..76000f45d --- /dev/null +++ b/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view.go @@ -0,0 +1,2 @@ +package Problem0199 + 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 new file mode 100755 index 000000000..6152af7df --- /dev/null +++ b/Algorithms/0199.binary-tree-right-side-view/binary-tree-right-side-view_test.go @@ -0,0 +1,43 @@ +package Problem0199 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0199(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0200.number-of-islands/README.md b/Algorithms/0200.number-of-islands/README.md new file mode 100755 index 000000000..2c9cac5d7 --- /dev/null +++ b/Algorithms/0200.number-of-islands/README.md @@ -0,0 +1,11 @@ +# [200. Number of Islands](https://leetcode.com/problems/number-of-islands/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0200.number-of-islands/number-of-islands.go b/Algorithms/0200.number-of-islands/number-of-islands.go new file mode 100755 index 000000000..8f363fff3 --- /dev/null +++ b/Algorithms/0200.number-of-islands/number-of-islands.go @@ -0,0 +1,2 @@ +package Problem0200 + diff --git a/Algorithms/0200.number-of-islands/number-of-islands_test.go b/Algorithms/0200.number-of-islands/number-of-islands_test.go new file mode 100755 index 000000000..7bc87281a --- /dev/null +++ b/Algorithms/0200.number-of-islands/number-of-islands_test.go @@ -0,0 +1,43 @@ +package Problem0200 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0200(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0201.bitwise-and-of-numbers-range/README.md b/Algorithms/0201.bitwise-and-of-numbers-range/README.md new file mode 100755 index 000000000..679af8e31 --- /dev/null +++ b/Algorithms/0201.bitwise-and-of-numbers-range/README.md @@ -0,0 +1,11 @@ +# [201. Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range.go b/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range.go new file mode 100755 index 000000000..f584220e4 --- /dev/null +++ b/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range.go @@ -0,0 +1,2 @@ +package Problem0201 + 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 new file mode 100755 index 000000000..90030a239 --- /dev/null +++ b/Algorithms/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range_test.go @@ -0,0 +1,43 @@ +package Problem0201 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0201(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0202.happy-number/README.md b/Algorithms/0202.happy-number/README.md new file mode 100755 index 000000000..cfd230e95 --- /dev/null +++ b/Algorithms/0202.happy-number/README.md @@ -0,0 +1,11 @@ +# [202. Happy Number](https://leetcode.com/problems/happy-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0202.happy-number/happy-number.go b/Algorithms/0202.happy-number/happy-number.go new file mode 100755 index 000000000..0d2bb492f --- /dev/null +++ b/Algorithms/0202.happy-number/happy-number.go @@ -0,0 +1,2 @@ +package Problem0202 + diff --git a/Algorithms/0202.happy-number/happy-number_test.go b/Algorithms/0202.happy-number/happy-number_test.go new file mode 100755 index 000000000..2f0abbe6b --- /dev/null +++ b/Algorithms/0202.happy-number/happy-number_test.go @@ -0,0 +1,43 @@ +package Problem0202 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0202(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0203.remove-linked-list-elements/README.md b/Algorithms/0203.remove-linked-list-elements/README.md new file mode 100755 index 000000000..6aba46e71 --- /dev/null +++ b/Algorithms/0203.remove-linked-list-elements/README.md @@ -0,0 +1,11 @@ +# [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements.go b/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements.go new file mode 100755 index 000000000..ccb39f620 --- /dev/null +++ b/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements.go @@ -0,0 +1,2 @@ +package Problem0203 + 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 new file mode 100755 index 000000000..40d9b38cb --- /dev/null +++ b/Algorithms/0203.remove-linked-list-elements/remove-linked-list-elements_test.go @@ -0,0 +1,43 @@ +package Problem0203 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0203(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0204.count-primes/README.md b/Algorithms/0204.count-primes/README.md new file mode 100755 index 000000000..85747faab --- /dev/null +++ b/Algorithms/0204.count-primes/README.md @@ -0,0 +1,11 @@ +# [204. Count Primes](https://leetcode.com/problems/count-primes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0204.count-primes/count-primes.go b/Algorithms/0204.count-primes/count-primes.go new file mode 100755 index 000000000..ad03e0ec0 --- /dev/null +++ b/Algorithms/0204.count-primes/count-primes.go @@ -0,0 +1,2 @@ +package Problem0204 + diff --git a/Algorithms/0204.count-primes/count-primes_test.go b/Algorithms/0204.count-primes/count-primes_test.go new file mode 100755 index 000000000..e4c317bb2 --- /dev/null +++ b/Algorithms/0204.count-primes/count-primes_test.go @@ -0,0 +1,43 @@ +package Problem0204 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0204(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0205.isomorphic-strings/README.md b/Algorithms/0205.isomorphic-strings/README.md new file mode 100755 index 000000000..1000c92d0 --- /dev/null +++ b/Algorithms/0205.isomorphic-strings/README.md @@ -0,0 +1,11 @@ +# [205. Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0205.isomorphic-strings/isomorphic-strings.go b/Algorithms/0205.isomorphic-strings/isomorphic-strings.go new file mode 100755 index 000000000..bfa5dd631 --- /dev/null +++ b/Algorithms/0205.isomorphic-strings/isomorphic-strings.go @@ -0,0 +1,2 @@ +package Problem0205 + diff --git a/Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go b/Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go new file mode 100755 index 000000000..ed8e3c0f5 --- /dev/null +++ b/Algorithms/0205.isomorphic-strings/isomorphic-strings_test.go @@ -0,0 +1,43 @@ +package Problem0205 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0205(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0206.reverse-linked-list/README.md b/Algorithms/0206.reverse-linked-list/README.md new file mode 100755 index 000000000..9558db832 --- /dev/null +++ b/Algorithms/0206.reverse-linked-list/README.md @@ -0,0 +1,11 @@ +# [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0206.reverse-linked-list/reverse-linked-list.go b/Algorithms/0206.reverse-linked-list/reverse-linked-list.go new file mode 100755 index 000000000..90ffe95d7 --- /dev/null +++ b/Algorithms/0206.reverse-linked-list/reverse-linked-list.go @@ -0,0 +1,2 @@ +package Problem0206 + diff --git a/Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go b/Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go new file mode 100755 index 000000000..344d15d18 --- /dev/null +++ b/Algorithms/0206.reverse-linked-list/reverse-linked-list_test.go @@ -0,0 +1,43 @@ +package Problem0206 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0206(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0207.course-schedule/README.md b/Algorithms/0207.course-schedule/README.md new file mode 100755 index 000000000..477a43366 --- /dev/null +++ b/Algorithms/0207.course-schedule/README.md @@ -0,0 +1,11 @@ +# [207. Course Schedule](https://leetcode.com/problems/course-schedule/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0207.course-schedule/course-schedule.go b/Algorithms/0207.course-schedule/course-schedule.go new file mode 100755 index 000000000..8f2a48bd2 --- /dev/null +++ b/Algorithms/0207.course-schedule/course-schedule.go @@ -0,0 +1,2 @@ +package Problem0207 + diff --git a/Algorithms/0207.course-schedule/course-schedule_test.go b/Algorithms/0207.course-schedule/course-schedule_test.go new file mode 100755 index 000000000..1d674467a --- /dev/null +++ b/Algorithms/0207.course-schedule/course-schedule_test.go @@ -0,0 +1,43 @@ +package Problem0207 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0207(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0208.implement-trie-prefix-tree/README.md b/Algorithms/0208.implement-trie-prefix-tree/README.md new file mode 100755 index 000000000..6fb52456e --- /dev/null +++ b/Algorithms/0208.implement-trie-prefix-tree/README.md @@ -0,0 +1,11 @@ +# [208. Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree.go b/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree.go new file mode 100755 index 000000000..9a46f3403 --- /dev/null +++ b/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree.go @@ -0,0 +1,2 @@ +package Problem0208 + 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 new file mode 100755 index 000000000..ba1afd36c --- /dev/null +++ b/Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree_test.go @@ -0,0 +1,43 @@ +package Problem0208 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0208(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0209.minimum-size-subarray-sum/README.md b/Algorithms/0209.minimum-size-subarray-sum/README.md new file mode 100755 index 000000000..85ed04db3 --- /dev/null +++ b/Algorithms/0209.minimum-size-subarray-sum/README.md @@ -0,0 +1,11 @@ +# [209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum.go b/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum.go new file mode 100755 index 000000000..b3f902206 --- /dev/null +++ b/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum.go @@ -0,0 +1,2 @@ +package Problem0209 + 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 new file mode 100755 index 000000000..16fa1068a --- /dev/null +++ b/Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum_test.go @@ -0,0 +1,43 @@ +package Problem0209 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0209(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0210.course-schedule-ii/README.md b/Algorithms/0210.course-schedule-ii/README.md new file mode 100755 index 000000000..1c24b49f1 --- /dev/null +++ b/Algorithms/0210.course-schedule-ii/README.md @@ -0,0 +1,11 @@ +# [210. Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0210.course-schedule-ii/course-schedule-ii.go b/Algorithms/0210.course-schedule-ii/course-schedule-ii.go new file mode 100755 index 000000000..75d695877 --- /dev/null +++ b/Algorithms/0210.course-schedule-ii/course-schedule-ii.go @@ -0,0 +1,2 @@ +package Problem0210 + diff --git a/Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go b/Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go new file mode 100755 index 000000000..7f72e7210 --- /dev/null +++ b/Algorithms/0210.course-schedule-ii/course-schedule-ii_test.go @@ -0,0 +1,43 @@ +package Problem0210 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0210(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0211.add-and-search-word-data-structure-design/README.md b/Algorithms/0211.add-and-search-word-data-structure-design/README.md new file mode 100755 index 000000000..8e88d8f1c --- /dev/null +++ b/Algorithms/0211.add-and-search-word-data-structure-design/README.md @@ -0,0 +1,11 @@ +# [211. Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design.go b/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design.go new file mode 100755 index 000000000..e1efd3586 --- /dev/null +++ b/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design.go @@ -0,0 +1,2 @@ +package Problem0211 + 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 new file mode 100755 index 000000000..8edcbbadc --- /dev/null +++ b/Algorithms/0211.add-and-search-word-data-structure-design/add-and-search-word-data-structure-design_test.go @@ -0,0 +1,43 @@ +package Problem0211 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0211(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0212.word-search-ii/README.md b/Algorithms/0212.word-search-ii/README.md new file mode 100755 index 000000000..e14060701 --- /dev/null +++ b/Algorithms/0212.word-search-ii/README.md @@ -0,0 +1,11 @@ +# [212. Word Search II](https://leetcode.com/problems/word-search-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0212.word-search-ii/word-search-ii.go b/Algorithms/0212.word-search-ii/word-search-ii.go new file mode 100755 index 000000000..a57d42ba7 --- /dev/null +++ b/Algorithms/0212.word-search-ii/word-search-ii.go @@ -0,0 +1,2 @@ +package Problem0212 + diff --git a/Algorithms/0212.word-search-ii/word-search-ii_test.go b/Algorithms/0212.word-search-ii/word-search-ii_test.go new file mode 100755 index 000000000..634d52229 --- /dev/null +++ b/Algorithms/0212.word-search-ii/word-search-ii_test.go @@ -0,0 +1,43 @@ +package Problem0212 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0212(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0213.house-robber-ii/README.md b/Algorithms/0213.house-robber-ii/README.md new file mode 100755 index 000000000..de9e6577a --- /dev/null +++ b/Algorithms/0213.house-robber-ii/README.md @@ -0,0 +1,11 @@ +# [213. House Robber II](https://leetcode.com/problems/house-robber-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0213.house-robber-ii/house-robber-ii.go b/Algorithms/0213.house-robber-ii/house-robber-ii.go new file mode 100755 index 000000000..226831e8a --- /dev/null +++ b/Algorithms/0213.house-robber-ii/house-robber-ii.go @@ -0,0 +1,2 @@ +package Problem0213 + diff --git a/Algorithms/0213.house-robber-ii/house-robber-ii_test.go b/Algorithms/0213.house-robber-ii/house-robber-ii_test.go new file mode 100755 index 000000000..f0f225f40 --- /dev/null +++ b/Algorithms/0213.house-robber-ii/house-robber-ii_test.go @@ -0,0 +1,43 @@ +package Problem0213 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0213(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0214.shortest-palindrome/README.md b/Algorithms/0214.shortest-palindrome/README.md new file mode 100755 index 000000000..41539139b --- /dev/null +++ b/Algorithms/0214.shortest-palindrome/README.md @@ -0,0 +1,11 @@ +# [214. Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0214.shortest-palindrome/shortest-palindrome.go b/Algorithms/0214.shortest-palindrome/shortest-palindrome.go new file mode 100755 index 000000000..5404c2d68 --- /dev/null +++ b/Algorithms/0214.shortest-palindrome/shortest-palindrome.go @@ -0,0 +1,2 @@ +package Problem0214 + diff --git a/Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go b/Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go new file mode 100755 index 000000000..e42e61b56 --- /dev/null +++ b/Algorithms/0214.shortest-palindrome/shortest-palindrome_test.go @@ -0,0 +1,43 @@ +package Problem0214 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0214(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0215.kth-largest-element-in-an-array/README.md b/Algorithms/0215.kth-largest-element-in-an-array/README.md new file mode 100755 index 000000000..3e68f7a9d --- /dev/null +++ b/Algorithms/0215.kth-largest-element-in-an-array/README.md @@ -0,0 +1,11 @@ +# [215. Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array.go b/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array.go new file mode 100755 index 000000000..2c1f0ee22 --- /dev/null +++ b/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array.go @@ -0,0 +1,2 @@ +package Problem0215 + 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 new file mode 100755 index 000000000..9dc7b40b9 --- /dev/null +++ b/Algorithms/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array_test.go @@ -0,0 +1,43 @@ +package Problem0215 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0215(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0216.combination-sum-iii/README.md b/Algorithms/0216.combination-sum-iii/README.md new file mode 100755 index 000000000..9b9f821fd --- /dev/null +++ b/Algorithms/0216.combination-sum-iii/README.md @@ -0,0 +1,11 @@ +# [216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0216.combination-sum-iii/combination-sum-iii.go b/Algorithms/0216.combination-sum-iii/combination-sum-iii.go new file mode 100755 index 000000000..2db6fffe9 --- /dev/null +++ b/Algorithms/0216.combination-sum-iii/combination-sum-iii.go @@ -0,0 +1,2 @@ +package Problem0216 + diff --git a/Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go b/Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go new file mode 100755 index 000000000..5e76bbafe --- /dev/null +++ b/Algorithms/0216.combination-sum-iii/combination-sum-iii_test.go @@ -0,0 +1,43 @@ +package Problem0216 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0216(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0217.contains-duplicate/README.md b/Algorithms/0217.contains-duplicate/README.md new file mode 100755 index 000000000..eb6f59a1b --- /dev/null +++ b/Algorithms/0217.contains-duplicate/README.md @@ -0,0 +1,11 @@ +# [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0217.contains-duplicate/contains-duplicate.go b/Algorithms/0217.contains-duplicate/contains-duplicate.go new file mode 100755 index 000000000..1a1818a79 --- /dev/null +++ b/Algorithms/0217.contains-duplicate/contains-duplicate.go @@ -0,0 +1,2 @@ +package Problem0217 + diff --git a/Algorithms/0217.contains-duplicate/contains-duplicate_test.go b/Algorithms/0217.contains-duplicate/contains-duplicate_test.go new file mode 100755 index 000000000..f5b511456 --- /dev/null +++ b/Algorithms/0217.contains-duplicate/contains-duplicate_test.go @@ -0,0 +1,43 @@ +package Problem0217 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0217(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0218.the-skyline-problem/README.md b/Algorithms/0218.the-skyline-problem/README.md new file mode 100755 index 000000000..70c5525d9 --- /dev/null +++ b/Algorithms/0218.the-skyline-problem/README.md @@ -0,0 +1,11 @@ +# [218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0218.the-skyline-problem/the-skyline-problem.go b/Algorithms/0218.the-skyline-problem/the-skyline-problem.go new file mode 100755 index 000000000..2deef9a78 --- /dev/null +++ b/Algorithms/0218.the-skyline-problem/the-skyline-problem.go @@ -0,0 +1,2 @@ +package Problem0218 + diff --git a/Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go b/Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go new file mode 100755 index 000000000..95fc2172c --- /dev/null +++ b/Algorithms/0218.the-skyline-problem/the-skyline-problem_test.go @@ -0,0 +1,43 @@ +package Problem0218 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0218(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0219.contains-duplicate-ii/README.md b/Algorithms/0219.contains-duplicate-ii/README.md new file mode 100755 index 000000000..2c90bd9e2 --- /dev/null +++ b/Algorithms/0219.contains-duplicate-ii/README.md @@ -0,0 +1,11 @@ +# [219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii.go b/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii.go new file mode 100755 index 000000000..c8c471464 --- /dev/null +++ b/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii.go @@ -0,0 +1,2 @@ +package Problem0219 + diff --git a/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go b/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go new file mode 100755 index 000000000..3e147ceae --- /dev/null +++ b/Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go @@ -0,0 +1,43 @@ +package Problem0219 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0219(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0220.contains-duplicate-iii/README.md b/Algorithms/0220.contains-duplicate-iii/README.md new file mode 100755 index 000000000..8c6175766 --- /dev/null +++ b/Algorithms/0220.contains-duplicate-iii/README.md @@ -0,0 +1,11 @@ +# [220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii.go b/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii.go new file mode 100755 index 000000000..6cb804707 --- /dev/null +++ b/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii.go @@ -0,0 +1,2 @@ +package Problem0220 + diff --git a/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go b/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go new file mode 100755 index 000000000..66fd30d66 --- /dev/null +++ b/Algorithms/0220.contains-duplicate-iii/contains-duplicate-iii_test.go @@ -0,0 +1,43 @@ +package Problem0220 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0220(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0221.maximal-square/README.md b/Algorithms/0221.maximal-square/README.md new file mode 100755 index 000000000..f3393750c --- /dev/null +++ b/Algorithms/0221.maximal-square/README.md @@ -0,0 +1,11 @@ +# [221. Maximal Square](https://leetcode.com/problems/maximal-square/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0221.maximal-square/maximal-square.go b/Algorithms/0221.maximal-square/maximal-square.go new file mode 100755 index 000000000..f035faf85 --- /dev/null +++ b/Algorithms/0221.maximal-square/maximal-square.go @@ -0,0 +1,2 @@ +package Problem0221 + diff --git a/Algorithms/0221.maximal-square/maximal-square_test.go b/Algorithms/0221.maximal-square/maximal-square_test.go new file mode 100755 index 000000000..7f93797c5 --- /dev/null +++ b/Algorithms/0221.maximal-square/maximal-square_test.go @@ -0,0 +1,43 @@ +package Problem0221 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0221(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0222.count-complete-tree-nodes/README.md b/Algorithms/0222.count-complete-tree-nodes/README.md new file mode 100755 index 000000000..3f43b870b --- /dev/null +++ b/Algorithms/0222.count-complete-tree-nodes/README.md @@ -0,0 +1,11 @@ +# [222. Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes.go b/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes.go new file mode 100755 index 000000000..f35f265db --- /dev/null +++ b/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes.go @@ -0,0 +1,2 @@ +package Problem0222 + 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 new file mode 100755 index 000000000..da567e3c4 --- /dev/null +++ b/Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes_test.go @@ -0,0 +1,43 @@ +package Problem0222 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0222(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0223.rectangle-area/README.md b/Algorithms/0223.rectangle-area/README.md new file mode 100755 index 000000000..900d4b3f2 --- /dev/null +++ b/Algorithms/0223.rectangle-area/README.md @@ -0,0 +1,11 @@ +# [223. Rectangle Area](https://leetcode.com/problems/rectangle-area/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0223.rectangle-area/rectangle-area.go b/Algorithms/0223.rectangle-area/rectangle-area.go new file mode 100755 index 000000000..ddc76bfc4 --- /dev/null +++ b/Algorithms/0223.rectangle-area/rectangle-area.go @@ -0,0 +1,2 @@ +package Problem0223 + diff --git a/Algorithms/0223.rectangle-area/rectangle-area_test.go b/Algorithms/0223.rectangle-area/rectangle-area_test.go new file mode 100755 index 000000000..19469cd4f --- /dev/null +++ b/Algorithms/0223.rectangle-area/rectangle-area_test.go @@ -0,0 +1,43 @@ +package Problem0223 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0223(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0224.basic-calculator/README.md b/Algorithms/0224.basic-calculator/README.md new file mode 100755 index 000000000..60b2365ac --- /dev/null +++ b/Algorithms/0224.basic-calculator/README.md @@ -0,0 +1,11 @@ +# [224. Basic Calculator](https://leetcode.com/problems/basic-calculator/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0224.basic-calculator/basic-calculator.go b/Algorithms/0224.basic-calculator/basic-calculator.go new file mode 100755 index 000000000..e7adb3daf --- /dev/null +++ b/Algorithms/0224.basic-calculator/basic-calculator.go @@ -0,0 +1,2 @@ +package Problem0224 + diff --git a/Algorithms/0224.basic-calculator/basic-calculator_test.go b/Algorithms/0224.basic-calculator/basic-calculator_test.go new file mode 100755 index 000000000..fb46810e5 --- /dev/null +++ b/Algorithms/0224.basic-calculator/basic-calculator_test.go @@ -0,0 +1,43 @@ +package Problem0224 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0224(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0225.implement-stack-using-queues/README.md b/Algorithms/0225.implement-stack-using-queues/README.md new file mode 100755 index 000000000..cbafceb78 --- /dev/null +++ b/Algorithms/0225.implement-stack-using-queues/README.md @@ -0,0 +1,11 @@ +# [225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues.go b/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues.go new file mode 100755 index 000000000..4223ea31f --- /dev/null +++ b/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues.go @@ -0,0 +1,2 @@ +package Problem0225 + 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 new file mode 100755 index 000000000..5a7630f9a --- /dev/null +++ b/Algorithms/0225.implement-stack-using-queues/implement-stack-using-queues_test.go @@ -0,0 +1,43 @@ +package Problem0225 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0225(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0226.invert-binary-tree/README.md b/Algorithms/0226.invert-binary-tree/README.md new file mode 100755 index 000000000..6cbecc4b7 --- /dev/null +++ b/Algorithms/0226.invert-binary-tree/README.md @@ -0,0 +1,11 @@ +# [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0226.invert-binary-tree/invert-binary-tree.go b/Algorithms/0226.invert-binary-tree/invert-binary-tree.go new file mode 100755 index 000000000..343e23d14 --- /dev/null +++ b/Algorithms/0226.invert-binary-tree/invert-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0226 + diff --git a/Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go b/Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go new file mode 100755 index 000000000..70c2955e3 --- /dev/null +++ b/Algorithms/0226.invert-binary-tree/invert-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0226 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0226(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0227.basic-calculator-ii/README.md b/Algorithms/0227.basic-calculator-ii/README.md new file mode 100755 index 000000000..d2b73f7a2 --- /dev/null +++ b/Algorithms/0227.basic-calculator-ii/README.md @@ -0,0 +1,11 @@ +# [227. Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0227.basic-calculator-ii/basic-calculator-ii.go b/Algorithms/0227.basic-calculator-ii/basic-calculator-ii.go new file mode 100755 index 000000000..3c9e1cc86 --- /dev/null +++ b/Algorithms/0227.basic-calculator-ii/basic-calculator-ii.go @@ -0,0 +1,2 @@ +package Problem0227 + diff --git a/Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go b/Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go new file mode 100755 index 000000000..742de928d --- /dev/null +++ b/Algorithms/0227.basic-calculator-ii/basic-calculator-ii_test.go @@ -0,0 +1,43 @@ +package Problem0227 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0227(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0228.summary-ranges/README.md b/Algorithms/0228.summary-ranges/README.md new file mode 100755 index 000000000..8b322ee30 --- /dev/null +++ b/Algorithms/0228.summary-ranges/README.md @@ -0,0 +1,11 @@ +# [228. Summary Ranges](https://leetcode.com/problems/summary-ranges/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0228.summary-ranges/summary-ranges.go b/Algorithms/0228.summary-ranges/summary-ranges.go new file mode 100755 index 000000000..9016667fd --- /dev/null +++ b/Algorithms/0228.summary-ranges/summary-ranges.go @@ -0,0 +1,2 @@ +package Problem0228 + diff --git a/Algorithms/0228.summary-ranges/summary-ranges_test.go b/Algorithms/0228.summary-ranges/summary-ranges_test.go new file mode 100755 index 000000000..81a8b0b8c --- /dev/null +++ b/Algorithms/0228.summary-ranges/summary-ranges_test.go @@ -0,0 +1,43 @@ +package Problem0228 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0228(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0229.majority-element-ii/README.md b/Algorithms/0229.majority-element-ii/README.md new file mode 100755 index 000000000..5db33c52c --- /dev/null +++ b/Algorithms/0229.majority-element-ii/README.md @@ -0,0 +1,11 @@ +# [229. Majority Element II](https://leetcode.com/problems/majority-element-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0229.majority-element-ii/majority-element-ii.go b/Algorithms/0229.majority-element-ii/majority-element-ii.go new file mode 100755 index 000000000..f77b10d55 --- /dev/null +++ b/Algorithms/0229.majority-element-ii/majority-element-ii.go @@ -0,0 +1,2 @@ +package Problem0229 + diff --git a/Algorithms/0229.majority-element-ii/majority-element-ii_test.go b/Algorithms/0229.majority-element-ii/majority-element-ii_test.go new file mode 100755 index 000000000..052c5e30c --- /dev/null +++ b/Algorithms/0229.majority-element-ii/majority-element-ii_test.go @@ -0,0 +1,43 @@ +package Problem0229 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0229(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0230.kth-smallest-element-in-a-bst/README.md b/Algorithms/0230.kth-smallest-element-in-a-bst/README.md new file mode 100755 index 000000000..686f3ecb4 --- /dev/null +++ b/Algorithms/0230.kth-smallest-element-in-a-bst/README.md @@ -0,0 +1,11 @@ +# [230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.go b/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.go new file mode 100755 index 000000000..c751ed5eb --- /dev/null +++ b/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.go @@ -0,0 +1,2 @@ +package Problem0230 + 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 new file mode 100755 index 000000000..b788786a5 --- /dev/null +++ b/Algorithms/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst_test.go @@ -0,0 +1,43 @@ +package Problem0230 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0230(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0231.power-of-two/README.md b/Algorithms/0231.power-of-two/README.md new file mode 100755 index 000000000..782a97ca9 --- /dev/null +++ b/Algorithms/0231.power-of-two/README.md @@ -0,0 +1,11 @@ +# [231. Power of Two](https://leetcode.com/problems/power-of-two/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0231.power-of-two/power-of-two.go b/Algorithms/0231.power-of-two/power-of-two.go new file mode 100755 index 000000000..3aa341cbe --- /dev/null +++ b/Algorithms/0231.power-of-two/power-of-two.go @@ -0,0 +1,2 @@ +package Problem0231 + diff --git a/Algorithms/0231.power-of-two/power-of-two_test.go b/Algorithms/0231.power-of-two/power-of-two_test.go new file mode 100755 index 000000000..5cc7c07e5 --- /dev/null +++ b/Algorithms/0231.power-of-two/power-of-two_test.go @@ -0,0 +1,43 @@ +package Problem0231 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0231(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0232.implement-queue-using-stacks/README.md b/Algorithms/0232.implement-queue-using-stacks/README.md new file mode 100755 index 000000000..dcd7ae98f --- /dev/null +++ b/Algorithms/0232.implement-queue-using-stacks/README.md @@ -0,0 +1,11 @@ +# [232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks.go b/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks.go new file mode 100755 index 000000000..83a8636db --- /dev/null +++ b/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks.go @@ -0,0 +1,2 @@ +package Problem0232 + 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 new file mode 100755 index 000000000..c293c5d75 --- /dev/null +++ b/Algorithms/0232.implement-queue-using-stacks/implement-queue-using-stacks_test.go @@ -0,0 +1,43 @@ +package Problem0232 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0232(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0233.number-of-digit-one/README.md b/Algorithms/0233.number-of-digit-one/README.md new file mode 100755 index 000000000..08639e11e --- /dev/null +++ b/Algorithms/0233.number-of-digit-one/README.md @@ -0,0 +1,11 @@ +# [233. Number of Digit One](https://leetcode.com/problems/number-of-digit-one/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0233.number-of-digit-one/number-of-digit-one.go b/Algorithms/0233.number-of-digit-one/number-of-digit-one.go new file mode 100755 index 000000000..20427e4cf --- /dev/null +++ b/Algorithms/0233.number-of-digit-one/number-of-digit-one.go @@ -0,0 +1,2 @@ +package Problem0233 + 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 new file mode 100755 index 000000000..b6408dc14 --- /dev/null +++ b/Algorithms/0233.number-of-digit-one/number-of-digit-one_test.go @@ -0,0 +1,43 @@ +package Problem0233 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0233(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0234.palindrome-linked-list/README.md b/Algorithms/0234.palindrome-linked-list/README.md new file mode 100755 index 000000000..b6703b5e7 --- /dev/null +++ b/Algorithms/0234.palindrome-linked-list/README.md @@ -0,0 +1,11 @@ +# [234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0234.palindrome-linked-list/palindrome-linked-list.go b/Algorithms/0234.palindrome-linked-list/palindrome-linked-list.go new file mode 100755 index 000000000..738472c7a --- /dev/null +++ b/Algorithms/0234.palindrome-linked-list/palindrome-linked-list.go @@ -0,0 +1,2 @@ +package Problem0234 + diff --git a/Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go b/Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go new file mode 100755 index 000000000..2be8bbecc --- /dev/null +++ b/Algorithms/0234.palindrome-linked-list/palindrome-linked-list_test.go @@ -0,0 +1,43 @@ +package Problem0234 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0234(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/README.md b/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/README.md new file mode 100755 index 000000000..f161a5b0e --- /dev/null +++ b/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/README.md @@ -0,0 +1,11 @@ +# [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.go b/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.go new file mode 100755 index 000000000..c001db4b4 --- /dev/null +++ b/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.go @@ -0,0 +1,2 @@ +package Problem0235 + 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 new file mode 100755 index 000000000..f8e547c4c --- /dev/null +++ b/Algorithms/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree_test.go @@ -0,0 +1,43 @@ +package Problem0235 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0235(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/README.md b/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/README.md new file mode 100755 index 000000000..58abb69f9 --- /dev/null +++ b/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/README.md @@ -0,0 +1,11 @@ +# [236. Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree.go b/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree.go new file mode 100755 index 000000000..a6231c6ae --- /dev/null +++ b/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0236 + 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 new file mode 100755 index 000000000..938629866 --- /dev/null +++ b/Algorithms/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0236 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0236(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0237.delete-node-in-a-linked-list/README.md b/Algorithms/0237.delete-node-in-a-linked-list/README.md new file mode 100755 index 000000000..708542d7b --- /dev/null +++ b/Algorithms/0237.delete-node-in-a-linked-list/README.md @@ -0,0 +1,11 @@ +# [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list.go b/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list.go new file mode 100755 index 000000000..e616cb37d --- /dev/null +++ b/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list.go @@ -0,0 +1,2 @@ +package Problem0237 + 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 new file mode 100755 index 000000000..16cd5b64e --- /dev/null +++ b/Algorithms/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list_test.go @@ -0,0 +1,43 @@ +package Problem0237 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0237(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0238.product-of-array-except-self/README.md b/Algorithms/0238.product-of-array-except-self/README.md new file mode 100755 index 000000000..ca8b95bf3 --- /dev/null +++ b/Algorithms/0238.product-of-array-except-self/README.md @@ -0,0 +1,11 @@ +# [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0238.product-of-array-except-self/product-of-array-except-self.go b/Algorithms/0238.product-of-array-except-self/product-of-array-except-self.go new file mode 100755 index 000000000..98f080a0d --- /dev/null +++ b/Algorithms/0238.product-of-array-except-self/product-of-array-except-self.go @@ -0,0 +1,2 @@ +package Problem0238 + 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 new file mode 100755 index 000000000..3da08c4c9 --- /dev/null +++ b/Algorithms/0238.product-of-array-except-self/product-of-array-except-self_test.go @@ -0,0 +1,43 @@ +package Problem0238 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0238(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0239.sliding-window-maximum/README.md b/Algorithms/0239.sliding-window-maximum/README.md new file mode 100755 index 000000000..09e2b0a50 --- /dev/null +++ b/Algorithms/0239.sliding-window-maximum/README.md @@ -0,0 +1,11 @@ +# [239. Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0239.sliding-window-maximum/sliding-window-maximum.go b/Algorithms/0239.sliding-window-maximum/sliding-window-maximum.go new file mode 100755 index 000000000..cbf5e9dbb --- /dev/null +++ b/Algorithms/0239.sliding-window-maximum/sliding-window-maximum.go @@ -0,0 +1,2 @@ +package Problem0239 + diff --git a/Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go b/Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go new file mode 100755 index 000000000..7b5a57356 --- /dev/null +++ b/Algorithms/0239.sliding-window-maximum/sliding-window-maximum_test.go @@ -0,0 +1,43 @@ +package Problem0239 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0239(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0240.search-a-2d-matrix-ii/README.md b/Algorithms/0240.search-a-2d-matrix-ii/README.md new file mode 100755 index 000000000..bdee88eee --- /dev/null +++ b/Algorithms/0240.search-a-2d-matrix-ii/README.md @@ -0,0 +1,11 @@ +# [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii.go b/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii.go new file mode 100755 index 000000000..01932f2d7 --- /dev/null +++ b/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii.go @@ -0,0 +1,2 @@ +package Problem0240 + 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 new file mode 100755 index 000000000..8bea57ee0 --- /dev/null +++ b/Algorithms/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii_test.go @@ -0,0 +1,43 @@ +package Problem0240 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0240(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0241.different-ways-to-add-parentheses/README.md b/Algorithms/0241.different-ways-to-add-parentheses/README.md new file mode 100755 index 000000000..63d344b0e --- /dev/null +++ b/Algorithms/0241.different-ways-to-add-parentheses/README.md @@ -0,0 +1,11 @@ +# [241. Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses.go b/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses.go new file mode 100755 index 000000000..aca0a92d5 --- /dev/null +++ b/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses.go @@ -0,0 +1,2 @@ +package Problem0241 + 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 new file mode 100755 index 000000000..bfd879c35 --- /dev/null +++ b/Algorithms/0241.different-ways-to-add-parentheses/different-ways-to-add-parentheses_test.go @@ -0,0 +1,43 @@ +package Problem0241 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0241(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0242.valid-anagram/README.md b/Algorithms/0242.valid-anagram/README.md new file mode 100755 index 000000000..1dd1e2d35 --- /dev/null +++ b/Algorithms/0242.valid-anagram/README.md @@ -0,0 +1,11 @@ +# [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0242.valid-anagram/valid-anagram.go b/Algorithms/0242.valid-anagram/valid-anagram.go new file mode 100755 index 000000000..8f99db3d9 --- /dev/null +++ b/Algorithms/0242.valid-anagram/valid-anagram.go @@ -0,0 +1,2 @@ +package Problem0242 + diff --git a/Algorithms/0242.valid-anagram/valid-anagram_test.go b/Algorithms/0242.valid-anagram/valid-anagram_test.go new file mode 100755 index 000000000..14e3d06a7 --- /dev/null +++ b/Algorithms/0242.valid-anagram/valid-anagram_test.go @@ -0,0 +1,43 @@ +package Problem0242 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0242(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0243.shortest-word-distance/README.md b/Algorithms/0243.shortest-word-distance/README.md new file mode 100755 index 000000000..827d2c96e --- /dev/null +++ b/Algorithms/0243.shortest-word-distance/README.md @@ -0,0 +1,11 @@ +# [243. Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0243.shortest-word-distance/shortest-word-distance.go b/Algorithms/0243.shortest-word-distance/shortest-word-distance.go new file mode 100755 index 000000000..2508d1315 --- /dev/null +++ b/Algorithms/0243.shortest-word-distance/shortest-word-distance.go @@ -0,0 +1,2 @@ +package Problem0243 + diff --git a/Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go b/Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go new file mode 100755 index 000000000..905a8a5e6 --- /dev/null +++ b/Algorithms/0243.shortest-word-distance/shortest-word-distance_test.go @@ -0,0 +1,43 @@ +package Problem0243 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0243(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0244.shortest-word-distance-ii/README.md b/Algorithms/0244.shortest-word-distance-ii/README.md new file mode 100755 index 000000000..8fe176be7 --- /dev/null +++ b/Algorithms/0244.shortest-word-distance-ii/README.md @@ -0,0 +1,11 @@ +# [244. Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii.go b/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii.go new file mode 100755 index 000000000..98d324f62 --- /dev/null +++ b/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii.go @@ -0,0 +1,2 @@ +package Problem0244 + 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 new file mode 100755 index 000000000..c9f21494a --- /dev/null +++ b/Algorithms/0244.shortest-word-distance-ii/shortest-word-distance-ii_test.go @@ -0,0 +1,43 @@ +package Problem0244 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0244(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0245.shortest-word-distance-iii/README.md b/Algorithms/0245.shortest-word-distance-iii/README.md new file mode 100755 index 000000000..572820ebc --- /dev/null +++ b/Algorithms/0245.shortest-word-distance-iii/README.md @@ -0,0 +1,11 @@ +# [245. Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii.go b/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii.go new file mode 100755 index 000000000..cff5de355 --- /dev/null +++ b/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii.go @@ -0,0 +1,2 @@ +package Problem0245 + 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 new file mode 100755 index 000000000..874383fa9 --- /dev/null +++ b/Algorithms/0245.shortest-word-distance-iii/shortest-word-distance-iii_test.go @@ -0,0 +1,43 @@ +package Problem0245 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0245(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0246.strobogrammatic-number/README.md b/Algorithms/0246.strobogrammatic-number/README.md new file mode 100755 index 000000000..edf80961f --- /dev/null +++ b/Algorithms/0246.strobogrammatic-number/README.md @@ -0,0 +1,11 @@ +# [246. Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0246.strobogrammatic-number/strobogrammatic-number.go b/Algorithms/0246.strobogrammatic-number/strobogrammatic-number.go new file mode 100755 index 000000000..fb1ec15d1 --- /dev/null +++ b/Algorithms/0246.strobogrammatic-number/strobogrammatic-number.go @@ -0,0 +1,2 @@ +package Problem0246 + diff --git a/Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go b/Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go new file mode 100755 index 000000000..5fb6c392f --- /dev/null +++ b/Algorithms/0246.strobogrammatic-number/strobogrammatic-number_test.go @@ -0,0 +1,43 @@ +package Problem0246 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0246(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0247.strobogrammatic-number-ii/README.md b/Algorithms/0247.strobogrammatic-number-ii/README.md new file mode 100755 index 000000000..d7b12c40f --- /dev/null +++ b/Algorithms/0247.strobogrammatic-number-ii/README.md @@ -0,0 +1,11 @@ +# [247. Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii.go b/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii.go new file mode 100755 index 000000000..8ca0cf538 --- /dev/null +++ b/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii.go @@ -0,0 +1,2 @@ +package Problem0247 + diff --git a/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go b/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go new file mode 100755 index 000000000..95c9dae8e --- /dev/null +++ b/Algorithms/0247.strobogrammatic-number-ii/strobogrammatic-number-ii_test.go @@ -0,0 +1,43 @@ +package Problem0247 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0247(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0248.strobogrammatic-number-iii/README.md b/Algorithms/0248.strobogrammatic-number-iii/README.md new file mode 100755 index 000000000..53b47fd0f --- /dev/null +++ b/Algorithms/0248.strobogrammatic-number-iii/README.md @@ -0,0 +1,11 @@ +# [248. Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii.go b/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii.go new file mode 100755 index 000000000..4a6644c79 --- /dev/null +++ b/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii.go @@ -0,0 +1,2 @@ +package Problem0248 + diff --git a/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go b/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go new file mode 100755 index 000000000..6a3c1d6dd --- /dev/null +++ b/Algorithms/0248.strobogrammatic-number-iii/strobogrammatic-number-iii_test.go @@ -0,0 +1,43 @@ +package Problem0248 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0248(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0249.group-shifted-strings/README.md b/Algorithms/0249.group-shifted-strings/README.md new file mode 100755 index 000000000..c3066d84b --- /dev/null +++ b/Algorithms/0249.group-shifted-strings/README.md @@ -0,0 +1,11 @@ +# [249. Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0249.group-shifted-strings/group-shifted-strings.go b/Algorithms/0249.group-shifted-strings/group-shifted-strings.go new file mode 100755 index 000000000..7b4d4a1a1 --- /dev/null +++ b/Algorithms/0249.group-shifted-strings/group-shifted-strings.go @@ -0,0 +1,2 @@ +package Problem0249 + diff --git a/Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go b/Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go new file mode 100755 index 000000000..33c6fafa8 --- /dev/null +++ b/Algorithms/0249.group-shifted-strings/group-shifted-strings_test.go @@ -0,0 +1,43 @@ +package Problem0249 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0249(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0250.count-univalue-subtrees/README.md b/Algorithms/0250.count-univalue-subtrees/README.md new file mode 100755 index 000000000..07806e5c6 --- /dev/null +++ b/Algorithms/0250.count-univalue-subtrees/README.md @@ -0,0 +1,11 @@ +# [250. Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees.go b/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees.go new file mode 100755 index 000000000..972fa42b4 --- /dev/null +++ b/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees.go @@ -0,0 +1,2 @@ +package Problem0250 + diff --git a/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go b/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go new file mode 100755 index 000000000..f3bec3d73 --- /dev/null +++ b/Algorithms/0250.count-univalue-subtrees/count-univalue-subtrees_test.go @@ -0,0 +1,43 @@ +package Problem0250 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0250(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0251.flatten-2d-vector/README.md b/Algorithms/0251.flatten-2d-vector/README.md new file mode 100755 index 000000000..ac37d2ca7 --- /dev/null +++ b/Algorithms/0251.flatten-2d-vector/README.md @@ -0,0 +1,11 @@ +# [251. Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0251.flatten-2d-vector/flatten-2d-vector.go b/Algorithms/0251.flatten-2d-vector/flatten-2d-vector.go new file mode 100755 index 000000000..d8592a87b --- /dev/null +++ b/Algorithms/0251.flatten-2d-vector/flatten-2d-vector.go @@ -0,0 +1,2 @@ +package Problem0251 + diff --git a/Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go b/Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go new file mode 100755 index 000000000..f66f55f7b --- /dev/null +++ b/Algorithms/0251.flatten-2d-vector/flatten-2d-vector_test.go @@ -0,0 +1,43 @@ +package Problem0251 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0251(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0252.meeting-rooms/README.md b/Algorithms/0252.meeting-rooms/README.md new file mode 100755 index 000000000..e4c0221d5 --- /dev/null +++ b/Algorithms/0252.meeting-rooms/README.md @@ -0,0 +1,11 @@ +# [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0252.meeting-rooms/meeting-rooms.go b/Algorithms/0252.meeting-rooms/meeting-rooms.go new file mode 100755 index 000000000..401b3e4de --- /dev/null +++ b/Algorithms/0252.meeting-rooms/meeting-rooms.go @@ -0,0 +1,2 @@ +package Problem0252 + diff --git a/Algorithms/0252.meeting-rooms/meeting-rooms_test.go b/Algorithms/0252.meeting-rooms/meeting-rooms_test.go new file mode 100755 index 000000000..5cf068939 --- /dev/null +++ b/Algorithms/0252.meeting-rooms/meeting-rooms_test.go @@ -0,0 +1,43 @@ +package Problem0252 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0252(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0253.meeting-rooms-ii/README.md b/Algorithms/0253.meeting-rooms-ii/README.md new file mode 100755 index 000000000..b05b071f0 --- /dev/null +++ b/Algorithms/0253.meeting-rooms-ii/README.md @@ -0,0 +1,11 @@ +# [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii.go b/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii.go new file mode 100755 index 000000000..ff84f6560 --- /dev/null +++ b/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii.go @@ -0,0 +1,2 @@ +package Problem0253 + diff --git a/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go b/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go new file mode 100755 index 000000000..25576c5f8 --- /dev/null +++ b/Algorithms/0253.meeting-rooms-ii/meeting-rooms-ii_test.go @@ -0,0 +1,43 @@ +package Problem0253 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0253(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0254.factor-combinations/README.md b/Algorithms/0254.factor-combinations/README.md new file mode 100755 index 000000000..edc582038 --- /dev/null +++ b/Algorithms/0254.factor-combinations/README.md @@ -0,0 +1,11 @@ +# [254. Factor Combinations](https://leetcode.com/problems/factor-combinations/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0254.factor-combinations/factor-combinations.go b/Algorithms/0254.factor-combinations/factor-combinations.go new file mode 100755 index 000000000..e08b65203 --- /dev/null +++ b/Algorithms/0254.factor-combinations/factor-combinations.go @@ -0,0 +1,2 @@ +package Problem0254 + diff --git a/Algorithms/0254.factor-combinations/factor-combinations_test.go b/Algorithms/0254.factor-combinations/factor-combinations_test.go new file mode 100755 index 000000000..cdee0e9ff --- /dev/null +++ b/Algorithms/0254.factor-combinations/factor-combinations_test.go @@ -0,0 +1,43 @@ +package Problem0254 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0254(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/README.md b/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/README.md new file mode 100755 index 000000000..a798775fc --- /dev/null +++ b/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/README.md @@ -0,0 +1,11 @@ +# [255. Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree.go b/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree.go new file mode 100755 index 000000000..a8fd144be --- /dev/null +++ b/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree.go @@ -0,0 +1,2 @@ +package Problem0255 + 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 new file mode 100755 index 000000000..1dbe03679 --- /dev/null +++ b/Algorithms/0255.verify-preorder-sequence-in-binary-search-tree/verify-preorder-sequence-in-binary-search-tree_test.go @@ -0,0 +1,43 @@ +package Problem0255 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0255(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0256.paint-house/README.md b/Algorithms/0256.paint-house/README.md new file mode 100755 index 000000000..7f7ba2b25 --- /dev/null +++ b/Algorithms/0256.paint-house/README.md @@ -0,0 +1,11 @@ +# [256. Paint House](https://leetcode.com/problems/paint-house/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0256.paint-house/paint-house.go b/Algorithms/0256.paint-house/paint-house.go new file mode 100755 index 000000000..4d1d96820 --- /dev/null +++ b/Algorithms/0256.paint-house/paint-house.go @@ -0,0 +1,2 @@ +package Problem0256 + diff --git a/Algorithms/0256.paint-house/paint-house_test.go b/Algorithms/0256.paint-house/paint-house_test.go new file mode 100755 index 000000000..06858ec20 --- /dev/null +++ b/Algorithms/0256.paint-house/paint-house_test.go @@ -0,0 +1,43 @@ +package Problem0256 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0256(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0257.binary-tree-paths/README.md b/Algorithms/0257.binary-tree-paths/README.md new file mode 100755 index 000000000..688e55fea --- /dev/null +++ b/Algorithms/0257.binary-tree-paths/README.md @@ -0,0 +1,11 @@ +# [257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0257.binary-tree-paths/binary-tree-paths.go b/Algorithms/0257.binary-tree-paths/binary-tree-paths.go new file mode 100755 index 000000000..ed46555ae --- /dev/null +++ b/Algorithms/0257.binary-tree-paths/binary-tree-paths.go @@ -0,0 +1,2 @@ +package Problem0257 + diff --git a/Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go b/Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go new file mode 100755 index 000000000..789142685 --- /dev/null +++ b/Algorithms/0257.binary-tree-paths/binary-tree-paths_test.go @@ -0,0 +1,43 @@ +package Problem0257 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0257(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0258.add-digits/README.md b/Algorithms/0258.add-digits/README.md new file mode 100755 index 000000000..97d47dfbb --- /dev/null +++ b/Algorithms/0258.add-digits/README.md @@ -0,0 +1,11 @@ +# [258. Add Digits](https://leetcode.com/problems/add-digits/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0258.add-digits/add-digits.go b/Algorithms/0258.add-digits/add-digits.go new file mode 100755 index 000000000..ab5a3489c --- /dev/null +++ b/Algorithms/0258.add-digits/add-digits.go @@ -0,0 +1,2 @@ +package Problem0258 + diff --git a/Algorithms/0258.add-digits/add-digits_test.go b/Algorithms/0258.add-digits/add-digits_test.go new file mode 100755 index 000000000..2a5442de8 --- /dev/null +++ b/Algorithms/0258.add-digits/add-digits_test.go @@ -0,0 +1,43 @@ +package Problem0258 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0258(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0259.3sum-smaller/3sum-smaller.go b/Algorithms/0259.3sum-smaller/3sum-smaller.go new file mode 100755 index 000000000..dbc5ae9e0 --- /dev/null +++ b/Algorithms/0259.3sum-smaller/3sum-smaller.go @@ -0,0 +1,2 @@ +package Problem0259 + diff --git a/Algorithms/0259.3sum-smaller/3sum-smaller_test.go b/Algorithms/0259.3sum-smaller/3sum-smaller_test.go new file mode 100755 index 000000000..cc92c1322 --- /dev/null +++ b/Algorithms/0259.3sum-smaller/3sum-smaller_test.go @@ -0,0 +1,43 @@ +package Problem0259 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0259(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0259.3sum-smaller/README.md b/Algorithms/0259.3sum-smaller/README.md new file mode 100755 index 000000000..ff8a511a4 --- /dev/null +++ b/Algorithms/0259.3sum-smaller/README.md @@ -0,0 +1,11 @@ +# [259. 3Sum Smaller](https://leetcode.com/problems/3sum-smaller/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0260.single-number-iii/README.md b/Algorithms/0260.single-number-iii/README.md new file mode 100755 index 000000000..1c9329f64 --- /dev/null +++ b/Algorithms/0260.single-number-iii/README.md @@ -0,0 +1,11 @@ +# [260. Single Number III](https://leetcode.com/problems/single-number-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0260.single-number-iii/single-number-iii.go b/Algorithms/0260.single-number-iii/single-number-iii.go new file mode 100755 index 000000000..973d8dae1 --- /dev/null +++ b/Algorithms/0260.single-number-iii/single-number-iii.go @@ -0,0 +1,2 @@ +package Problem0260 + diff --git a/Algorithms/0260.single-number-iii/single-number-iii_test.go b/Algorithms/0260.single-number-iii/single-number-iii_test.go new file mode 100755 index 000000000..0998eea19 --- /dev/null +++ b/Algorithms/0260.single-number-iii/single-number-iii_test.go @@ -0,0 +1,43 @@ +package Problem0260 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0260(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0261.graph-valid-tree/README.md b/Algorithms/0261.graph-valid-tree/README.md new file mode 100755 index 000000000..f5d0bc4b4 --- /dev/null +++ b/Algorithms/0261.graph-valid-tree/README.md @@ -0,0 +1,11 @@ +# [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0261.graph-valid-tree/graph-valid-tree.go b/Algorithms/0261.graph-valid-tree/graph-valid-tree.go new file mode 100755 index 000000000..a448f7a06 --- /dev/null +++ b/Algorithms/0261.graph-valid-tree/graph-valid-tree.go @@ -0,0 +1,2 @@ +package Problem0261 + diff --git a/Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go b/Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go new file mode 100755 index 000000000..0bf080ce0 --- /dev/null +++ b/Algorithms/0261.graph-valid-tree/graph-valid-tree_test.go @@ -0,0 +1,43 @@ +package Problem0261 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0261(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0263.ugly-number/README.md b/Algorithms/0263.ugly-number/README.md new file mode 100755 index 000000000..4960ceb58 --- /dev/null +++ b/Algorithms/0263.ugly-number/README.md @@ -0,0 +1,11 @@ +# [263. Ugly Number](https://leetcode.com/problems/ugly-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0263.ugly-number/ugly-number.go b/Algorithms/0263.ugly-number/ugly-number.go new file mode 100755 index 000000000..26407113b --- /dev/null +++ b/Algorithms/0263.ugly-number/ugly-number.go @@ -0,0 +1,2 @@ +package Problem0263 + diff --git a/Algorithms/0263.ugly-number/ugly-number_test.go b/Algorithms/0263.ugly-number/ugly-number_test.go new file mode 100755 index 000000000..9cfaad687 --- /dev/null +++ b/Algorithms/0263.ugly-number/ugly-number_test.go @@ -0,0 +1,43 @@ +package Problem0263 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0263(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0264.ugly-number-ii/README.md b/Algorithms/0264.ugly-number-ii/README.md new file mode 100755 index 000000000..542c298b0 --- /dev/null +++ b/Algorithms/0264.ugly-number-ii/README.md @@ -0,0 +1,11 @@ +# [264. Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0264.ugly-number-ii/ugly-number-ii.go b/Algorithms/0264.ugly-number-ii/ugly-number-ii.go new file mode 100755 index 000000000..a2bfee82a --- /dev/null +++ b/Algorithms/0264.ugly-number-ii/ugly-number-ii.go @@ -0,0 +1,2 @@ +package Problem0264 + diff --git a/Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go b/Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go new file mode 100755 index 000000000..4fd6c93f1 --- /dev/null +++ b/Algorithms/0264.ugly-number-ii/ugly-number-ii_test.go @@ -0,0 +1,43 @@ +package Problem0264 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0264(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0265.paint-house-ii/README.md b/Algorithms/0265.paint-house-ii/README.md new file mode 100755 index 000000000..9a0429eb1 --- /dev/null +++ b/Algorithms/0265.paint-house-ii/README.md @@ -0,0 +1,11 @@ +# [265. Paint House II](https://leetcode.com/problems/paint-house-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0265.paint-house-ii/paint-house-ii.go b/Algorithms/0265.paint-house-ii/paint-house-ii.go new file mode 100755 index 000000000..982c26a04 --- /dev/null +++ b/Algorithms/0265.paint-house-ii/paint-house-ii.go @@ -0,0 +1,2 @@ +package Problem0265 + diff --git a/Algorithms/0265.paint-house-ii/paint-house-ii_test.go b/Algorithms/0265.paint-house-ii/paint-house-ii_test.go new file mode 100755 index 000000000..bd30cad6e --- /dev/null +++ b/Algorithms/0265.paint-house-ii/paint-house-ii_test.go @@ -0,0 +1,43 @@ +package Problem0265 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0265(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0266.palindrome-permutation/README.md b/Algorithms/0266.palindrome-permutation/README.md new file mode 100755 index 000000000..4a0d34f28 --- /dev/null +++ b/Algorithms/0266.palindrome-permutation/README.md @@ -0,0 +1,11 @@ +# [266. Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0266.palindrome-permutation/palindrome-permutation.go b/Algorithms/0266.palindrome-permutation/palindrome-permutation.go new file mode 100755 index 000000000..1f4a8cdf0 --- /dev/null +++ b/Algorithms/0266.palindrome-permutation/palindrome-permutation.go @@ -0,0 +1,2 @@ +package Problem0266 + diff --git a/Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go b/Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go new file mode 100755 index 000000000..1c9838c1f --- /dev/null +++ b/Algorithms/0266.palindrome-permutation/palindrome-permutation_test.go @@ -0,0 +1,43 @@ +package Problem0266 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0266(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0267.palindrome-permutation-ii/README.md b/Algorithms/0267.palindrome-permutation-ii/README.md new file mode 100755 index 000000000..cfbe96124 --- /dev/null +++ b/Algorithms/0267.palindrome-permutation-ii/README.md @@ -0,0 +1,11 @@ +# [267. Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii.go b/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii.go new file mode 100755 index 000000000..0c310eb6d --- /dev/null +++ b/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii.go @@ -0,0 +1,2 @@ +package Problem0267 + diff --git a/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go b/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go new file mode 100755 index 000000000..cfc710c73 --- /dev/null +++ b/Algorithms/0267.palindrome-permutation-ii/palindrome-permutation-ii_test.go @@ -0,0 +1,43 @@ +package Problem0267 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0267(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0268.missing-number/README.md b/Algorithms/0268.missing-number/README.md new file mode 100755 index 000000000..fd7ac214f --- /dev/null +++ b/Algorithms/0268.missing-number/README.md @@ -0,0 +1,11 @@ +# [268. Missing Number](https://leetcode.com/problems/missing-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0268.missing-number/missing-number.go b/Algorithms/0268.missing-number/missing-number.go new file mode 100755 index 000000000..197f9754c --- /dev/null +++ b/Algorithms/0268.missing-number/missing-number.go @@ -0,0 +1,2 @@ +package Problem0268 + diff --git a/Algorithms/0268.missing-number/missing-number_test.go b/Algorithms/0268.missing-number/missing-number_test.go new file mode 100755 index 000000000..55816fd4d --- /dev/null +++ b/Algorithms/0268.missing-number/missing-number_test.go @@ -0,0 +1,43 @@ +package Problem0268 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0268(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0269.alien-dictionary/README.md b/Algorithms/0269.alien-dictionary/README.md new file mode 100755 index 000000000..5386eab0e --- /dev/null +++ b/Algorithms/0269.alien-dictionary/README.md @@ -0,0 +1,11 @@ +# [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0269.alien-dictionary/alien-dictionary.go b/Algorithms/0269.alien-dictionary/alien-dictionary.go new file mode 100755 index 000000000..1220f8adb --- /dev/null +++ b/Algorithms/0269.alien-dictionary/alien-dictionary.go @@ -0,0 +1,2 @@ +package Problem0269 + diff --git a/Algorithms/0269.alien-dictionary/alien-dictionary_test.go b/Algorithms/0269.alien-dictionary/alien-dictionary_test.go new file mode 100755 index 000000000..1ec631e02 --- /dev/null +++ b/Algorithms/0269.alien-dictionary/alien-dictionary_test.go @@ -0,0 +1,43 @@ +package Problem0269 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0269(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0270.closest-binary-search-tree-value/README.md b/Algorithms/0270.closest-binary-search-tree-value/README.md new file mode 100755 index 000000000..63b2f0eae --- /dev/null +++ b/Algorithms/0270.closest-binary-search-tree-value/README.md @@ -0,0 +1,11 @@ +# [270. Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value.go b/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value.go new file mode 100755 index 000000000..7717d96f6 --- /dev/null +++ b/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value.go @@ -0,0 +1,2 @@ +package Problem0270 + 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 new file mode 100755 index 000000000..8b5557da6 --- /dev/null +++ b/Algorithms/0270.closest-binary-search-tree-value/closest-binary-search-tree-value_test.go @@ -0,0 +1,43 @@ +package Problem0270 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0270(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0271.encode-and-decode-strings/README.md b/Algorithms/0271.encode-and-decode-strings/README.md new file mode 100755 index 000000000..bc2b7b125 --- /dev/null +++ b/Algorithms/0271.encode-and-decode-strings/README.md @@ -0,0 +1,11 @@ +# [271. Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings.go b/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings.go new file mode 100755 index 000000000..c2187f38d --- /dev/null +++ b/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings.go @@ -0,0 +1,2 @@ +package Problem0271 + 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 new file mode 100755 index 000000000..7defccd07 --- /dev/null +++ b/Algorithms/0271.encode-and-decode-strings/encode-and-decode-strings_test.go @@ -0,0 +1,43 @@ +package Problem0271 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0271(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0272.closest-binary-search-tree-value-ii/README.md b/Algorithms/0272.closest-binary-search-tree-value-ii/README.md new file mode 100755 index 000000000..f137a817e --- /dev/null +++ b/Algorithms/0272.closest-binary-search-tree-value-ii/README.md @@ -0,0 +1,11 @@ +# [272. Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii.go b/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii.go new file mode 100755 index 000000000..87d32f3ba --- /dev/null +++ b/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii.go @@ -0,0 +1,2 @@ +package Problem0272 + 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 new file mode 100755 index 000000000..ec31f803a --- /dev/null +++ b/Algorithms/0272.closest-binary-search-tree-value-ii/closest-binary-search-tree-value-ii_test.go @@ -0,0 +1,43 @@ +package Problem0272 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0272(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0273.integer-to-english-words/README.md b/Algorithms/0273.integer-to-english-words/README.md new file mode 100755 index 000000000..31d881a09 --- /dev/null +++ b/Algorithms/0273.integer-to-english-words/README.md @@ -0,0 +1,11 @@ +# [273. Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0273.integer-to-english-words/integer-to-english-words.go b/Algorithms/0273.integer-to-english-words/integer-to-english-words.go new file mode 100755 index 000000000..eeb1cd810 --- /dev/null +++ b/Algorithms/0273.integer-to-english-words/integer-to-english-words.go @@ -0,0 +1,2 @@ +package Problem0273 + 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 new file mode 100755 index 000000000..250105aae --- /dev/null +++ b/Algorithms/0273.integer-to-english-words/integer-to-english-words_test.go @@ -0,0 +1,43 @@ +package Problem0273 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0273(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0274.h-index/README.md b/Algorithms/0274.h-index/README.md new file mode 100755 index 000000000..47b074c8f --- /dev/null +++ b/Algorithms/0274.h-index/README.md @@ -0,0 +1,11 @@ +# [274. H-Index](https://leetcode.com/problems/h-index/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0274.h-index/h-index.go b/Algorithms/0274.h-index/h-index.go new file mode 100755 index 000000000..19c0a6982 --- /dev/null +++ b/Algorithms/0274.h-index/h-index.go @@ -0,0 +1,2 @@ +package Problem0274 + diff --git a/Algorithms/0274.h-index/h-index_test.go b/Algorithms/0274.h-index/h-index_test.go new file mode 100755 index 000000000..63ff312dc --- /dev/null +++ b/Algorithms/0274.h-index/h-index_test.go @@ -0,0 +1,43 @@ +package Problem0274 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0274(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0275.h-index-ii/README.md b/Algorithms/0275.h-index-ii/README.md new file mode 100755 index 000000000..6d7f012f8 --- /dev/null +++ b/Algorithms/0275.h-index-ii/README.md @@ -0,0 +1,11 @@ +# [275. H-Index II](https://leetcode.com/problems/h-index-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0275.h-index-ii/h-index-ii.go b/Algorithms/0275.h-index-ii/h-index-ii.go new file mode 100755 index 000000000..dd9f62c22 --- /dev/null +++ b/Algorithms/0275.h-index-ii/h-index-ii.go @@ -0,0 +1,2 @@ +package Problem0275 + diff --git a/Algorithms/0275.h-index-ii/h-index-ii_test.go b/Algorithms/0275.h-index-ii/h-index-ii_test.go new file mode 100755 index 000000000..f2b9183b6 --- /dev/null +++ b/Algorithms/0275.h-index-ii/h-index-ii_test.go @@ -0,0 +1,43 @@ +package Problem0275 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0275(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0276.paint-fence/README.md b/Algorithms/0276.paint-fence/README.md new file mode 100755 index 000000000..3c009f54f --- /dev/null +++ b/Algorithms/0276.paint-fence/README.md @@ -0,0 +1,11 @@ +# [276. Paint Fence](https://leetcode.com/problems/paint-fence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0276.paint-fence/paint-fence.go b/Algorithms/0276.paint-fence/paint-fence.go new file mode 100755 index 000000000..256051ab9 --- /dev/null +++ b/Algorithms/0276.paint-fence/paint-fence.go @@ -0,0 +1,2 @@ +package Problem0276 + diff --git a/Algorithms/0276.paint-fence/paint-fence_test.go b/Algorithms/0276.paint-fence/paint-fence_test.go new file mode 100755 index 000000000..6f33779c2 --- /dev/null +++ b/Algorithms/0276.paint-fence/paint-fence_test.go @@ -0,0 +1,43 @@ +package Problem0276 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0276(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0277.find-the-celebrity/README.md b/Algorithms/0277.find-the-celebrity/README.md new file mode 100755 index 000000000..be7582ca9 --- /dev/null +++ b/Algorithms/0277.find-the-celebrity/README.md @@ -0,0 +1,11 @@ +# [277. Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0277.find-the-celebrity/find-the-celebrity.go b/Algorithms/0277.find-the-celebrity/find-the-celebrity.go new file mode 100755 index 000000000..e8d316b09 --- /dev/null +++ b/Algorithms/0277.find-the-celebrity/find-the-celebrity.go @@ -0,0 +1,2 @@ +package Problem0277 + diff --git a/Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go b/Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go new file mode 100755 index 000000000..ce7acba2f --- /dev/null +++ b/Algorithms/0277.find-the-celebrity/find-the-celebrity_test.go @@ -0,0 +1,43 @@ +package Problem0277 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0277(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0278.first-bad-version/README.md b/Algorithms/0278.first-bad-version/README.md new file mode 100755 index 000000000..d997ff473 --- /dev/null +++ b/Algorithms/0278.first-bad-version/README.md @@ -0,0 +1,11 @@ +# [278. First Bad Version](https://leetcode.com/problems/first-bad-version/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0278.first-bad-version/first-bad-version.go b/Algorithms/0278.first-bad-version/first-bad-version.go new file mode 100755 index 000000000..b7e7a2c30 --- /dev/null +++ b/Algorithms/0278.first-bad-version/first-bad-version.go @@ -0,0 +1,2 @@ +package Problem0278 + diff --git a/Algorithms/0278.first-bad-version/first-bad-version_test.go b/Algorithms/0278.first-bad-version/first-bad-version_test.go new file mode 100755 index 000000000..f9e6e0326 --- /dev/null +++ b/Algorithms/0278.first-bad-version/first-bad-version_test.go @@ -0,0 +1,43 @@ +package Problem0278 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0278(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0279.perfect-squares/README.md b/Algorithms/0279.perfect-squares/README.md new file mode 100755 index 000000000..e3e35312c --- /dev/null +++ b/Algorithms/0279.perfect-squares/README.md @@ -0,0 +1,11 @@ +# [279. Perfect Squares](https://leetcode.com/problems/perfect-squares/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0279.perfect-squares/perfect-squares.go b/Algorithms/0279.perfect-squares/perfect-squares.go new file mode 100755 index 000000000..5f5d1b1ed --- /dev/null +++ b/Algorithms/0279.perfect-squares/perfect-squares.go @@ -0,0 +1,2 @@ +package Problem0279 + diff --git a/Algorithms/0279.perfect-squares/perfect-squares_test.go b/Algorithms/0279.perfect-squares/perfect-squares_test.go new file mode 100755 index 000000000..1896a1c6d --- /dev/null +++ b/Algorithms/0279.perfect-squares/perfect-squares_test.go @@ -0,0 +1,43 @@ +package Problem0279 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0279(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0280.wiggle-sort/README.md b/Algorithms/0280.wiggle-sort/README.md new file mode 100755 index 000000000..0158cf577 --- /dev/null +++ b/Algorithms/0280.wiggle-sort/README.md @@ -0,0 +1,11 @@ +# [280. Wiggle Sort](https://leetcode.com/problems/wiggle-sort/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0280.wiggle-sort/wiggle-sort.go b/Algorithms/0280.wiggle-sort/wiggle-sort.go new file mode 100755 index 000000000..bcbdfe365 --- /dev/null +++ b/Algorithms/0280.wiggle-sort/wiggle-sort.go @@ -0,0 +1,2 @@ +package Problem0280 + diff --git a/Algorithms/0280.wiggle-sort/wiggle-sort_test.go b/Algorithms/0280.wiggle-sort/wiggle-sort_test.go new file mode 100755 index 000000000..1bd951c4c --- /dev/null +++ b/Algorithms/0280.wiggle-sort/wiggle-sort_test.go @@ -0,0 +1,43 @@ +package Problem0280 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0280(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0281.zigzag-iterator/README.md b/Algorithms/0281.zigzag-iterator/README.md new file mode 100755 index 000000000..03d18303c --- /dev/null +++ b/Algorithms/0281.zigzag-iterator/README.md @@ -0,0 +1,11 @@ +# [281. Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0281.zigzag-iterator/zigzag-iterator.go b/Algorithms/0281.zigzag-iterator/zigzag-iterator.go new file mode 100755 index 000000000..5f339db11 --- /dev/null +++ b/Algorithms/0281.zigzag-iterator/zigzag-iterator.go @@ -0,0 +1,2 @@ +package Problem0281 + diff --git a/Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go b/Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go new file mode 100755 index 000000000..582fbf800 --- /dev/null +++ b/Algorithms/0281.zigzag-iterator/zigzag-iterator_test.go @@ -0,0 +1,43 @@ +package Problem0281 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0281(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0282.expression-add-operators/README.md b/Algorithms/0282.expression-add-operators/README.md new file mode 100755 index 000000000..b7e2a4e3c --- /dev/null +++ b/Algorithms/0282.expression-add-operators/README.md @@ -0,0 +1,11 @@ +# [282. Expression Add Operators](https://leetcode.com/problems/expression-add-operators/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0282.expression-add-operators/expression-add-operators.go b/Algorithms/0282.expression-add-operators/expression-add-operators.go new file mode 100755 index 000000000..6782c181b --- /dev/null +++ b/Algorithms/0282.expression-add-operators/expression-add-operators.go @@ -0,0 +1,2 @@ +package Problem0282 + diff --git a/Algorithms/0282.expression-add-operators/expression-add-operators_test.go b/Algorithms/0282.expression-add-operators/expression-add-operators_test.go new file mode 100755 index 000000000..0295c3d53 --- /dev/null +++ b/Algorithms/0282.expression-add-operators/expression-add-operators_test.go @@ -0,0 +1,43 @@ +package Problem0282 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0282(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0283.move-zeroes/README.md b/Algorithms/0283.move-zeroes/README.md new file mode 100755 index 000000000..8c7b7f14c --- /dev/null +++ b/Algorithms/0283.move-zeroes/README.md @@ -0,0 +1,11 @@ +# [283. Move Zeroes](https://leetcode.com/problems/move-zeroes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0283.move-zeroes/move-zeroes.go b/Algorithms/0283.move-zeroes/move-zeroes.go new file mode 100755 index 000000000..e9721ccfd --- /dev/null +++ b/Algorithms/0283.move-zeroes/move-zeroes.go @@ -0,0 +1,2 @@ +package Problem0283 + diff --git a/Algorithms/0283.move-zeroes/move-zeroes_test.go b/Algorithms/0283.move-zeroes/move-zeroes_test.go new file mode 100755 index 000000000..32e975bd6 --- /dev/null +++ b/Algorithms/0283.move-zeroes/move-zeroes_test.go @@ -0,0 +1,43 @@ +package Problem0283 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0283(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0284.peeking-iterator/README.md b/Algorithms/0284.peeking-iterator/README.md new file mode 100755 index 000000000..4e9e35652 --- /dev/null +++ b/Algorithms/0284.peeking-iterator/README.md @@ -0,0 +1,11 @@ +# [284. Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0284.peeking-iterator/peeking-iterator.go b/Algorithms/0284.peeking-iterator/peeking-iterator.go new file mode 100755 index 000000000..c50ccf546 --- /dev/null +++ b/Algorithms/0284.peeking-iterator/peeking-iterator.go @@ -0,0 +1,2 @@ +package Problem0284 + diff --git a/Algorithms/0284.peeking-iterator/peeking-iterator_test.go b/Algorithms/0284.peeking-iterator/peeking-iterator_test.go new file mode 100755 index 000000000..cc437940e --- /dev/null +++ b/Algorithms/0284.peeking-iterator/peeking-iterator_test.go @@ -0,0 +1,43 @@ +package Problem0284 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0284(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0285.inorder-successor-in-bst/README.md b/Algorithms/0285.inorder-successor-in-bst/README.md new file mode 100755 index 000000000..d3619c31b --- /dev/null +++ b/Algorithms/0285.inorder-successor-in-bst/README.md @@ -0,0 +1,11 @@ +# [285. Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst.go b/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst.go new file mode 100755 index 000000000..1261a119e --- /dev/null +++ b/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst.go @@ -0,0 +1,2 @@ +package Problem0285 + 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 new file mode 100755 index 000000000..29338cd75 --- /dev/null +++ b/Algorithms/0285.inorder-successor-in-bst/inorder-successor-in-bst_test.go @@ -0,0 +1,43 @@ +package Problem0285 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0285(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0286.walls-and-gates/README.md b/Algorithms/0286.walls-and-gates/README.md new file mode 100755 index 000000000..dff452bd4 --- /dev/null +++ b/Algorithms/0286.walls-and-gates/README.md @@ -0,0 +1,11 @@ +# [286. Walls and Gates](https://leetcode.com/problems/walls-and-gates/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0286.walls-and-gates/walls-and-gates.go b/Algorithms/0286.walls-and-gates/walls-and-gates.go new file mode 100755 index 000000000..319d8b976 --- /dev/null +++ b/Algorithms/0286.walls-and-gates/walls-and-gates.go @@ -0,0 +1,2 @@ +package Problem0286 + diff --git a/Algorithms/0286.walls-and-gates/walls-and-gates_test.go b/Algorithms/0286.walls-and-gates/walls-and-gates_test.go new file mode 100755 index 000000000..8a4706055 --- /dev/null +++ b/Algorithms/0286.walls-and-gates/walls-and-gates_test.go @@ -0,0 +1,43 @@ +package Problem0286 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0286(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0287.find-the-duplicate-number/README.md b/Algorithms/0287.find-the-duplicate-number/README.md new file mode 100755 index 000000000..b721707b3 --- /dev/null +++ b/Algorithms/0287.find-the-duplicate-number/README.md @@ -0,0 +1,11 @@ +# [287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number.go b/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number.go new file mode 100755 index 000000000..c59d07a4d --- /dev/null +++ b/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number.go @@ -0,0 +1,2 @@ +package Problem0287 + 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 new file mode 100755 index 000000000..2e009b5f8 --- /dev/null +++ b/Algorithms/0287.find-the-duplicate-number/find-the-duplicate-number_test.go @@ -0,0 +1,43 @@ +package Problem0287 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0287(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0288.unique-word-abbreviation/README.md b/Algorithms/0288.unique-word-abbreviation/README.md new file mode 100755 index 000000000..9d4bc0f7e --- /dev/null +++ b/Algorithms/0288.unique-word-abbreviation/README.md @@ -0,0 +1,11 @@ +# [288. Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation.go b/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation.go new file mode 100755 index 000000000..9403c531f --- /dev/null +++ b/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation.go @@ -0,0 +1,2 @@ +package Problem0288 + diff --git a/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go b/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go new file mode 100755 index 000000000..2b184ed52 --- /dev/null +++ b/Algorithms/0288.unique-word-abbreviation/unique-word-abbreviation_test.go @@ -0,0 +1,43 @@ +package Problem0288 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0288(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0289.game-of-life/README.md b/Algorithms/0289.game-of-life/README.md new file mode 100755 index 000000000..02978afc2 --- /dev/null +++ b/Algorithms/0289.game-of-life/README.md @@ -0,0 +1,11 @@ +# [289. Game of Life](https://leetcode.com/problems/game-of-life/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0289.game-of-life/game-of-life.go b/Algorithms/0289.game-of-life/game-of-life.go new file mode 100755 index 000000000..3921cc79f --- /dev/null +++ b/Algorithms/0289.game-of-life/game-of-life.go @@ -0,0 +1,2 @@ +package Problem0289 + diff --git a/Algorithms/0289.game-of-life/game-of-life_test.go b/Algorithms/0289.game-of-life/game-of-life_test.go new file mode 100755 index 000000000..83aee62d2 --- /dev/null +++ b/Algorithms/0289.game-of-life/game-of-life_test.go @@ -0,0 +1,43 @@ +package Problem0289 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0289(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0290.word-pattern/README.md b/Algorithms/0290.word-pattern/README.md new file mode 100755 index 000000000..f4857aad4 --- /dev/null +++ b/Algorithms/0290.word-pattern/README.md @@ -0,0 +1,11 @@ +# [290. Word Pattern](https://leetcode.com/problems/word-pattern/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0290.word-pattern/word-pattern.go b/Algorithms/0290.word-pattern/word-pattern.go new file mode 100755 index 000000000..c284b428e --- /dev/null +++ b/Algorithms/0290.word-pattern/word-pattern.go @@ -0,0 +1,2 @@ +package Problem0290 + diff --git a/Algorithms/0290.word-pattern/word-pattern_test.go b/Algorithms/0290.word-pattern/word-pattern_test.go new file mode 100755 index 000000000..e0a3d517e --- /dev/null +++ b/Algorithms/0290.word-pattern/word-pattern_test.go @@ -0,0 +1,43 @@ +package Problem0290 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0290(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0291.word-pattern-ii/README.md b/Algorithms/0291.word-pattern-ii/README.md new file mode 100755 index 000000000..5a6d49f72 --- /dev/null +++ b/Algorithms/0291.word-pattern-ii/README.md @@ -0,0 +1,11 @@ +# [291. Word Pattern II](https://leetcode.com/problems/word-pattern-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0291.word-pattern-ii/word-pattern-ii.go b/Algorithms/0291.word-pattern-ii/word-pattern-ii.go new file mode 100755 index 000000000..77f5328cc --- /dev/null +++ b/Algorithms/0291.word-pattern-ii/word-pattern-ii.go @@ -0,0 +1,2 @@ +package Problem0291 + diff --git a/Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go b/Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go new file mode 100755 index 000000000..87433d198 --- /dev/null +++ b/Algorithms/0291.word-pattern-ii/word-pattern-ii_test.go @@ -0,0 +1,43 @@ +package Problem0291 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0291(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0292.nim-game/README.md b/Algorithms/0292.nim-game/README.md new file mode 100755 index 000000000..41c398549 --- /dev/null +++ b/Algorithms/0292.nim-game/README.md @@ -0,0 +1,11 @@ +# [292. Nim Game](https://leetcode.com/problems/nim-game/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0292.nim-game/nim-game.go b/Algorithms/0292.nim-game/nim-game.go new file mode 100755 index 000000000..fec32970d --- /dev/null +++ b/Algorithms/0292.nim-game/nim-game.go @@ -0,0 +1,2 @@ +package Problem0292 + diff --git a/Algorithms/0292.nim-game/nim-game_test.go b/Algorithms/0292.nim-game/nim-game_test.go new file mode 100755 index 000000000..03500bfed --- /dev/null +++ b/Algorithms/0292.nim-game/nim-game_test.go @@ -0,0 +1,43 @@ +package Problem0292 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0292(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0293.flip-game/README.md b/Algorithms/0293.flip-game/README.md new file mode 100755 index 000000000..84d1883a2 --- /dev/null +++ b/Algorithms/0293.flip-game/README.md @@ -0,0 +1,11 @@ +# [293. Flip Game](https://leetcode.com/problems/flip-game/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0293.flip-game/flip-game.go b/Algorithms/0293.flip-game/flip-game.go new file mode 100755 index 000000000..dc797467b --- /dev/null +++ b/Algorithms/0293.flip-game/flip-game.go @@ -0,0 +1,2 @@ +package Problem0293 + diff --git a/Algorithms/0293.flip-game/flip-game_test.go b/Algorithms/0293.flip-game/flip-game_test.go new file mode 100755 index 000000000..42e9f2081 --- /dev/null +++ b/Algorithms/0293.flip-game/flip-game_test.go @@ -0,0 +1,43 @@ +package Problem0293 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0293(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0294.flip-game-ii/README.md b/Algorithms/0294.flip-game-ii/README.md new file mode 100755 index 000000000..8b923d12d --- /dev/null +++ b/Algorithms/0294.flip-game-ii/README.md @@ -0,0 +1,11 @@ +# [294. Flip Game II](https://leetcode.com/problems/flip-game-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0294.flip-game-ii/flip-game-ii.go b/Algorithms/0294.flip-game-ii/flip-game-ii.go new file mode 100755 index 000000000..5cae9a930 --- /dev/null +++ b/Algorithms/0294.flip-game-ii/flip-game-ii.go @@ -0,0 +1,2 @@ +package Problem0294 + diff --git a/Algorithms/0294.flip-game-ii/flip-game-ii_test.go b/Algorithms/0294.flip-game-ii/flip-game-ii_test.go new file mode 100755 index 000000000..e32dc37bc --- /dev/null +++ b/Algorithms/0294.flip-game-ii/flip-game-ii_test.go @@ -0,0 +1,43 @@ +package Problem0294 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0294(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0295.find-median-from-data-stream/README.md b/Algorithms/0295.find-median-from-data-stream/README.md new file mode 100755 index 000000000..9bf00cd61 --- /dev/null +++ b/Algorithms/0295.find-median-from-data-stream/README.md @@ -0,0 +1,11 @@ +# [295. Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream.go b/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream.go new file mode 100755 index 000000000..8dfe6e4e3 --- /dev/null +++ b/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream.go @@ -0,0 +1,2 @@ +package Problem0295 + 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 new file mode 100755 index 000000000..d4c34045a --- /dev/null +++ b/Algorithms/0295.find-median-from-data-stream/find-median-from-data-stream_test.go @@ -0,0 +1,43 @@ +package Problem0295 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0295(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0296.best-meeting-point/README.md b/Algorithms/0296.best-meeting-point/README.md new file mode 100755 index 000000000..86d74044c --- /dev/null +++ b/Algorithms/0296.best-meeting-point/README.md @@ -0,0 +1,11 @@ +# [296. Best Meeting Point](https://leetcode.com/problems/best-meeting-point/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0296.best-meeting-point/best-meeting-point.go b/Algorithms/0296.best-meeting-point/best-meeting-point.go new file mode 100755 index 000000000..8c40f659c --- /dev/null +++ b/Algorithms/0296.best-meeting-point/best-meeting-point.go @@ -0,0 +1,2 @@ +package Problem0296 + diff --git a/Algorithms/0296.best-meeting-point/best-meeting-point_test.go b/Algorithms/0296.best-meeting-point/best-meeting-point_test.go new file mode 100755 index 000000000..390c24614 --- /dev/null +++ b/Algorithms/0296.best-meeting-point/best-meeting-point_test.go @@ -0,0 +1,43 @@ +package Problem0296 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0296(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0297.serialize-and-deserialize-binary-tree/README.md b/Algorithms/0297.serialize-and-deserialize-binary-tree/README.md new file mode 100755 index 000000000..fc906622b --- /dev/null +++ b/Algorithms/0297.serialize-and-deserialize-binary-tree/README.md @@ -0,0 +1,11 @@ +# [297. Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree.go b/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree.go new file mode 100755 index 000000000..8b79efa9d --- /dev/null +++ b/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0297 + 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 new file mode 100755 index 000000000..6d53388ff --- /dev/null +++ b/Algorithms/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0297 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0297(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0298.binary-tree-longest-consecutive-sequence/README.md b/Algorithms/0298.binary-tree-longest-consecutive-sequence/README.md new file mode 100755 index 000000000..0104844a3 --- /dev/null +++ b/Algorithms/0298.binary-tree-longest-consecutive-sequence/README.md @@ -0,0 +1,11 @@ +# [298. Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence.go b/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence.go new file mode 100755 index 000000000..cbbe3669a --- /dev/null +++ b/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence.go @@ -0,0 +1,2 @@ +package Problem0298 + 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 new file mode 100755 index 000000000..633c76fbe --- /dev/null +++ b/Algorithms/0298.binary-tree-longest-consecutive-sequence/binary-tree-longest-consecutive-sequence_test.go @@ -0,0 +1,43 @@ +package Problem0298 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0298(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0299.bulls-and-cows/README.md b/Algorithms/0299.bulls-and-cows/README.md new file mode 100755 index 000000000..d38138ca4 --- /dev/null +++ b/Algorithms/0299.bulls-and-cows/README.md @@ -0,0 +1,11 @@ +# [299. Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0299.bulls-and-cows/bulls-and-cows.go b/Algorithms/0299.bulls-and-cows/bulls-and-cows.go new file mode 100755 index 000000000..d1b743175 --- /dev/null +++ b/Algorithms/0299.bulls-and-cows/bulls-and-cows.go @@ -0,0 +1,2 @@ +package Problem0299 + diff --git a/Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go b/Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go new file mode 100755 index 000000000..064920381 --- /dev/null +++ b/Algorithms/0299.bulls-and-cows/bulls-and-cows_test.go @@ -0,0 +1,43 @@ +package Problem0299 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0299(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0300.longest-increasing-subsequence/README.md b/Algorithms/0300.longest-increasing-subsequence/README.md new file mode 100755 index 000000000..8442540f9 --- /dev/null +++ b/Algorithms/0300.longest-increasing-subsequence/README.md @@ -0,0 +1,11 @@ +# [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence.go b/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence.go new file mode 100755 index 000000000..f02216b40 --- /dev/null +++ b/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence.go @@ -0,0 +1,2 @@ +package Problem0300 + diff --git a/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go b/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go new file mode 100755 index 000000000..89c48b365 --- /dev/null +++ b/Algorithms/0300.longest-increasing-subsequence/longest-increasing-subsequence_test.go @@ -0,0 +1,43 @@ +package Problem0300 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0300(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0301.remove-invalid-parentheses/README.md b/Algorithms/0301.remove-invalid-parentheses/README.md new file mode 100755 index 000000000..b576d9e85 --- /dev/null +++ b/Algorithms/0301.remove-invalid-parentheses/README.md @@ -0,0 +1,11 @@ +# [301. Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses.go b/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses.go new file mode 100755 index 000000000..e7666f681 --- /dev/null +++ b/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses.go @@ -0,0 +1,2 @@ +package Problem0301 + diff --git a/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go b/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go new file mode 100755 index 000000000..cc49b230b --- /dev/null +++ b/Algorithms/0301.remove-invalid-parentheses/remove-invalid-parentheses_test.go @@ -0,0 +1,43 @@ +package Problem0301 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0301(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/README.md b/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/README.md new file mode 100755 index 000000000..cbe758a78 --- /dev/null +++ b/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/README.md @@ -0,0 +1,11 @@ +# [302. Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels.go b/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels.go new file mode 100755 index 000000000..d325184d2 --- /dev/null +++ b/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels.go @@ -0,0 +1,2 @@ +package Problem0302 + 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 new file mode 100755 index 000000000..dd5f0edcc --- /dev/null +++ b/Algorithms/0302.smallest-rectangle-enclosing-black-pixels/smallest-rectangle-enclosing-black-pixels_test.go @@ -0,0 +1,43 @@ +package Problem0302 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0302(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0303.range-sum-query-immutable/README.md b/Algorithms/0303.range-sum-query-immutable/README.md new file mode 100755 index 000000000..d35e778f9 --- /dev/null +++ b/Algorithms/0303.range-sum-query-immutable/README.md @@ -0,0 +1,11 @@ +# [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable.go b/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable.go new file mode 100755 index 000000000..03a88bb67 --- /dev/null +++ b/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable.go @@ -0,0 +1,2 @@ +package Problem0303 + 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 new file mode 100755 index 000000000..fa64981a6 --- /dev/null +++ b/Algorithms/0303.range-sum-query-immutable/range-sum-query-immutable_test.go @@ -0,0 +1,43 @@ +package Problem0303 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0303(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0304.range-sum-query-2d-immutable/README.md b/Algorithms/0304.range-sum-query-2d-immutable/README.md new file mode 100755 index 000000000..b0b8387ab --- /dev/null +++ b/Algorithms/0304.range-sum-query-2d-immutable/README.md @@ -0,0 +1,11 @@ +# [304. Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable.go b/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable.go new file mode 100755 index 000000000..aeac778ed --- /dev/null +++ b/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable.go @@ -0,0 +1,2 @@ +package Problem0304 + 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 new file mode 100755 index 000000000..5f4734729 --- /dev/null +++ b/Algorithms/0304.range-sum-query-2d-immutable/range-sum-query-2d-immutable_test.go @@ -0,0 +1,43 @@ +package Problem0304 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0304(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0305.number-of-islands-ii/README.md b/Algorithms/0305.number-of-islands-ii/README.md new file mode 100755 index 000000000..45cce4c99 --- /dev/null +++ b/Algorithms/0305.number-of-islands-ii/README.md @@ -0,0 +1,11 @@ +# [305. Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0305.number-of-islands-ii/number-of-islands-ii.go b/Algorithms/0305.number-of-islands-ii/number-of-islands-ii.go new file mode 100755 index 000000000..c03ee2992 --- /dev/null +++ b/Algorithms/0305.number-of-islands-ii/number-of-islands-ii.go @@ -0,0 +1,2 @@ +package Problem0305 + 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 new file mode 100755 index 000000000..875850322 --- /dev/null +++ b/Algorithms/0305.number-of-islands-ii/number-of-islands-ii_test.go @@ -0,0 +1,43 @@ +package Problem0305 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0305(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0306.additive-number/README.md b/Algorithms/0306.additive-number/README.md new file mode 100755 index 000000000..1a44db682 --- /dev/null +++ b/Algorithms/0306.additive-number/README.md @@ -0,0 +1,11 @@ +# [306. Additive Number](https://leetcode.com/problems/additive-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0306.additive-number/additive-number.go b/Algorithms/0306.additive-number/additive-number.go new file mode 100755 index 000000000..8d05ad66d --- /dev/null +++ b/Algorithms/0306.additive-number/additive-number.go @@ -0,0 +1,2 @@ +package Problem0306 + diff --git a/Algorithms/0306.additive-number/additive-number_test.go b/Algorithms/0306.additive-number/additive-number_test.go new file mode 100755 index 000000000..79fde6544 --- /dev/null +++ b/Algorithms/0306.additive-number/additive-number_test.go @@ -0,0 +1,43 @@ +package Problem0306 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0306(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0307.range-sum-query-mutable/README.md b/Algorithms/0307.range-sum-query-mutable/README.md new file mode 100755 index 000000000..5fe19aa84 --- /dev/null +++ b/Algorithms/0307.range-sum-query-mutable/README.md @@ -0,0 +1,11 @@ +# [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable.go b/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable.go new file mode 100755 index 000000000..aa20af6bf --- /dev/null +++ b/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable.go @@ -0,0 +1,2 @@ +package Problem0307 + 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 new file mode 100755 index 000000000..e5c1cbff8 --- /dev/null +++ b/Algorithms/0307.range-sum-query-mutable/range-sum-query-mutable_test.go @@ -0,0 +1,43 @@ +package Problem0307 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0307(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0308.range-sum-query-2d-mutable/README.md b/Algorithms/0308.range-sum-query-2d-mutable/README.md new file mode 100755 index 000000000..a0204e76a --- /dev/null +++ b/Algorithms/0308.range-sum-query-2d-mutable/README.md @@ -0,0 +1,11 @@ +# [308. Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable.go b/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable.go new file mode 100755 index 000000000..8d0edb0ca --- /dev/null +++ b/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable.go @@ -0,0 +1,2 @@ +package Problem0308 + 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 new file mode 100755 index 000000000..ea6bc47a5 --- /dev/null +++ b/Algorithms/0308.range-sum-query-2d-mutable/range-sum-query-2d-mutable_test.go @@ -0,0 +1,43 @@ +package Problem0308 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0308(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/README.md b/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/README.md new file mode 100755 index 000000000..bbe1ef0ea --- /dev/null +++ b/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/README.md @@ -0,0 +1,11 @@ +# [309. Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown.go b/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown.go new file mode 100755 index 000000000..777b4f87b --- /dev/null +++ b/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown.go @@ -0,0 +1,2 @@ +package Problem0309 + 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 new file mode 100755 index 000000000..18b5c1be5 --- /dev/null +++ b/Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/best-time-to-buy-and-sell-stock-with-cooldown_test.go @@ -0,0 +1,43 @@ +package Problem0309 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0309(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0310.minimum-height-trees/README.md b/Algorithms/0310.minimum-height-trees/README.md new file mode 100755 index 000000000..fddd1209e --- /dev/null +++ b/Algorithms/0310.minimum-height-trees/README.md @@ -0,0 +1,11 @@ +# [310. Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0310.minimum-height-trees/minimum-height-trees.go b/Algorithms/0310.minimum-height-trees/minimum-height-trees.go new file mode 100755 index 000000000..0d3e8441e --- /dev/null +++ b/Algorithms/0310.minimum-height-trees/minimum-height-trees.go @@ -0,0 +1,2 @@ +package Problem0310 + diff --git a/Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go b/Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go new file mode 100755 index 000000000..3f4cf5631 --- /dev/null +++ b/Algorithms/0310.minimum-height-trees/minimum-height-trees_test.go @@ -0,0 +1,43 @@ +package Problem0310 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0310(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0311.sparse-matrix-multiplication/README.md b/Algorithms/0311.sparse-matrix-multiplication/README.md new file mode 100755 index 000000000..1f7e47b2b --- /dev/null +++ b/Algorithms/0311.sparse-matrix-multiplication/README.md @@ -0,0 +1,11 @@ +# [311. Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication.go b/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication.go new file mode 100755 index 000000000..e9780d787 --- /dev/null +++ b/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication.go @@ -0,0 +1,2 @@ +package Problem0311 + diff --git a/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go b/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go new file mode 100755 index 000000000..ab08ab429 --- /dev/null +++ b/Algorithms/0311.sparse-matrix-multiplication/sparse-matrix-multiplication_test.go @@ -0,0 +1,43 @@ +package Problem0311 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0311(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0312.burst-balloons/README.md b/Algorithms/0312.burst-balloons/README.md new file mode 100755 index 000000000..dbeaa5127 --- /dev/null +++ b/Algorithms/0312.burst-balloons/README.md @@ -0,0 +1,11 @@ +# [312. Burst Balloons](https://leetcode.com/problems/burst-balloons/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0312.burst-balloons/burst-balloons.go b/Algorithms/0312.burst-balloons/burst-balloons.go new file mode 100755 index 000000000..6d92eb09c --- /dev/null +++ b/Algorithms/0312.burst-balloons/burst-balloons.go @@ -0,0 +1,2 @@ +package Problem0312 + diff --git a/Algorithms/0312.burst-balloons/burst-balloons_test.go b/Algorithms/0312.burst-balloons/burst-balloons_test.go new file mode 100755 index 000000000..dd43ddcfb --- /dev/null +++ b/Algorithms/0312.burst-balloons/burst-balloons_test.go @@ -0,0 +1,43 @@ +package Problem0312 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0312(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0313.super-ugly-number/README.md b/Algorithms/0313.super-ugly-number/README.md new file mode 100755 index 000000000..50e2b62aa --- /dev/null +++ b/Algorithms/0313.super-ugly-number/README.md @@ -0,0 +1,11 @@ +# [313. Super Ugly Number](https://leetcode.com/problems/super-ugly-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0313.super-ugly-number/super-ugly-number.go b/Algorithms/0313.super-ugly-number/super-ugly-number.go new file mode 100755 index 000000000..9e1df5afb --- /dev/null +++ b/Algorithms/0313.super-ugly-number/super-ugly-number.go @@ -0,0 +1,2 @@ +package Problem0313 + diff --git a/Algorithms/0313.super-ugly-number/super-ugly-number_test.go b/Algorithms/0313.super-ugly-number/super-ugly-number_test.go new file mode 100755 index 000000000..298fd7857 --- /dev/null +++ b/Algorithms/0313.super-ugly-number/super-ugly-number_test.go @@ -0,0 +1,43 @@ +package Problem0313 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0313(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0314.binary-tree-vertical-order-traversal/README.md b/Algorithms/0314.binary-tree-vertical-order-traversal/README.md new file mode 100755 index 000000000..a21fe8323 --- /dev/null +++ b/Algorithms/0314.binary-tree-vertical-order-traversal/README.md @@ -0,0 +1,11 @@ +# [314. Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal.go b/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal.go new file mode 100755 index 000000000..2c0ee6d8f --- /dev/null +++ b/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal.go @@ -0,0 +1,2 @@ +package Problem0314 + 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 new file mode 100755 index 000000000..e17350e6c --- /dev/null +++ b/Algorithms/0314.binary-tree-vertical-order-traversal/binary-tree-vertical-order-traversal_test.go @@ -0,0 +1,43 @@ +package Problem0314 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0314(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0315.count-of-smaller-numbers-after-self/README.md b/Algorithms/0315.count-of-smaller-numbers-after-self/README.md new file mode 100755 index 000000000..3f1507a5c --- /dev/null +++ b/Algorithms/0315.count-of-smaller-numbers-after-self/README.md @@ -0,0 +1,11 @@ +# [315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self.go b/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self.go new file mode 100755 index 000000000..3a466ccfe --- /dev/null +++ b/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self.go @@ -0,0 +1,2 @@ +package Problem0315 + 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 new file mode 100755 index 000000000..e6e72585a --- /dev/null +++ b/Algorithms/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self_test.go @@ -0,0 +1,43 @@ +package Problem0315 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0315(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0316.remove-duplicate-letters/README.md b/Algorithms/0316.remove-duplicate-letters/README.md new file mode 100755 index 000000000..10241dd91 --- /dev/null +++ b/Algorithms/0316.remove-duplicate-letters/README.md @@ -0,0 +1,11 @@ +# [316. Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters.go b/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters.go new file mode 100755 index 000000000..cd8ed2ad1 --- /dev/null +++ b/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters.go @@ -0,0 +1,2 @@ +package Problem0316 + diff --git a/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go b/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go new file mode 100755 index 000000000..8bd3be11f --- /dev/null +++ b/Algorithms/0316.remove-duplicate-letters/remove-duplicate-letters_test.go @@ -0,0 +1,43 @@ +package Problem0316 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0316(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0317.shortest-distance-from-all-buildings/README.md b/Algorithms/0317.shortest-distance-from-all-buildings/README.md new file mode 100755 index 000000000..bc7570f24 --- /dev/null +++ b/Algorithms/0317.shortest-distance-from-all-buildings/README.md @@ -0,0 +1,11 @@ +# [317. Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings.go b/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings.go new file mode 100755 index 000000000..32b2b6387 --- /dev/null +++ b/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings.go @@ -0,0 +1,2 @@ +package Problem0317 + 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 new file mode 100755 index 000000000..196ad5424 --- /dev/null +++ b/Algorithms/0317.shortest-distance-from-all-buildings/shortest-distance-from-all-buildings_test.go @@ -0,0 +1,43 @@ +package Problem0317 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0317(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0318.maximum-product-of-word-lengths/README.md b/Algorithms/0318.maximum-product-of-word-lengths/README.md new file mode 100755 index 000000000..a419c45e6 --- /dev/null +++ b/Algorithms/0318.maximum-product-of-word-lengths/README.md @@ -0,0 +1,11 @@ +# [318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths.go b/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths.go new file mode 100755 index 000000000..2aab8f7ca --- /dev/null +++ b/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths.go @@ -0,0 +1,2 @@ +package Problem0318 + 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 new file mode 100755 index 000000000..02e452d68 --- /dev/null +++ b/Algorithms/0318.maximum-product-of-word-lengths/maximum-product-of-word-lengths_test.go @@ -0,0 +1,43 @@ +package Problem0318 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0318(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0319.bulb-switcher/README.md b/Algorithms/0319.bulb-switcher/README.md new file mode 100755 index 000000000..4c7c5d265 --- /dev/null +++ b/Algorithms/0319.bulb-switcher/README.md @@ -0,0 +1,11 @@ +# [319. Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0319.bulb-switcher/bulb-switcher.go b/Algorithms/0319.bulb-switcher/bulb-switcher.go new file mode 100755 index 000000000..3b54e505c --- /dev/null +++ b/Algorithms/0319.bulb-switcher/bulb-switcher.go @@ -0,0 +1,2 @@ +package Problem0319 + diff --git a/Algorithms/0319.bulb-switcher/bulb-switcher_test.go b/Algorithms/0319.bulb-switcher/bulb-switcher_test.go new file mode 100755 index 000000000..7b1e3362a --- /dev/null +++ b/Algorithms/0319.bulb-switcher/bulb-switcher_test.go @@ -0,0 +1,43 @@ +package Problem0319 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0319(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0320.generalized-abbreviation/README.md b/Algorithms/0320.generalized-abbreviation/README.md new file mode 100755 index 000000000..33c19a8f0 --- /dev/null +++ b/Algorithms/0320.generalized-abbreviation/README.md @@ -0,0 +1,11 @@ +# [320. Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0320.generalized-abbreviation/generalized-abbreviation.go b/Algorithms/0320.generalized-abbreviation/generalized-abbreviation.go new file mode 100755 index 000000000..97e8f6f94 --- /dev/null +++ b/Algorithms/0320.generalized-abbreviation/generalized-abbreviation.go @@ -0,0 +1,2 @@ +package Problem0320 + diff --git a/Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go b/Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go new file mode 100755 index 000000000..5b0a9df72 --- /dev/null +++ b/Algorithms/0320.generalized-abbreviation/generalized-abbreviation_test.go @@ -0,0 +1,43 @@ +package Problem0320 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0320(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0321.create-maximum-number/README.md b/Algorithms/0321.create-maximum-number/README.md new file mode 100755 index 000000000..3a8db62aa --- /dev/null +++ b/Algorithms/0321.create-maximum-number/README.md @@ -0,0 +1,11 @@ +# [321. Create Maximum Number](https://leetcode.com/problems/create-maximum-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0321.create-maximum-number/create-maximum-number.go b/Algorithms/0321.create-maximum-number/create-maximum-number.go new file mode 100755 index 000000000..d0eb205ef --- /dev/null +++ b/Algorithms/0321.create-maximum-number/create-maximum-number.go @@ -0,0 +1,2 @@ +package Problem0321 + diff --git a/Algorithms/0321.create-maximum-number/create-maximum-number_test.go b/Algorithms/0321.create-maximum-number/create-maximum-number_test.go new file mode 100755 index 000000000..d8500067d --- /dev/null +++ b/Algorithms/0321.create-maximum-number/create-maximum-number_test.go @@ -0,0 +1,43 @@ +package Problem0321 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0321(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0322.coin-change/README.md b/Algorithms/0322.coin-change/README.md new file mode 100755 index 000000000..c94228a38 --- /dev/null +++ b/Algorithms/0322.coin-change/README.md @@ -0,0 +1,11 @@ +# [322. Coin Change](https://leetcode.com/problems/coin-change/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0322.coin-change/coin-change.go b/Algorithms/0322.coin-change/coin-change.go new file mode 100755 index 000000000..470dc1cda --- /dev/null +++ b/Algorithms/0322.coin-change/coin-change.go @@ -0,0 +1,2 @@ +package Problem0322 + diff --git a/Algorithms/0322.coin-change/coin-change_test.go b/Algorithms/0322.coin-change/coin-change_test.go new file mode 100755 index 000000000..d36546759 --- /dev/null +++ b/Algorithms/0322.coin-change/coin-change_test.go @@ -0,0 +1,43 @@ +package Problem0322 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0322(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/README.md b/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/README.md new file mode 100755 index 000000000..1d713d1d9 --- /dev/null +++ b/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/README.md @@ -0,0 +1,11 @@ +# [323. Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph.go b/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph.go new file mode 100755 index 000000000..0679048a6 --- /dev/null +++ b/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph.go @@ -0,0 +1,2 @@ +package Problem0323 + 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 new file mode 100755 index 000000000..e870aca08 --- /dev/null +++ b/Algorithms/0323.number-of-connected-components-in-an-undirected-graph/number-of-connected-components-in-an-undirected-graph_test.go @@ -0,0 +1,43 @@ +package Problem0323 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0323(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0324.wiggle-sort-ii/README.md b/Algorithms/0324.wiggle-sort-ii/README.md new file mode 100755 index 000000000..cc3bb51cb --- /dev/null +++ b/Algorithms/0324.wiggle-sort-ii/README.md @@ -0,0 +1,11 @@ +# [324. Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii.go b/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii.go new file mode 100755 index 000000000..01e28e611 --- /dev/null +++ b/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii.go @@ -0,0 +1,2 @@ +package Problem0324 + diff --git a/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go b/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go new file mode 100755 index 000000000..05adbd19b --- /dev/null +++ b/Algorithms/0324.wiggle-sort-ii/wiggle-sort-ii_test.go @@ -0,0 +1,43 @@ +package Problem0324 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0324(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0325.maximum-size-subarray-sum-equals-k/README.md b/Algorithms/0325.maximum-size-subarray-sum-equals-k/README.md new file mode 100755 index 000000000..ccbaee08d --- /dev/null +++ b/Algorithms/0325.maximum-size-subarray-sum-equals-k/README.md @@ -0,0 +1,11 @@ +# [325. Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k.go b/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k.go new file mode 100755 index 000000000..8de9b5672 --- /dev/null +++ b/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k.go @@ -0,0 +1,2 @@ +package Problem0325 + 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 new file mode 100755 index 000000000..a1c10bcbb --- /dev/null +++ b/Algorithms/0325.maximum-size-subarray-sum-equals-k/maximum-size-subarray-sum-equals-k_test.go @@ -0,0 +1,43 @@ +package Problem0325 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0325(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0326.power-of-three/README.md b/Algorithms/0326.power-of-three/README.md new file mode 100755 index 000000000..c904f4caa --- /dev/null +++ b/Algorithms/0326.power-of-three/README.md @@ -0,0 +1,11 @@ +# [326. Power of Three](https://leetcode.com/problems/power-of-three/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0326.power-of-three/power-of-three.go b/Algorithms/0326.power-of-three/power-of-three.go new file mode 100755 index 000000000..6989c95d4 --- /dev/null +++ b/Algorithms/0326.power-of-three/power-of-three.go @@ -0,0 +1,2 @@ +package Problem0326 + diff --git a/Algorithms/0326.power-of-three/power-of-three_test.go b/Algorithms/0326.power-of-three/power-of-three_test.go new file mode 100755 index 000000000..2fa0c9cf5 --- /dev/null +++ b/Algorithms/0326.power-of-three/power-of-three_test.go @@ -0,0 +1,43 @@ +package Problem0326 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0326(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0327.count-of-range-sum/README.md b/Algorithms/0327.count-of-range-sum/README.md new file mode 100755 index 000000000..c0b1bd1a5 --- /dev/null +++ b/Algorithms/0327.count-of-range-sum/README.md @@ -0,0 +1,11 @@ +# [327. Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0327.count-of-range-sum/count-of-range-sum.go b/Algorithms/0327.count-of-range-sum/count-of-range-sum.go new file mode 100755 index 000000000..645116fc5 --- /dev/null +++ b/Algorithms/0327.count-of-range-sum/count-of-range-sum.go @@ -0,0 +1,2 @@ +package Problem0327 + 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 new file mode 100755 index 000000000..ec5268bc4 --- /dev/null +++ b/Algorithms/0327.count-of-range-sum/count-of-range-sum_test.go @@ -0,0 +1,43 @@ +package Problem0327 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0327(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0328.odd-even-linked-list/README.md b/Algorithms/0328.odd-even-linked-list/README.md new file mode 100755 index 000000000..ac87bab09 --- /dev/null +++ b/Algorithms/0328.odd-even-linked-list/README.md @@ -0,0 +1,11 @@ +# [328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0328.odd-even-linked-list/odd-even-linked-list.go b/Algorithms/0328.odd-even-linked-list/odd-even-linked-list.go new file mode 100755 index 000000000..e8fbcbb4f --- /dev/null +++ b/Algorithms/0328.odd-even-linked-list/odd-even-linked-list.go @@ -0,0 +1,2 @@ +package Problem0328 + 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 new file mode 100755 index 000000000..b79b01a50 --- /dev/null +++ b/Algorithms/0328.odd-even-linked-list/odd-even-linked-list_test.go @@ -0,0 +1,43 @@ +package Problem0328 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0328(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0329.longest-increasing-path-in-a-matrix/README.md b/Algorithms/0329.longest-increasing-path-in-a-matrix/README.md new file mode 100755 index 000000000..e57dbd043 --- /dev/null +++ b/Algorithms/0329.longest-increasing-path-in-a-matrix/README.md @@ -0,0 +1,11 @@ +# [329. Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix.go b/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix.go new file mode 100755 index 000000000..9e05d7bc6 --- /dev/null +++ b/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix.go @@ -0,0 +1,2 @@ +package Problem0329 + 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 new file mode 100755 index 000000000..8a27e2149 --- /dev/null +++ b/Algorithms/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix_test.go @@ -0,0 +1,43 @@ +package Problem0329 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0329(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0330.patching-array/README.md b/Algorithms/0330.patching-array/README.md new file mode 100755 index 000000000..1faf9eb3e --- /dev/null +++ b/Algorithms/0330.patching-array/README.md @@ -0,0 +1,11 @@ +# [330. Patching Array](https://leetcode.com/problems/patching-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0330.patching-array/patching-array.go b/Algorithms/0330.patching-array/patching-array.go new file mode 100755 index 000000000..fd1bba924 --- /dev/null +++ b/Algorithms/0330.patching-array/patching-array.go @@ -0,0 +1,2 @@ +package Problem0330 + diff --git a/Algorithms/0330.patching-array/patching-array_test.go b/Algorithms/0330.patching-array/patching-array_test.go new file mode 100755 index 000000000..176e6a5cb --- /dev/null +++ b/Algorithms/0330.patching-array/patching-array_test.go @@ -0,0 +1,43 @@ +package Problem0330 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0330(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/README.md b/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/README.md new file mode 100755 index 000000000..7a57403b0 --- /dev/null +++ b/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/README.md @@ -0,0 +1,11 @@ +# [331. Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree.go b/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree.go new file mode 100755 index 000000000..495962d9c --- /dev/null +++ b/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0331 + 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 new file mode 100755 index 000000000..ab52f2483 --- /dev/null +++ b/Algorithms/0331.verify-preorder-serialization-of-a-binary-tree/verify-preorder-serialization-of-a-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0331 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0331(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0332.reconstruct-itinerary/README.md b/Algorithms/0332.reconstruct-itinerary/README.md new file mode 100755 index 000000000..6017ff667 --- /dev/null +++ b/Algorithms/0332.reconstruct-itinerary/README.md @@ -0,0 +1,11 @@ +# [332. Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary.go b/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary.go new file mode 100755 index 000000000..cf745d739 --- /dev/null +++ b/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary.go @@ -0,0 +1,2 @@ +package Problem0332 + diff --git a/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go b/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go new file mode 100755 index 000000000..4f6aa3386 --- /dev/null +++ b/Algorithms/0332.reconstruct-itinerary/reconstruct-itinerary_test.go @@ -0,0 +1,43 @@ +package Problem0332 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0332(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0333.largest-bst-subtree/README.md b/Algorithms/0333.largest-bst-subtree/README.md new file mode 100755 index 000000000..5463627f9 --- /dev/null +++ b/Algorithms/0333.largest-bst-subtree/README.md @@ -0,0 +1,11 @@ +# [333. Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0333.largest-bst-subtree/largest-bst-subtree.go b/Algorithms/0333.largest-bst-subtree/largest-bst-subtree.go new file mode 100755 index 000000000..c77d4c6f2 --- /dev/null +++ b/Algorithms/0333.largest-bst-subtree/largest-bst-subtree.go @@ -0,0 +1,2 @@ +package Problem0333 + diff --git a/Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go b/Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go new file mode 100755 index 000000000..35513c0c8 --- /dev/null +++ b/Algorithms/0333.largest-bst-subtree/largest-bst-subtree_test.go @@ -0,0 +1,43 @@ +package Problem0333 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0333(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0334.increasing-triplet-subsequence/README.md b/Algorithms/0334.increasing-triplet-subsequence/README.md new file mode 100755 index 000000000..7cd0867c7 --- /dev/null +++ b/Algorithms/0334.increasing-triplet-subsequence/README.md @@ -0,0 +1,11 @@ +# [334. Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence.go b/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence.go new file mode 100755 index 000000000..bf7d22908 --- /dev/null +++ b/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence.go @@ -0,0 +1,2 @@ +package Problem0334 + diff --git a/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go b/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go new file mode 100755 index 000000000..03bb33b63 --- /dev/null +++ b/Algorithms/0334.increasing-triplet-subsequence/increasing-triplet-subsequence_test.go @@ -0,0 +1,43 @@ +package Problem0334 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0334(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0335.self-crossing/README.md b/Algorithms/0335.self-crossing/README.md new file mode 100755 index 000000000..78a245bc0 --- /dev/null +++ b/Algorithms/0335.self-crossing/README.md @@ -0,0 +1,11 @@ +# [335. Self Crossing](https://leetcode.com/problems/self-crossing/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0335.self-crossing/self-crossing.go b/Algorithms/0335.self-crossing/self-crossing.go new file mode 100755 index 000000000..b48b79922 --- /dev/null +++ b/Algorithms/0335.self-crossing/self-crossing.go @@ -0,0 +1,2 @@ +package Problem0335 + diff --git a/Algorithms/0335.self-crossing/self-crossing_test.go b/Algorithms/0335.self-crossing/self-crossing_test.go new file mode 100755 index 000000000..12218eaec --- /dev/null +++ b/Algorithms/0335.self-crossing/self-crossing_test.go @@ -0,0 +1,43 @@ +package Problem0335 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0335(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0336.palindrome-pairs/README.md b/Algorithms/0336.palindrome-pairs/README.md new file mode 100755 index 000000000..1640a3224 --- /dev/null +++ b/Algorithms/0336.palindrome-pairs/README.md @@ -0,0 +1,11 @@ +# [336. Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0336.palindrome-pairs/palindrome-pairs.go b/Algorithms/0336.palindrome-pairs/palindrome-pairs.go new file mode 100755 index 000000000..2a60deeec --- /dev/null +++ b/Algorithms/0336.palindrome-pairs/palindrome-pairs.go @@ -0,0 +1,2 @@ +package Problem0336 + diff --git a/Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go b/Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go new file mode 100755 index 000000000..31582de92 --- /dev/null +++ b/Algorithms/0336.palindrome-pairs/palindrome-pairs_test.go @@ -0,0 +1,43 @@ +package Problem0336 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0336(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0337.house-robber-iii/README.md b/Algorithms/0337.house-robber-iii/README.md new file mode 100755 index 000000000..7d375fe23 --- /dev/null +++ b/Algorithms/0337.house-robber-iii/README.md @@ -0,0 +1,11 @@ +# [337. House Robber III](https://leetcode.com/problems/house-robber-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0337.house-robber-iii/house-robber-iii.go b/Algorithms/0337.house-robber-iii/house-robber-iii.go new file mode 100755 index 000000000..2c40e3c33 --- /dev/null +++ b/Algorithms/0337.house-robber-iii/house-robber-iii.go @@ -0,0 +1,2 @@ +package Problem0337 + diff --git a/Algorithms/0337.house-robber-iii/house-robber-iii_test.go b/Algorithms/0337.house-robber-iii/house-robber-iii_test.go new file mode 100755 index 000000000..0455100ea --- /dev/null +++ b/Algorithms/0337.house-robber-iii/house-robber-iii_test.go @@ -0,0 +1,43 @@ +package Problem0337 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0337(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0338.counting-bits/README.md b/Algorithms/0338.counting-bits/README.md new file mode 100755 index 000000000..ed5a1367d --- /dev/null +++ b/Algorithms/0338.counting-bits/README.md @@ -0,0 +1,11 @@ +# [338. Counting Bits](https://leetcode.com/problems/counting-bits/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0338.counting-bits/counting-bits.go b/Algorithms/0338.counting-bits/counting-bits.go new file mode 100755 index 000000000..64040b9c4 --- /dev/null +++ b/Algorithms/0338.counting-bits/counting-bits.go @@ -0,0 +1,2 @@ +package Problem0338 + diff --git a/Algorithms/0338.counting-bits/counting-bits_test.go b/Algorithms/0338.counting-bits/counting-bits_test.go new file mode 100755 index 000000000..6a6bf4ff0 --- /dev/null +++ b/Algorithms/0338.counting-bits/counting-bits_test.go @@ -0,0 +1,43 @@ +package Problem0338 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0338(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0339.nested-list-weight-sum/README.md b/Algorithms/0339.nested-list-weight-sum/README.md new file mode 100755 index 000000000..c7b11fd8d --- /dev/null +++ b/Algorithms/0339.nested-list-weight-sum/README.md @@ -0,0 +1,11 @@ +# [339. Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum.go b/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum.go new file mode 100755 index 000000000..419aac17c --- /dev/null +++ b/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum.go @@ -0,0 +1,2 @@ +package Problem0339 + 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 new file mode 100755 index 000000000..a7b6812e4 --- /dev/null +++ b/Algorithms/0339.nested-list-weight-sum/nested-list-weight-sum_test.go @@ -0,0 +1,43 @@ +package Problem0339 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0339(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/README.md b/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/README.md new file mode 100755 index 000000000..739099f2c --- /dev/null +++ b/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/README.md @@ -0,0 +1,11 @@ +# [340. Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters.go b/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters.go new file mode 100755 index 000000000..f977bbf28 --- /dev/null +++ b/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters.go @@ -0,0 +1,2 @@ +package Problem0340 + 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 new file mode 100755 index 000000000..17c75abcb --- /dev/null +++ b/Algorithms/0340.longest-substring-with-at-most-k-distinct-characters/longest-substring-with-at-most-k-distinct-characters_test.go @@ -0,0 +1,43 @@ +package Problem0340 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0340(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0341.flatten-nested-list-iterator/README.md b/Algorithms/0341.flatten-nested-list-iterator/README.md new file mode 100755 index 000000000..cba3923b4 --- /dev/null +++ b/Algorithms/0341.flatten-nested-list-iterator/README.md @@ -0,0 +1,11 @@ +# [341. Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator.go b/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator.go new file mode 100755 index 000000000..0f646c723 --- /dev/null +++ b/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator.go @@ -0,0 +1,2 @@ +package Problem0341 + 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 new file mode 100755 index 000000000..48e244b13 --- /dev/null +++ b/Algorithms/0341.flatten-nested-list-iterator/flatten-nested-list-iterator_test.go @@ -0,0 +1,43 @@ +package Problem0341 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0341(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0342.power-of-four/README.md b/Algorithms/0342.power-of-four/README.md new file mode 100755 index 000000000..b5f3ed90d --- /dev/null +++ b/Algorithms/0342.power-of-four/README.md @@ -0,0 +1,11 @@ +# [342. Power of Four](https://leetcode.com/problems/power-of-four/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0342.power-of-four/power-of-four.go b/Algorithms/0342.power-of-four/power-of-four.go new file mode 100755 index 000000000..62d78590d --- /dev/null +++ b/Algorithms/0342.power-of-four/power-of-four.go @@ -0,0 +1,2 @@ +package Problem0342 + diff --git a/Algorithms/0342.power-of-four/power-of-four_test.go b/Algorithms/0342.power-of-four/power-of-four_test.go new file mode 100755 index 000000000..76077b47a --- /dev/null +++ b/Algorithms/0342.power-of-four/power-of-four_test.go @@ -0,0 +1,43 @@ +package Problem0342 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0342(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0343.integer-break/README.md b/Algorithms/0343.integer-break/README.md new file mode 100755 index 000000000..603f75bb3 --- /dev/null +++ b/Algorithms/0343.integer-break/README.md @@ -0,0 +1,11 @@ +# [343. Integer Break](https://leetcode.com/problems/integer-break/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0343.integer-break/integer-break.go b/Algorithms/0343.integer-break/integer-break.go new file mode 100755 index 000000000..7bc22dc45 --- /dev/null +++ b/Algorithms/0343.integer-break/integer-break.go @@ -0,0 +1,2 @@ +package Problem0343 + diff --git a/Algorithms/0343.integer-break/integer-break_test.go b/Algorithms/0343.integer-break/integer-break_test.go new file mode 100755 index 000000000..0f1ab9e9f --- /dev/null +++ b/Algorithms/0343.integer-break/integer-break_test.go @@ -0,0 +1,43 @@ +package Problem0343 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0343(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0344.reverse-string/README.md b/Algorithms/0344.reverse-string/README.md new file mode 100755 index 000000000..f1153c10c --- /dev/null +++ b/Algorithms/0344.reverse-string/README.md @@ -0,0 +1,11 @@ +# [344. Reverse String](https://leetcode.com/problems/reverse-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0344.reverse-string/reverse-string.go b/Algorithms/0344.reverse-string/reverse-string.go new file mode 100755 index 000000000..e3d2e8198 --- /dev/null +++ b/Algorithms/0344.reverse-string/reverse-string.go @@ -0,0 +1,2 @@ +package Problem0344 + diff --git a/Algorithms/0344.reverse-string/reverse-string_test.go b/Algorithms/0344.reverse-string/reverse-string_test.go new file mode 100755 index 000000000..2252c591d --- /dev/null +++ b/Algorithms/0344.reverse-string/reverse-string_test.go @@ -0,0 +1,43 @@ +package Problem0344 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0344(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0345.reverse-vowels-of-a-string/README.md b/Algorithms/0345.reverse-vowels-of-a-string/README.md new file mode 100755 index 000000000..8a44ae6e9 --- /dev/null +++ b/Algorithms/0345.reverse-vowels-of-a-string/README.md @@ -0,0 +1,11 @@ +# [345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string.go b/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string.go new file mode 100755 index 000000000..eb5e2898d --- /dev/null +++ b/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string.go @@ -0,0 +1,2 @@ +package Problem0345 + 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 new file mode 100755 index 000000000..88f3b694f --- /dev/null +++ b/Algorithms/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string_test.go @@ -0,0 +1,43 @@ +package Problem0345 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0345(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0346.moving-average-from-data-stream/README.md b/Algorithms/0346.moving-average-from-data-stream/README.md new file mode 100755 index 000000000..fda2391ca --- /dev/null +++ b/Algorithms/0346.moving-average-from-data-stream/README.md @@ -0,0 +1,11 @@ +# [346. Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream.go b/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream.go new file mode 100755 index 000000000..cf2717cad --- /dev/null +++ b/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream.go @@ -0,0 +1,2 @@ +package Problem0346 + 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 new file mode 100755 index 000000000..1a9443f43 --- /dev/null +++ b/Algorithms/0346.moving-average-from-data-stream/moving-average-from-data-stream_test.go @@ -0,0 +1,43 @@ +package Problem0346 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0346(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0347.top-k-frequent-elements/README.md b/Algorithms/0347.top-k-frequent-elements/README.md new file mode 100755 index 000000000..f68cba58d --- /dev/null +++ b/Algorithms/0347.top-k-frequent-elements/README.md @@ -0,0 +1,11 @@ +# [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements.go b/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements.go new file mode 100755 index 000000000..d3e608db4 --- /dev/null +++ b/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements.go @@ -0,0 +1,2 @@ +package Problem0347 + 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 new file mode 100755 index 000000000..c7574449a --- /dev/null +++ b/Algorithms/0347.top-k-frequent-elements/top-k-frequent-elements_test.go @@ -0,0 +1,43 @@ +package Problem0347 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0347(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0348.design-tic-tac-toe/README.md b/Algorithms/0348.design-tic-tac-toe/README.md new file mode 100755 index 000000000..6c4a74459 --- /dev/null +++ b/Algorithms/0348.design-tic-tac-toe/README.md @@ -0,0 +1,11 @@ +# [348. Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe.go b/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe.go new file mode 100755 index 000000000..048e03638 --- /dev/null +++ b/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe.go @@ -0,0 +1,2 @@ +package Problem0348 + 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 new file mode 100755 index 000000000..d10b8062a --- /dev/null +++ b/Algorithms/0348.design-tic-tac-toe/design-tic-tac-toe_test.go @@ -0,0 +1,43 @@ +package Problem0348 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0348(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0349.intersection-of-two-arrays/README.md b/Algorithms/0349.intersection-of-two-arrays/README.md new file mode 100755 index 000000000..659befacc --- /dev/null +++ b/Algorithms/0349.intersection-of-two-arrays/README.md @@ -0,0 +1,11 @@ +# [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays.go b/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays.go new file mode 100755 index 000000000..db7133c04 --- /dev/null +++ b/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays.go @@ -0,0 +1,2 @@ +package Problem0349 + 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 new file mode 100755 index 000000000..1dafe2b81 --- /dev/null +++ b/Algorithms/0349.intersection-of-two-arrays/intersection-of-two-arrays_test.go @@ -0,0 +1,43 @@ +package Problem0349 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0349(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0350.intersection-of-two-arrays-ii/README.md b/Algorithms/0350.intersection-of-two-arrays-ii/README.md new file mode 100755 index 000000000..66920e166 --- /dev/null +++ b/Algorithms/0350.intersection-of-two-arrays-ii/README.md @@ -0,0 +1,11 @@ +# [350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.go b/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.go new file mode 100755 index 000000000..6a17bdb3b --- /dev/null +++ b/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.go @@ -0,0 +1,2 @@ +package Problem0350 + 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 new file mode 100755 index 000000000..ec4a2a802 --- /dev/null +++ b/Algorithms/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii_test.go @@ -0,0 +1,43 @@ +package Problem0350 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0350(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0351.android-unlock-patterns/README.md b/Algorithms/0351.android-unlock-patterns/README.md new file mode 100755 index 000000000..daa0ceb7b --- /dev/null +++ b/Algorithms/0351.android-unlock-patterns/README.md @@ -0,0 +1,11 @@ +# [351. Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0351.android-unlock-patterns/android-unlock-patterns.go b/Algorithms/0351.android-unlock-patterns/android-unlock-patterns.go new file mode 100755 index 000000000..2a47ecc9f --- /dev/null +++ b/Algorithms/0351.android-unlock-patterns/android-unlock-patterns.go @@ -0,0 +1,2 @@ +package Problem0351 + diff --git a/Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go b/Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go new file mode 100755 index 000000000..92c548f27 --- /dev/null +++ b/Algorithms/0351.android-unlock-patterns/android-unlock-patterns_test.go @@ -0,0 +1,43 @@ +package Problem0351 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0351(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0352.data-stream-as-disjoint-intervals/README.md b/Algorithms/0352.data-stream-as-disjoint-intervals/README.md new file mode 100755 index 000000000..ff19d21a9 --- /dev/null +++ b/Algorithms/0352.data-stream-as-disjoint-intervals/README.md @@ -0,0 +1,11 @@ +# [352. Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals.go b/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals.go new file mode 100755 index 000000000..66f12abf7 --- /dev/null +++ b/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals.go @@ -0,0 +1,2 @@ +package Problem0352 + 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 new file mode 100755 index 000000000..03f2720c9 --- /dev/null +++ b/Algorithms/0352.data-stream-as-disjoint-intervals/data-stream-as-disjoint-intervals_test.go @@ -0,0 +1,43 @@ +package Problem0352 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0352(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0353.design-snake-game/README.md b/Algorithms/0353.design-snake-game/README.md new file mode 100755 index 000000000..950f1d7fd --- /dev/null +++ b/Algorithms/0353.design-snake-game/README.md @@ -0,0 +1,11 @@ +# [353. Design Snake Game](https://leetcode.com/problems/design-snake-game/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0353.design-snake-game/design-snake-game.go b/Algorithms/0353.design-snake-game/design-snake-game.go new file mode 100755 index 000000000..657810f43 --- /dev/null +++ b/Algorithms/0353.design-snake-game/design-snake-game.go @@ -0,0 +1,2 @@ +package Problem0353 + diff --git a/Algorithms/0353.design-snake-game/design-snake-game_test.go b/Algorithms/0353.design-snake-game/design-snake-game_test.go new file mode 100755 index 000000000..8885dbc57 --- /dev/null +++ b/Algorithms/0353.design-snake-game/design-snake-game_test.go @@ -0,0 +1,43 @@ +package Problem0353 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0353(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0354.russian-doll-envelopes/README.md b/Algorithms/0354.russian-doll-envelopes/README.md new file mode 100755 index 000000000..b8e7f1742 --- /dev/null +++ b/Algorithms/0354.russian-doll-envelopes/README.md @@ -0,0 +1,11 @@ +# [354. Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes.go b/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes.go new file mode 100755 index 000000000..7ebd79bab --- /dev/null +++ b/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes.go @@ -0,0 +1,2 @@ +package Problem0354 + diff --git a/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go b/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go new file mode 100755 index 000000000..47ed39a7d --- /dev/null +++ b/Algorithms/0354.russian-doll-envelopes/russian-doll-envelopes_test.go @@ -0,0 +1,43 @@ +package Problem0354 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0354(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0355.design-twitter/README.md b/Algorithms/0355.design-twitter/README.md new file mode 100755 index 000000000..05c3d419b --- /dev/null +++ b/Algorithms/0355.design-twitter/README.md @@ -0,0 +1,11 @@ +# [355. Design Twitter](https://leetcode.com/problems/design-twitter/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0355.design-twitter/design-twitter.go b/Algorithms/0355.design-twitter/design-twitter.go new file mode 100755 index 000000000..91641e2cb --- /dev/null +++ b/Algorithms/0355.design-twitter/design-twitter.go @@ -0,0 +1,2 @@ +package Problem0355 + diff --git a/Algorithms/0355.design-twitter/design-twitter_test.go b/Algorithms/0355.design-twitter/design-twitter_test.go new file mode 100755 index 000000000..337800ad8 --- /dev/null +++ b/Algorithms/0355.design-twitter/design-twitter_test.go @@ -0,0 +1,43 @@ +package Problem0355 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0355(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0356.line-reflection/README.md b/Algorithms/0356.line-reflection/README.md new file mode 100755 index 000000000..40040357e --- /dev/null +++ b/Algorithms/0356.line-reflection/README.md @@ -0,0 +1,11 @@ +# [356. Line Reflection](https://leetcode.com/problems/line-reflection/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0356.line-reflection/line-reflection.go b/Algorithms/0356.line-reflection/line-reflection.go new file mode 100755 index 000000000..8ba896537 --- /dev/null +++ b/Algorithms/0356.line-reflection/line-reflection.go @@ -0,0 +1,2 @@ +package Problem0356 + diff --git a/Algorithms/0356.line-reflection/line-reflection_test.go b/Algorithms/0356.line-reflection/line-reflection_test.go new file mode 100755 index 000000000..7dc7a762d --- /dev/null +++ b/Algorithms/0356.line-reflection/line-reflection_test.go @@ -0,0 +1,43 @@ +package Problem0356 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0356(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0357.count-numbers-with-unique-digits/README.md b/Algorithms/0357.count-numbers-with-unique-digits/README.md new file mode 100755 index 000000000..b998c64ca --- /dev/null +++ b/Algorithms/0357.count-numbers-with-unique-digits/README.md @@ -0,0 +1,11 @@ +# [357. Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits.go b/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits.go new file mode 100755 index 000000000..3e2e4ada5 --- /dev/null +++ b/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits.go @@ -0,0 +1,2 @@ +package Problem0357 + 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 new file mode 100755 index 000000000..65ee5de49 --- /dev/null +++ b/Algorithms/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits_test.go @@ -0,0 +1,43 @@ +package Problem0357 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0357(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0358.rearrange-string-k-distance-apart/README.md b/Algorithms/0358.rearrange-string-k-distance-apart/README.md new file mode 100755 index 000000000..2f77ceb43 --- /dev/null +++ b/Algorithms/0358.rearrange-string-k-distance-apart/README.md @@ -0,0 +1,11 @@ +# [358. Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart.go b/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart.go new file mode 100755 index 000000000..c8e08bd22 --- /dev/null +++ b/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart.go @@ -0,0 +1,2 @@ +package Problem0358 + 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 new file mode 100755 index 000000000..7e94abf61 --- /dev/null +++ b/Algorithms/0358.rearrange-string-k-distance-apart/rearrange-string-k-distance-apart_test.go @@ -0,0 +1,43 @@ +package Problem0358 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0358(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0359.logger-rate-limiter/README.md b/Algorithms/0359.logger-rate-limiter/README.md new file mode 100755 index 000000000..9e2160a59 --- /dev/null +++ b/Algorithms/0359.logger-rate-limiter/README.md @@ -0,0 +1,11 @@ +# [359. Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0359.logger-rate-limiter/logger-rate-limiter.go b/Algorithms/0359.logger-rate-limiter/logger-rate-limiter.go new file mode 100755 index 000000000..1de4b2a40 --- /dev/null +++ b/Algorithms/0359.logger-rate-limiter/logger-rate-limiter.go @@ -0,0 +1,2 @@ +package Problem0359 + diff --git a/Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go b/Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go new file mode 100755 index 000000000..dd206f593 --- /dev/null +++ b/Algorithms/0359.logger-rate-limiter/logger-rate-limiter_test.go @@ -0,0 +1,43 @@ +package Problem0359 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0359(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0360.sort-transformed-array/README.md b/Algorithms/0360.sort-transformed-array/README.md new file mode 100755 index 000000000..a1d4308f3 --- /dev/null +++ b/Algorithms/0360.sort-transformed-array/README.md @@ -0,0 +1,11 @@ +# [360. Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0360.sort-transformed-array/sort-transformed-array.go b/Algorithms/0360.sort-transformed-array/sort-transformed-array.go new file mode 100755 index 000000000..134c17a88 --- /dev/null +++ b/Algorithms/0360.sort-transformed-array/sort-transformed-array.go @@ -0,0 +1,2 @@ +package Problem0360 + diff --git a/Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go b/Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go new file mode 100755 index 000000000..8e6a56039 --- /dev/null +++ b/Algorithms/0360.sort-transformed-array/sort-transformed-array_test.go @@ -0,0 +1,43 @@ +package Problem0360 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0360(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0361.bomb-enemy/README.md b/Algorithms/0361.bomb-enemy/README.md new file mode 100755 index 000000000..e1929cfe3 --- /dev/null +++ b/Algorithms/0361.bomb-enemy/README.md @@ -0,0 +1,11 @@ +# [361. Bomb Enemy](https://leetcode.com/problems/bomb-enemy/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0361.bomb-enemy/bomb-enemy.go b/Algorithms/0361.bomb-enemy/bomb-enemy.go new file mode 100755 index 000000000..e813d71ce --- /dev/null +++ b/Algorithms/0361.bomb-enemy/bomb-enemy.go @@ -0,0 +1,2 @@ +package Problem0361 + diff --git a/Algorithms/0361.bomb-enemy/bomb-enemy_test.go b/Algorithms/0361.bomb-enemy/bomb-enemy_test.go new file mode 100755 index 000000000..c75bdffd9 --- /dev/null +++ b/Algorithms/0361.bomb-enemy/bomb-enemy_test.go @@ -0,0 +1,43 @@ +package Problem0361 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0361(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0362.design-hit-counter/README.md b/Algorithms/0362.design-hit-counter/README.md new file mode 100755 index 000000000..ea24b420d --- /dev/null +++ b/Algorithms/0362.design-hit-counter/README.md @@ -0,0 +1,11 @@ +# [362. Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0362.design-hit-counter/design-hit-counter.go b/Algorithms/0362.design-hit-counter/design-hit-counter.go new file mode 100755 index 000000000..c095b589a --- /dev/null +++ b/Algorithms/0362.design-hit-counter/design-hit-counter.go @@ -0,0 +1,2 @@ +package Problem0362 + diff --git a/Algorithms/0362.design-hit-counter/design-hit-counter_test.go b/Algorithms/0362.design-hit-counter/design-hit-counter_test.go new file mode 100755 index 000000000..b40067491 --- /dev/null +++ b/Algorithms/0362.design-hit-counter/design-hit-counter_test.go @@ -0,0 +1,43 @@ +package Problem0362 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0362(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/README.md b/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/README.md new file mode 100755 index 000000000..d3d5c1029 --- /dev/null +++ b/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/README.md @@ -0,0 +1,11 @@ +# [363. Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k.go b/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k.go new file mode 100755 index 000000000..5d1555ce2 --- /dev/null +++ b/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k.go @@ -0,0 +1,2 @@ +package Problem0363 + 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 new file mode 100755 index 000000000..79c0b3edb --- /dev/null +++ b/Algorithms/0363.max-sum-of-rectangle-no-larger-than-k/max-sum-of-rectangle-no-larger-than-k_test.go @@ -0,0 +1,43 @@ +package Problem0363 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0363(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0364.nested-list-weight-sum-ii/README.md b/Algorithms/0364.nested-list-weight-sum-ii/README.md new file mode 100755 index 000000000..ff23e90cc --- /dev/null +++ b/Algorithms/0364.nested-list-weight-sum-ii/README.md @@ -0,0 +1,11 @@ +# [364. Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii.go b/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii.go new file mode 100755 index 000000000..80c6c0ad3 --- /dev/null +++ b/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii.go @@ -0,0 +1,2 @@ +package Problem0364 + 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 new file mode 100755 index 000000000..91c2ec5b5 --- /dev/null +++ b/Algorithms/0364.nested-list-weight-sum-ii/nested-list-weight-sum-ii_test.go @@ -0,0 +1,43 @@ +package Problem0364 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0364(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0365.water-and-jug-problem/README.md b/Algorithms/0365.water-and-jug-problem/README.md new file mode 100755 index 000000000..9de589939 --- /dev/null +++ b/Algorithms/0365.water-and-jug-problem/README.md @@ -0,0 +1,11 @@ +# [365. Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0365.water-and-jug-problem/water-and-jug-problem.go b/Algorithms/0365.water-and-jug-problem/water-and-jug-problem.go new file mode 100755 index 000000000..7a070ebe1 --- /dev/null +++ b/Algorithms/0365.water-and-jug-problem/water-and-jug-problem.go @@ -0,0 +1,2 @@ +package Problem0365 + 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 new file mode 100755 index 000000000..4d818eeea --- /dev/null +++ b/Algorithms/0365.water-and-jug-problem/water-and-jug-problem_test.go @@ -0,0 +1,43 @@ +package Problem0365 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0365(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0366.find-leaves-of-binary-tree/README.md b/Algorithms/0366.find-leaves-of-binary-tree/README.md new file mode 100755 index 000000000..a2f535011 --- /dev/null +++ b/Algorithms/0366.find-leaves-of-binary-tree/README.md @@ -0,0 +1,11 @@ +# [366. Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree.go b/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree.go new file mode 100755 index 000000000..740f72369 --- /dev/null +++ b/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0366 + 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 new file mode 100755 index 000000000..2e1129ceb --- /dev/null +++ b/Algorithms/0366.find-leaves-of-binary-tree/find-leaves-of-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0366 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0366(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0367.valid-perfect-square/README.md b/Algorithms/0367.valid-perfect-square/README.md new file mode 100755 index 000000000..ab4a037a1 --- /dev/null +++ b/Algorithms/0367.valid-perfect-square/README.md @@ -0,0 +1,11 @@ +# [367. Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0367.valid-perfect-square/valid-perfect-square.go b/Algorithms/0367.valid-perfect-square/valid-perfect-square.go new file mode 100755 index 000000000..fe0899b77 --- /dev/null +++ b/Algorithms/0367.valid-perfect-square/valid-perfect-square.go @@ -0,0 +1,2 @@ +package Problem0367 + diff --git a/Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go b/Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go new file mode 100755 index 000000000..00b36c000 --- /dev/null +++ b/Algorithms/0367.valid-perfect-square/valid-perfect-square_test.go @@ -0,0 +1,43 @@ +package Problem0367 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0367(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0368.largest-divisible-subset/README.md b/Algorithms/0368.largest-divisible-subset/README.md new file mode 100755 index 000000000..b32421891 --- /dev/null +++ b/Algorithms/0368.largest-divisible-subset/README.md @@ -0,0 +1,11 @@ +# [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0368.largest-divisible-subset/largest-divisible-subset.go b/Algorithms/0368.largest-divisible-subset/largest-divisible-subset.go new file mode 100755 index 000000000..a47497c54 --- /dev/null +++ b/Algorithms/0368.largest-divisible-subset/largest-divisible-subset.go @@ -0,0 +1,2 @@ +package Problem0368 + diff --git a/Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go b/Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go new file mode 100755 index 000000000..1423788c5 --- /dev/null +++ b/Algorithms/0368.largest-divisible-subset/largest-divisible-subset_test.go @@ -0,0 +1,43 @@ +package Problem0368 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0368(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0369.plus-one-linked-list/README.md b/Algorithms/0369.plus-one-linked-list/README.md new file mode 100755 index 000000000..6f5c630da --- /dev/null +++ b/Algorithms/0369.plus-one-linked-list/README.md @@ -0,0 +1,11 @@ +# [369. Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0369.plus-one-linked-list/plus-one-linked-list.go b/Algorithms/0369.plus-one-linked-list/plus-one-linked-list.go new file mode 100755 index 000000000..6675c2551 --- /dev/null +++ b/Algorithms/0369.plus-one-linked-list/plus-one-linked-list.go @@ -0,0 +1,2 @@ +package Problem0369 + 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 new file mode 100755 index 000000000..4d44c9642 --- /dev/null +++ b/Algorithms/0369.plus-one-linked-list/plus-one-linked-list_test.go @@ -0,0 +1,43 @@ +package Problem0369 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0369(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0370.range-addition/README.md b/Algorithms/0370.range-addition/README.md new file mode 100755 index 000000000..787651b19 --- /dev/null +++ b/Algorithms/0370.range-addition/README.md @@ -0,0 +1,11 @@ +# [370. Range Addition](https://leetcode.com/problems/range-addition/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0370.range-addition/range-addition.go b/Algorithms/0370.range-addition/range-addition.go new file mode 100755 index 000000000..64c681041 --- /dev/null +++ b/Algorithms/0370.range-addition/range-addition.go @@ -0,0 +1,2 @@ +package Problem0370 + diff --git a/Algorithms/0370.range-addition/range-addition_test.go b/Algorithms/0370.range-addition/range-addition_test.go new file mode 100755 index 000000000..146f828ae --- /dev/null +++ b/Algorithms/0370.range-addition/range-addition_test.go @@ -0,0 +1,43 @@ +package Problem0370 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0370(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0371.sum-of-two-integers/README.md b/Algorithms/0371.sum-of-two-integers/README.md new file mode 100755 index 000000000..f8ac992a1 --- /dev/null +++ b/Algorithms/0371.sum-of-two-integers/README.md @@ -0,0 +1,11 @@ +# [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0371.sum-of-two-integers/sum-of-two-integers.go b/Algorithms/0371.sum-of-two-integers/sum-of-two-integers.go new file mode 100755 index 000000000..e92500eec --- /dev/null +++ b/Algorithms/0371.sum-of-two-integers/sum-of-two-integers.go @@ -0,0 +1,2 @@ +package Problem0371 + 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 new file mode 100755 index 000000000..c2d983d70 --- /dev/null +++ b/Algorithms/0371.sum-of-two-integers/sum-of-two-integers_test.go @@ -0,0 +1,43 @@ +package Problem0371 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0371(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0372.super-pow/README.md b/Algorithms/0372.super-pow/README.md new file mode 100755 index 000000000..9fe42d657 --- /dev/null +++ b/Algorithms/0372.super-pow/README.md @@ -0,0 +1,11 @@ +# [372. Super Pow](https://leetcode.com/problems/super-pow/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0372.super-pow/super-pow.go b/Algorithms/0372.super-pow/super-pow.go new file mode 100755 index 000000000..e50bb64f8 --- /dev/null +++ b/Algorithms/0372.super-pow/super-pow.go @@ -0,0 +1,2 @@ +package Problem0372 + diff --git a/Algorithms/0372.super-pow/super-pow_test.go b/Algorithms/0372.super-pow/super-pow_test.go new file mode 100755 index 000000000..4713e6d81 --- /dev/null +++ b/Algorithms/0372.super-pow/super-pow_test.go @@ -0,0 +1,43 @@ +package Problem0372 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0372(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0373.find-k-pairs-with-smallest-sums/README.md b/Algorithms/0373.find-k-pairs-with-smallest-sums/README.md new file mode 100755 index 000000000..369740e2b --- /dev/null +++ b/Algorithms/0373.find-k-pairs-with-smallest-sums/README.md @@ -0,0 +1,11 @@ +# [373. Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums.go b/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums.go new file mode 100755 index 000000000..d9c18f915 --- /dev/null +++ b/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums.go @@ -0,0 +1,2 @@ +package Problem0373 + 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 new file mode 100755 index 000000000..5f50d25fa --- /dev/null +++ b/Algorithms/0373.find-k-pairs-with-smallest-sums/find-k-pairs-with-smallest-sums_test.go @@ -0,0 +1,43 @@ +package Problem0373 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0373(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0374.guess-number-higher-or-lower/README.md b/Algorithms/0374.guess-number-higher-or-lower/README.md new file mode 100755 index 000000000..b03b9a802 --- /dev/null +++ b/Algorithms/0374.guess-number-higher-or-lower/README.md @@ -0,0 +1,11 @@ +# [374. Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower.go b/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower.go new file mode 100755 index 000000000..17a165e9a --- /dev/null +++ b/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower.go @@ -0,0 +1,2 @@ +package Problem0374 + 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 new file mode 100755 index 000000000..eece7c2d9 --- /dev/null +++ b/Algorithms/0374.guess-number-higher-or-lower/guess-number-higher-or-lower_test.go @@ -0,0 +1,43 @@ +package Problem0374 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0374(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0375.guess-number-higher-or-lower-ii/README.md b/Algorithms/0375.guess-number-higher-or-lower-ii/README.md new file mode 100755 index 000000000..90ba7cba8 --- /dev/null +++ b/Algorithms/0375.guess-number-higher-or-lower-ii/README.md @@ -0,0 +1,11 @@ +# [375. Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii.go b/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii.go new file mode 100755 index 000000000..b2c882857 --- /dev/null +++ b/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii.go @@ -0,0 +1,2 @@ +package Problem0375 + 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 new file mode 100755 index 000000000..4a5ca483c --- /dev/null +++ b/Algorithms/0375.guess-number-higher-or-lower-ii/guess-number-higher-or-lower-ii_test.go @@ -0,0 +1,43 @@ +package Problem0375 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0375(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0376.wiggle-subsequence/README.md b/Algorithms/0376.wiggle-subsequence/README.md new file mode 100755 index 000000000..cfe0fdd6e --- /dev/null +++ b/Algorithms/0376.wiggle-subsequence/README.md @@ -0,0 +1,11 @@ +# [376. Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0376.wiggle-subsequence/wiggle-subsequence.go b/Algorithms/0376.wiggle-subsequence/wiggle-subsequence.go new file mode 100755 index 000000000..b7f400dc5 --- /dev/null +++ b/Algorithms/0376.wiggle-subsequence/wiggle-subsequence.go @@ -0,0 +1,2 @@ +package Problem0376 + diff --git a/Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go b/Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go new file mode 100755 index 000000000..185d04c46 --- /dev/null +++ b/Algorithms/0376.wiggle-subsequence/wiggle-subsequence_test.go @@ -0,0 +1,43 @@ +package Problem0376 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0376(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0377.combination-sum-iv/README.md b/Algorithms/0377.combination-sum-iv/README.md new file mode 100755 index 000000000..9bcb64d37 --- /dev/null +++ b/Algorithms/0377.combination-sum-iv/README.md @@ -0,0 +1,11 @@ +# [377. Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0377.combination-sum-iv/combination-sum-iv.go b/Algorithms/0377.combination-sum-iv/combination-sum-iv.go new file mode 100755 index 000000000..ad7481584 --- /dev/null +++ b/Algorithms/0377.combination-sum-iv/combination-sum-iv.go @@ -0,0 +1,2 @@ +package Problem0377 + diff --git a/Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go b/Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go new file mode 100755 index 000000000..4b4a858d9 --- /dev/null +++ b/Algorithms/0377.combination-sum-iv/combination-sum-iv_test.go @@ -0,0 +1,43 @@ +package Problem0377 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0377(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/README.md b/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/README.md new file mode 100755 index 000000000..e9c69dab4 --- /dev/null +++ b/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/README.md @@ -0,0 +1,11 @@ +# [378. Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix.go b/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix.go new file mode 100755 index 000000000..cbd5a3742 --- /dev/null +++ b/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix.go @@ -0,0 +1,2 @@ +package Problem0378 + 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 new file mode 100755 index 000000000..bd1bc42d8 --- /dev/null +++ b/Algorithms/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix_test.go @@ -0,0 +1,43 @@ +package Problem0378 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0378(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0379.design-phone-directory/README.md b/Algorithms/0379.design-phone-directory/README.md new file mode 100755 index 000000000..df49d45d3 --- /dev/null +++ b/Algorithms/0379.design-phone-directory/README.md @@ -0,0 +1,11 @@ +# [379. Design Phone Directory](https://leetcode.com/problems/design-phone-directory/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0379.design-phone-directory/design-phone-directory.go b/Algorithms/0379.design-phone-directory/design-phone-directory.go new file mode 100755 index 000000000..030271710 --- /dev/null +++ b/Algorithms/0379.design-phone-directory/design-phone-directory.go @@ -0,0 +1,2 @@ +package Problem0379 + diff --git a/Algorithms/0379.design-phone-directory/design-phone-directory_test.go b/Algorithms/0379.design-phone-directory/design-phone-directory_test.go new file mode 100755 index 000000000..79ed9a79d --- /dev/null +++ b/Algorithms/0379.design-phone-directory/design-phone-directory_test.go @@ -0,0 +1,43 @@ +package Problem0379 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0379(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0380.insert-delete-getrandom-o1/README.md b/Algorithms/0380.insert-delete-getrandom-o1/README.md new file mode 100755 index 000000000..d8aba8a0f --- /dev/null +++ b/Algorithms/0380.insert-delete-getrandom-o1/README.md @@ -0,0 +1,11 @@ +# [380. Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1.go b/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1.go new file mode 100755 index 000000000..9771ae2de --- /dev/null +++ b/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1.go @@ -0,0 +1,2 @@ +package Problem0380 + 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 new file mode 100755 index 000000000..c69311dbf --- /dev/null +++ b/Algorithms/0380.insert-delete-getrandom-o1/insert-delete-getrandom-o1_test.go @@ -0,0 +1,43 @@ +package Problem0380 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0380(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/README.md b/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/README.md new file mode 100755 index 000000000..6eee3db98 --- /dev/null +++ b/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/README.md @@ -0,0 +1,11 @@ +# [381. Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed.go b/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed.go new file mode 100755 index 000000000..f529184cc --- /dev/null +++ b/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed.go @@ -0,0 +1,2 @@ +package Problem0381 + 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 new file mode 100755 index 000000000..1c9d529ed --- /dev/null +++ b/Algorithms/0381.insert-delete-getrandom-o1-duplicates-allowed/insert-delete-getrandom-o1-duplicates-allowed_test.go @@ -0,0 +1,43 @@ +package Problem0381 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0381(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0382.linked-list-random-node/README.md b/Algorithms/0382.linked-list-random-node/README.md new file mode 100755 index 000000000..65ea953a5 --- /dev/null +++ b/Algorithms/0382.linked-list-random-node/README.md @@ -0,0 +1,11 @@ +# [382. Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0382.linked-list-random-node/linked-list-random-node.go b/Algorithms/0382.linked-list-random-node/linked-list-random-node.go new file mode 100755 index 000000000..335bf921d --- /dev/null +++ b/Algorithms/0382.linked-list-random-node/linked-list-random-node.go @@ -0,0 +1,2 @@ +package Problem0382 + 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 new file mode 100755 index 000000000..bf4838b8b --- /dev/null +++ b/Algorithms/0382.linked-list-random-node/linked-list-random-node_test.go @@ -0,0 +1,43 @@ +package Problem0382 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0382(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0383.ransom-note/README.md b/Algorithms/0383.ransom-note/README.md new file mode 100755 index 000000000..c4daf0988 --- /dev/null +++ b/Algorithms/0383.ransom-note/README.md @@ -0,0 +1,11 @@ +# [383. Ransom Note](https://leetcode.com/problems/ransom-note/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0383.ransom-note/ransom-note.go b/Algorithms/0383.ransom-note/ransom-note.go new file mode 100755 index 000000000..59e0cde2d --- /dev/null +++ b/Algorithms/0383.ransom-note/ransom-note.go @@ -0,0 +1,2 @@ +package Problem0383 + diff --git a/Algorithms/0383.ransom-note/ransom-note_test.go b/Algorithms/0383.ransom-note/ransom-note_test.go new file mode 100755 index 000000000..68c9e4161 --- /dev/null +++ b/Algorithms/0383.ransom-note/ransom-note_test.go @@ -0,0 +1,43 @@ +package Problem0383 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0383(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0384.shuffle-an-array/README.md b/Algorithms/0384.shuffle-an-array/README.md new file mode 100755 index 000000000..e43400d2c --- /dev/null +++ b/Algorithms/0384.shuffle-an-array/README.md @@ -0,0 +1,11 @@ +# [384. Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0384.shuffle-an-array/shuffle-an-array.go b/Algorithms/0384.shuffle-an-array/shuffle-an-array.go new file mode 100755 index 000000000..a8d1177af --- /dev/null +++ b/Algorithms/0384.shuffle-an-array/shuffle-an-array.go @@ -0,0 +1,2 @@ +package Problem0384 + diff --git a/Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go b/Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go new file mode 100755 index 000000000..fa3c1f522 --- /dev/null +++ b/Algorithms/0384.shuffle-an-array/shuffle-an-array_test.go @@ -0,0 +1,43 @@ +package Problem0384 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0384(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0385.mini-parser/README.md b/Algorithms/0385.mini-parser/README.md new file mode 100755 index 000000000..8bcb24c3d --- /dev/null +++ b/Algorithms/0385.mini-parser/README.md @@ -0,0 +1,11 @@ +# [385. Mini Parser](https://leetcode.com/problems/mini-parser/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0385.mini-parser/mini-parser.go b/Algorithms/0385.mini-parser/mini-parser.go new file mode 100755 index 000000000..809df5f65 --- /dev/null +++ b/Algorithms/0385.mini-parser/mini-parser.go @@ -0,0 +1,2 @@ +package Problem0385 + diff --git a/Algorithms/0385.mini-parser/mini-parser_test.go b/Algorithms/0385.mini-parser/mini-parser_test.go new file mode 100755 index 000000000..ce573cb03 --- /dev/null +++ b/Algorithms/0385.mini-parser/mini-parser_test.go @@ -0,0 +1,43 @@ +package Problem0385 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0385(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0386.lexicographical-numbers/README.md b/Algorithms/0386.lexicographical-numbers/README.md new file mode 100755 index 000000000..1306428f1 --- /dev/null +++ b/Algorithms/0386.lexicographical-numbers/README.md @@ -0,0 +1,11 @@ +# [386. Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0386.lexicographical-numbers/lexicographical-numbers.go b/Algorithms/0386.lexicographical-numbers/lexicographical-numbers.go new file mode 100755 index 000000000..e7cd9f170 --- /dev/null +++ b/Algorithms/0386.lexicographical-numbers/lexicographical-numbers.go @@ -0,0 +1,2 @@ +package Problem0386 + diff --git a/Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go b/Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go new file mode 100755 index 000000000..06965f3d0 --- /dev/null +++ b/Algorithms/0386.lexicographical-numbers/lexicographical-numbers_test.go @@ -0,0 +1,43 @@ +package Problem0386 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0386(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0387.first-unique-character-in-a-string/README.md b/Algorithms/0387.first-unique-character-in-a-string/README.md new file mode 100755 index 000000000..bd0924c7e --- /dev/null +++ b/Algorithms/0387.first-unique-character-in-a-string/README.md @@ -0,0 +1,11 @@ +# [387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string.go b/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string.go new file mode 100755 index 000000000..57afb6f2c --- /dev/null +++ b/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string.go @@ -0,0 +1,2 @@ +package Problem0387 + 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 new file mode 100755 index 000000000..be9355d3e --- /dev/null +++ b/Algorithms/0387.first-unique-character-in-a-string/first-unique-character-in-a-string_test.go @@ -0,0 +1,43 @@ +package Problem0387 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0387(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0388.longest-absolute-file-path/README.md b/Algorithms/0388.longest-absolute-file-path/README.md new file mode 100755 index 000000000..ea5f3b0ce --- /dev/null +++ b/Algorithms/0388.longest-absolute-file-path/README.md @@ -0,0 +1,11 @@ +# [388. Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path.go b/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path.go new file mode 100755 index 000000000..cfe6b34ba --- /dev/null +++ b/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path.go @@ -0,0 +1,2 @@ +package Problem0388 + 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 new file mode 100755 index 000000000..c2cba8f2a --- /dev/null +++ b/Algorithms/0388.longest-absolute-file-path/longest-absolute-file-path_test.go @@ -0,0 +1,43 @@ +package Problem0388 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0388(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0389.find-the-difference/README.md b/Algorithms/0389.find-the-difference/README.md new file mode 100755 index 000000000..c5a92c0f4 --- /dev/null +++ b/Algorithms/0389.find-the-difference/README.md @@ -0,0 +1,11 @@ +# [389. Find the Difference](https://leetcode.com/problems/find-the-difference/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0389.find-the-difference/find-the-difference.go b/Algorithms/0389.find-the-difference/find-the-difference.go new file mode 100755 index 000000000..e5a3f0760 --- /dev/null +++ b/Algorithms/0389.find-the-difference/find-the-difference.go @@ -0,0 +1,2 @@ +package Problem0389 + diff --git a/Algorithms/0389.find-the-difference/find-the-difference_test.go b/Algorithms/0389.find-the-difference/find-the-difference_test.go new file mode 100755 index 000000000..81895e307 --- /dev/null +++ b/Algorithms/0389.find-the-difference/find-the-difference_test.go @@ -0,0 +1,43 @@ +package Problem0389 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0389(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0390.elimination-game/README.md b/Algorithms/0390.elimination-game/README.md new file mode 100755 index 000000000..b063fa547 --- /dev/null +++ b/Algorithms/0390.elimination-game/README.md @@ -0,0 +1,11 @@ +# [390. Elimination Game](https://leetcode.com/problems/elimination-game/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0390.elimination-game/elimination-game.go b/Algorithms/0390.elimination-game/elimination-game.go new file mode 100755 index 000000000..c058b1fbf --- /dev/null +++ b/Algorithms/0390.elimination-game/elimination-game.go @@ -0,0 +1,2 @@ +package Problem0390 + diff --git a/Algorithms/0390.elimination-game/elimination-game_test.go b/Algorithms/0390.elimination-game/elimination-game_test.go new file mode 100755 index 000000000..eae1e4eda --- /dev/null +++ b/Algorithms/0390.elimination-game/elimination-game_test.go @@ -0,0 +1,43 @@ +package Problem0390 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0390(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0391.perfect-rectangle/README.md b/Algorithms/0391.perfect-rectangle/README.md new file mode 100755 index 000000000..0c8b1bb8d --- /dev/null +++ b/Algorithms/0391.perfect-rectangle/README.md @@ -0,0 +1,11 @@ +# [391. Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0391.perfect-rectangle/perfect-rectangle.go b/Algorithms/0391.perfect-rectangle/perfect-rectangle.go new file mode 100755 index 000000000..ca077275e --- /dev/null +++ b/Algorithms/0391.perfect-rectangle/perfect-rectangle.go @@ -0,0 +1,2 @@ +package Problem0391 + diff --git a/Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go b/Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go new file mode 100755 index 000000000..73fb68b94 --- /dev/null +++ b/Algorithms/0391.perfect-rectangle/perfect-rectangle_test.go @@ -0,0 +1,43 @@ +package Problem0391 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0391(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0392.is-subsequence/README.md b/Algorithms/0392.is-subsequence/README.md new file mode 100755 index 000000000..43737b616 --- /dev/null +++ b/Algorithms/0392.is-subsequence/README.md @@ -0,0 +1,11 @@ +# [392. Is Subsequence](https://leetcode.com/problems/is-subsequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0392.is-subsequence/is-subsequence.go b/Algorithms/0392.is-subsequence/is-subsequence.go new file mode 100755 index 000000000..285cccf05 --- /dev/null +++ b/Algorithms/0392.is-subsequence/is-subsequence.go @@ -0,0 +1,2 @@ +package Problem0392 + diff --git a/Algorithms/0392.is-subsequence/is-subsequence_test.go b/Algorithms/0392.is-subsequence/is-subsequence_test.go new file mode 100755 index 000000000..27caa7bab --- /dev/null +++ b/Algorithms/0392.is-subsequence/is-subsequence_test.go @@ -0,0 +1,43 @@ +package Problem0392 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0392(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0393.utf-8-validation/README.md b/Algorithms/0393.utf-8-validation/README.md new file mode 100755 index 000000000..d5eac5cc1 --- /dev/null +++ b/Algorithms/0393.utf-8-validation/README.md @@ -0,0 +1,11 @@ +# [393. UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0393.utf-8-validation/utf-8-validation.go b/Algorithms/0393.utf-8-validation/utf-8-validation.go new file mode 100755 index 000000000..7fbbf1cd9 --- /dev/null +++ b/Algorithms/0393.utf-8-validation/utf-8-validation.go @@ -0,0 +1,2 @@ +package Problem0393 + diff --git a/Algorithms/0393.utf-8-validation/utf-8-validation_test.go b/Algorithms/0393.utf-8-validation/utf-8-validation_test.go new file mode 100755 index 000000000..87de82ae3 --- /dev/null +++ b/Algorithms/0393.utf-8-validation/utf-8-validation_test.go @@ -0,0 +1,43 @@ +package Problem0393 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0393(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0394.decode-string/README.md b/Algorithms/0394.decode-string/README.md new file mode 100755 index 000000000..a3b125eac --- /dev/null +++ b/Algorithms/0394.decode-string/README.md @@ -0,0 +1,11 @@ +# [394. Decode String](https://leetcode.com/problems/decode-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0394.decode-string/decode-string.go b/Algorithms/0394.decode-string/decode-string.go new file mode 100755 index 000000000..8b30999fb --- /dev/null +++ b/Algorithms/0394.decode-string/decode-string.go @@ -0,0 +1,2 @@ +package Problem0394 + diff --git a/Algorithms/0394.decode-string/decode-string_test.go b/Algorithms/0394.decode-string/decode-string_test.go new file mode 100755 index 000000000..a8f8ddb46 --- /dev/null +++ b/Algorithms/0394.decode-string/decode-string_test.go @@ -0,0 +1,43 @@ +package Problem0394 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0394(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/README.md b/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/README.md new file mode 100755 index 000000000..e38d6e03e --- /dev/null +++ b/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/README.md @@ -0,0 +1,11 @@ +# [395. Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters.go b/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters.go new file mode 100755 index 000000000..7e5623448 --- /dev/null +++ b/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters.go @@ -0,0 +1,2 @@ +package Problem0395 + 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 new file mode 100755 index 000000000..d6f4b42e4 --- /dev/null +++ b/Algorithms/0395.longest-substring-with-at-least-k-repeating-characters/longest-substring-with-at-least-k-repeating-characters_test.go @@ -0,0 +1,43 @@ +package Problem0395 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0395(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0396.rotate-function/README.md b/Algorithms/0396.rotate-function/README.md new file mode 100755 index 000000000..5053a7cb0 --- /dev/null +++ b/Algorithms/0396.rotate-function/README.md @@ -0,0 +1,11 @@ +# [396. Rotate Function](https://leetcode.com/problems/rotate-function/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0396.rotate-function/rotate-function.go b/Algorithms/0396.rotate-function/rotate-function.go new file mode 100755 index 000000000..b13ab6cb6 --- /dev/null +++ b/Algorithms/0396.rotate-function/rotate-function.go @@ -0,0 +1,2 @@ +package Problem0396 + diff --git a/Algorithms/0396.rotate-function/rotate-function_test.go b/Algorithms/0396.rotate-function/rotate-function_test.go new file mode 100755 index 000000000..514d5ec0a --- /dev/null +++ b/Algorithms/0396.rotate-function/rotate-function_test.go @@ -0,0 +1,43 @@ +package Problem0396 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0396(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0397.integer-replacement/README.md b/Algorithms/0397.integer-replacement/README.md new file mode 100755 index 000000000..723550367 --- /dev/null +++ b/Algorithms/0397.integer-replacement/README.md @@ -0,0 +1,11 @@ +# [397. Integer Replacement](https://leetcode.com/problems/integer-replacement/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0397.integer-replacement/integer-replacement.go b/Algorithms/0397.integer-replacement/integer-replacement.go new file mode 100755 index 000000000..b6101541e --- /dev/null +++ b/Algorithms/0397.integer-replacement/integer-replacement.go @@ -0,0 +1,2 @@ +package Problem0397 + diff --git a/Algorithms/0397.integer-replacement/integer-replacement_test.go b/Algorithms/0397.integer-replacement/integer-replacement_test.go new file mode 100755 index 000000000..4b0e67a54 --- /dev/null +++ b/Algorithms/0397.integer-replacement/integer-replacement_test.go @@ -0,0 +1,43 @@ +package Problem0397 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0397(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0398.random-pick-index/README.md b/Algorithms/0398.random-pick-index/README.md new file mode 100755 index 000000000..7081ee0d2 --- /dev/null +++ b/Algorithms/0398.random-pick-index/README.md @@ -0,0 +1,11 @@ +# [398. Random Pick Index](https://leetcode.com/problems/random-pick-index/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0398.random-pick-index/random-pick-index.go b/Algorithms/0398.random-pick-index/random-pick-index.go new file mode 100755 index 000000000..62c02ce57 --- /dev/null +++ b/Algorithms/0398.random-pick-index/random-pick-index.go @@ -0,0 +1,2 @@ +package Problem0398 + diff --git a/Algorithms/0398.random-pick-index/random-pick-index_test.go b/Algorithms/0398.random-pick-index/random-pick-index_test.go new file mode 100755 index 000000000..2883304c6 --- /dev/null +++ b/Algorithms/0398.random-pick-index/random-pick-index_test.go @@ -0,0 +1,43 @@ +package Problem0398 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0398(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0399.evaluate-division/README.md b/Algorithms/0399.evaluate-division/README.md new file mode 100755 index 000000000..e8879dddf --- /dev/null +++ b/Algorithms/0399.evaluate-division/README.md @@ -0,0 +1,11 @@ +# [399. Evaluate Division](https://leetcode.com/problems/evaluate-division/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0399.evaluate-division/evaluate-division.go b/Algorithms/0399.evaluate-division/evaluate-division.go new file mode 100755 index 000000000..e9f231b2d --- /dev/null +++ b/Algorithms/0399.evaluate-division/evaluate-division.go @@ -0,0 +1,2 @@ +package Problem0399 + diff --git a/Algorithms/0399.evaluate-division/evaluate-division_test.go b/Algorithms/0399.evaluate-division/evaluate-division_test.go new file mode 100755 index 000000000..d38b76059 --- /dev/null +++ b/Algorithms/0399.evaluate-division/evaluate-division_test.go @@ -0,0 +1,43 @@ +package Problem0399 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0399(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0400.nth-digit/README.md b/Algorithms/0400.nth-digit/README.md new file mode 100755 index 000000000..06c96369b --- /dev/null +++ b/Algorithms/0400.nth-digit/README.md @@ -0,0 +1,11 @@ +# [400. Nth Digit](https://leetcode.com/problems/nth-digit/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0400.nth-digit/nth-digit.go b/Algorithms/0400.nth-digit/nth-digit.go new file mode 100755 index 000000000..a17483957 --- /dev/null +++ b/Algorithms/0400.nth-digit/nth-digit.go @@ -0,0 +1,2 @@ +package Problem0400 + diff --git a/Algorithms/0400.nth-digit/nth-digit_test.go b/Algorithms/0400.nth-digit/nth-digit_test.go new file mode 100755 index 000000000..b430d667a --- /dev/null +++ b/Algorithms/0400.nth-digit/nth-digit_test.go @@ -0,0 +1,43 @@ +package Problem0400 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0400(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0401.binary-watch/README.md b/Algorithms/0401.binary-watch/README.md new file mode 100755 index 000000000..885c3d6a5 --- /dev/null +++ b/Algorithms/0401.binary-watch/README.md @@ -0,0 +1,11 @@ +# [401. Binary Watch](https://leetcode.com/problems/binary-watch/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0401.binary-watch/binary-watch.go b/Algorithms/0401.binary-watch/binary-watch.go new file mode 100755 index 000000000..4b8725573 --- /dev/null +++ b/Algorithms/0401.binary-watch/binary-watch.go @@ -0,0 +1,2 @@ +package Problem0401 + diff --git a/Algorithms/0401.binary-watch/binary-watch_test.go b/Algorithms/0401.binary-watch/binary-watch_test.go new file mode 100755 index 000000000..0ec1df951 --- /dev/null +++ b/Algorithms/0401.binary-watch/binary-watch_test.go @@ -0,0 +1,43 @@ +package Problem0401 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0401(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0402.remove-k-digits/README.md b/Algorithms/0402.remove-k-digits/README.md new file mode 100755 index 000000000..d1d5f571c --- /dev/null +++ b/Algorithms/0402.remove-k-digits/README.md @@ -0,0 +1,11 @@ +# [402. Remove K Digits](https://leetcode.com/problems/remove-k-digits/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0402.remove-k-digits/remove-k-digits.go b/Algorithms/0402.remove-k-digits/remove-k-digits.go new file mode 100755 index 000000000..640bbeccd --- /dev/null +++ b/Algorithms/0402.remove-k-digits/remove-k-digits.go @@ -0,0 +1,2 @@ +package Problem0402 + diff --git a/Algorithms/0402.remove-k-digits/remove-k-digits_test.go b/Algorithms/0402.remove-k-digits/remove-k-digits_test.go new file mode 100755 index 000000000..ae0081e07 --- /dev/null +++ b/Algorithms/0402.remove-k-digits/remove-k-digits_test.go @@ -0,0 +1,43 @@ +package Problem0402 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0402(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0403.frog-jump/README.md b/Algorithms/0403.frog-jump/README.md new file mode 100755 index 000000000..afbb898d4 --- /dev/null +++ b/Algorithms/0403.frog-jump/README.md @@ -0,0 +1,11 @@ +# [403. Frog Jump](https://leetcode.com/problems/frog-jump/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0403.frog-jump/frog-jump.go b/Algorithms/0403.frog-jump/frog-jump.go new file mode 100755 index 000000000..f7ae2e2e8 --- /dev/null +++ b/Algorithms/0403.frog-jump/frog-jump.go @@ -0,0 +1,2 @@ +package Problem0403 + diff --git a/Algorithms/0403.frog-jump/frog-jump_test.go b/Algorithms/0403.frog-jump/frog-jump_test.go new file mode 100755 index 000000000..ea2776a55 --- /dev/null +++ b/Algorithms/0403.frog-jump/frog-jump_test.go @@ -0,0 +1,43 @@ +package Problem0403 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0403(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0404.sum-of-left-leaves/README.md b/Algorithms/0404.sum-of-left-leaves/README.md new file mode 100755 index 000000000..2dce0644f --- /dev/null +++ b/Algorithms/0404.sum-of-left-leaves/README.md @@ -0,0 +1,11 @@ +# [404. Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves.go b/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves.go new file mode 100755 index 000000000..1d5991057 --- /dev/null +++ b/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves.go @@ -0,0 +1,2 @@ +package Problem0404 + 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 new file mode 100755 index 000000000..7192b49c4 --- /dev/null +++ b/Algorithms/0404.sum-of-left-leaves/sum-of-left-leaves_test.go @@ -0,0 +1,43 @@ +package Problem0404 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0404(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0405.convert-a-number-to-hexadecimal/README.md b/Algorithms/0405.convert-a-number-to-hexadecimal/README.md new file mode 100755 index 000000000..210b9a1cb --- /dev/null +++ b/Algorithms/0405.convert-a-number-to-hexadecimal/README.md @@ -0,0 +1,11 @@ +# [405. Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal.go b/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal.go new file mode 100755 index 000000000..38d1dd8b6 --- /dev/null +++ b/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal.go @@ -0,0 +1,2 @@ +package Problem0405 + 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 new file mode 100755 index 000000000..190307b2e --- /dev/null +++ b/Algorithms/0405.convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal_test.go @@ -0,0 +1,43 @@ +package Problem0405 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0405(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0406.queue-reconstruction-by-height/README.md b/Algorithms/0406.queue-reconstruction-by-height/README.md new file mode 100755 index 000000000..9a1c2553a --- /dev/null +++ b/Algorithms/0406.queue-reconstruction-by-height/README.md @@ -0,0 +1,11 @@ +# [406. Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height.go b/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height.go new file mode 100755 index 000000000..c648463a3 --- /dev/null +++ b/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height.go @@ -0,0 +1,2 @@ +package Problem0406 + 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 new file mode 100755 index 000000000..9c6779797 --- /dev/null +++ b/Algorithms/0406.queue-reconstruction-by-height/queue-reconstruction-by-height_test.go @@ -0,0 +1,43 @@ +package Problem0406 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0406(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0407.trapping-rain-water-ii/README.md b/Algorithms/0407.trapping-rain-water-ii/README.md new file mode 100755 index 000000000..63f282bc7 --- /dev/null +++ b/Algorithms/0407.trapping-rain-water-ii/README.md @@ -0,0 +1,11 @@ +# [407. Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii.go b/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii.go new file mode 100755 index 000000000..1153540a9 --- /dev/null +++ b/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii.go @@ -0,0 +1,2 @@ +package Problem0407 + 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 new file mode 100755 index 000000000..0fec6489f --- /dev/null +++ b/Algorithms/0407.trapping-rain-water-ii/trapping-rain-water-ii_test.go @@ -0,0 +1,43 @@ +package Problem0407 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0407(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0408.valid-word-abbreviation/README.md b/Algorithms/0408.valid-word-abbreviation/README.md new file mode 100755 index 000000000..5c5b964f7 --- /dev/null +++ b/Algorithms/0408.valid-word-abbreviation/README.md @@ -0,0 +1,11 @@ +# [408. Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation.go b/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation.go new file mode 100755 index 000000000..653915ac8 --- /dev/null +++ b/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation.go @@ -0,0 +1,2 @@ +package Problem0408 + diff --git a/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go b/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go new file mode 100755 index 000000000..067115823 --- /dev/null +++ b/Algorithms/0408.valid-word-abbreviation/valid-word-abbreviation_test.go @@ -0,0 +1,43 @@ +package Problem0408 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0408(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0409.longest-palindrome/README.md b/Algorithms/0409.longest-palindrome/README.md new file mode 100755 index 000000000..3f086498a --- /dev/null +++ b/Algorithms/0409.longest-palindrome/README.md @@ -0,0 +1,11 @@ +# [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0409.longest-palindrome/longest-palindrome.go b/Algorithms/0409.longest-palindrome/longest-palindrome.go new file mode 100755 index 000000000..638dcccfe --- /dev/null +++ b/Algorithms/0409.longest-palindrome/longest-palindrome.go @@ -0,0 +1,2 @@ +package Problem0409 + diff --git a/Algorithms/0409.longest-palindrome/longest-palindrome_test.go b/Algorithms/0409.longest-palindrome/longest-palindrome_test.go new file mode 100755 index 000000000..8769aa3d0 --- /dev/null +++ b/Algorithms/0409.longest-palindrome/longest-palindrome_test.go @@ -0,0 +1,43 @@ +package Problem0409 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0409(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0410.split-array-largest-sum/README.md b/Algorithms/0410.split-array-largest-sum/README.md new file mode 100755 index 000000000..88d8d1a1a --- /dev/null +++ b/Algorithms/0410.split-array-largest-sum/README.md @@ -0,0 +1,11 @@ +# [410. Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0410.split-array-largest-sum/split-array-largest-sum.go b/Algorithms/0410.split-array-largest-sum/split-array-largest-sum.go new file mode 100755 index 000000000..968f95bdf --- /dev/null +++ b/Algorithms/0410.split-array-largest-sum/split-array-largest-sum.go @@ -0,0 +1,2 @@ +package Problem0410 + 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 new file mode 100755 index 000000000..55aa3f25b --- /dev/null +++ b/Algorithms/0410.split-array-largest-sum/split-array-largest-sum_test.go @@ -0,0 +1,43 @@ +package Problem0410 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0410(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0411.minimum-unique-word-abbreviation/README.md b/Algorithms/0411.minimum-unique-word-abbreviation/README.md new file mode 100755 index 000000000..d87c12043 --- /dev/null +++ b/Algorithms/0411.minimum-unique-word-abbreviation/README.md @@ -0,0 +1,11 @@ +# [411. Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation.go b/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation.go new file mode 100755 index 000000000..75b686e64 --- /dev/null +++ b/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation.go @@ -0,0 +1,2 @@ +package Problem0411 + 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 new file mode 100755 index 000000000..9f67b70b8 --- /dev/null +++ b/Algorithms/0411.minimum-unique-word-abbreviation/minimum-unique-word-abbreviation_test.go @@ -0,0 +1,43 @@ +package Problem0411 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0411(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0412.fizz-buzz/README.md b/Algorithms/0412.fizz-buzz/README.md new file mode 100755 index 000000000..0fcbd0e9d --- /dev/null +++ b/Algorithms/0412.fizz-buzz/README.md @@ -0,0 +1,11 @@ +# [412. Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0412.fizz-buzz/fizz-buzz.go b/Algorithms/0412.fizz-buzz/fizz-buzz.go new file mode 100755 index 000000000..96b5306f7 --- /dev/null +++ b/Algorithms/0412.fizz-buzz/fizz-buzz.go @@ -0,0 +1,2 @@ +package Problem0412 + diff --git a/Algorithms/0412.fizz-buzz/fizz-buzz_test.go b/Algorithms/0412.fizz-buzz/fizz-buzz_test.go new file mode 100755 index 000000000..681de587a --- /dev/null +++ b/Algorithms/0412.fizz-buzz/fizz-buzz_test.go @@ -0,0 +1,43 @@ +package Problem0412 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0412(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0413.arithmetic-slices/README.md b/Algorithms/0413.arithmetic-slices/README.md new file mode 100755 index 000000000..0b2d62405 --- /dev/null +++ b/Algorithms/0413.arithmetic-slices/README.md @@ -0,0 +1,11 @@ +# [413. Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0413.arithmetic-slices/arithmetic-slices.go b/Algorithms/0413.arithmetic-slices/arithmetic-slices.go new file mode 100755 index 000000000..8494cd2ce --- /dev/null +++ b/Algorithms/0413.arithmetic-slices/arithmetic-slices.go @@ -0,0 +1,2 @@ +package Problem0413 + diff --git a/Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go b/Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go new file mode 100755 index 000000000..ff02d94e7 --- /dev/null +++ b/Algorithms/0413.arithmetic-slices/arithmetic-slices_test.go @@ -0,0 +1,43 @@ +package Problem0413 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0413(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0414.third-maximum-number/README.md b/Algorithms/0414.third-maximum-number/README.md new file mode 100755 index 000000000..4dde4af77 --- /dev/null +++ b/Algorithms/0414.third-maximum-number/README.md @@ -0,0 +1,11 @@ +# [414. Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0414.third-maximum-number/third-maximum-number.go b/Algorithms/0414.third-maximum-number/third-maximum-number.go new file mode 100755 index 000000000..6bf503f5f --- /dev/null +++ b/Algorithms/0414.third-maximum-number/third-maximum-number.go @@ -0,0 +1,2 @@ +package Problem0414 + diff --git a/Algorithms/0414.third-maximum-number/third-maximum-number_test.go b/Algorithms/0414.third-maximum-number/third-maximum-number_test.go new file mode 100755 index 000000000..d890e4c6b --- /dev/null +++ b/Algorithms/0414.third-maximum-number/third-maximum-number_test.go @@ -0,0 +1,43 @@ +package Problem0414 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0414(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0415.add-strings/README.md b/Algorithms/0415.add-strings/README.md new file mode 100755 index 000000000..1a0217d5b --- /dev/null +++ b/Algorithms/0415.add-strings/README.md @@ -0,0 +1,11 @@ +# [415. Add Strings](https://leetcode.com/problems/add-strings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0415.add-strings/add-strings.go b/Algorithms/0415.add-strings/add-strings.go new file mode 100755 index 000000000..86027cddd --- /dev/null +++ b/Algorithms/0415.add-strings/add-strings.go @@ -0,0 +1,2 @@ +package Problem0415 + diff --git a/Algorithms/0415.add-strings/add-strings_test.go b/Algorithms/0415.add-strings/add-strings_test.go new file mode 100755 index 000000000..850ea370a --- /dev/null +++ b/Algorithms/0415.add-strings/add-strings_test.go @@ -0,0 +1,43 @@ +package Problem0415 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0415(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0416.partition-equal-subset-sum/README.md b/Algorithms/0416.partition-equal-subset-sum/README.md new file mode 100755 index 000000000..2f9d9e9b2 --- /dev/null +++ b/Algorithms/0416.partition-equal-subset-sum/README.md @@ -0,0 +1,11 @@ +# [416. Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum.go b/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum.go new file mode 100755 index 000000000..7e66cca2b --- /dev/null +++ b/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum.go @@ -0,0 +1,2 @@ +package Problem0416 + 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 new file mode 100755 index 000000000..c68ad1577 --- /dev/null +++ b/Algorithms/0416.partition-equal-subset-sum/partition-equal-subset-sum_test.go @@ -0,0 +1,43 @@ +package Problem0416 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0416(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0417.pacific-atlantic-water-flow/README.md b/Algorithms/0417.pacific-atlantic-water-flow/README.md new file mode 100755 index 000000000..fb023146e --- /dev/null +++ b/Algorithms/0417.pacific-atlantic-water-flow/README.md @@ -0,0 +1,11 @@ +# [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow.go b/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow.go new file mode 100755 index 000000000..1735032b7 --- /dev/null +++ b/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow.go @@ -0,0 +1,2 @@ +package Problem0417 + 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 new file mode 100755 index 000000000..123853c22 --- /dev/null +++ b/Algorithms/0417.pacific-atlantic-water-flow/pacific-atlantic-water-flow_test.go @@ -0,0 +1,43 @@ +package Problem0417 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0417(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0418.sentence-screen-fitting/README.md b/Algorithms/0418.sentence-screen-fitting/README.md new file mode 100755 index 000000000..b33d3d38f --- /dev/null +++ b/Algorithms/0418.sentence-screen-fitting/README.md @@ -0,0 +1,11 @@ +# [418. Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting.go b/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting.go new file mode 100755 index 000000000..04d8b240c --- /dev/null +++ b/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting.go @@ -0,0 +1,2 @@ +package Problem0418 + diff --git a/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go b/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go new file mode 100755 index 000000000..ac95f6cc5 --- /dev/null +++ b/Algorithms/0418.sentence-screen-fitting/sentence-screen-fitting_test.go @@ -0,0 +1,43 @@ +package Problem0418 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0418(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0419.battleships-in-a-board/README.md b/Algorithms/0419.battleships-in-a-board/README.md new file mode 100755 index 000000000..ff0dee732 --- /dev/null +++ b/Algorithms/0419.battleships-in-a-board/README.md @@ -0,0 +1,11 @@ +# [419. Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0419.battleships-in-a-board/battleships-in-a-board.go b/Algorithms/0419.battleships-in-a-board/battleships-in-a-board.go new file mode 100755 index 000000000..dab698611 --- /dev/null +++ b/Algorithms/0419.battleships-in-a-board/battleships-in-a-board.go @@ -0,0 +1,2 @@ +package Problem0419 + 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 new file mode 100755 index 000000000..ded60eae5 --- /dev/null +++ b/Algorithms/0419.battleships-in-a-board/battleships-in-a-board_test.go @@ -0,0 +1,43 @@ +package Problem0419 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0419(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0420.strong-password-checker/README.md b/Algorithms/0420.strong-password-checker/README.md new file mode 100755 index 000000000..897265cae --- /dev/null +++ b/Algorithms/0420.strong-password-checker/README.md @@ -0,0 +1,11 @@ +# [420. Strong Password Checker](https://leetcode.com/problems/strong-password-checker/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0420.strong-password-checker/strong-password-checker.go b/Algorithms/0420.strong-password-checker/strong-password-checker.go new file mode 100755 index 000000000..93e0e8fa7 --- /dev/null +++ b/Algorithms/0420.strong-password-checker/strong-password-checker.go @@ -0,0 +1,2 @@ +package Problem0420 + diff --git a/Algorithms/0420.strong-password-checker/strong-password-checker_test.go b/Algorithms/0420.strong-password-checker/strong-password-checker_test.go new file mode 100755 index 000000000..1f10728e4 --- /dev/null +++ b/Algorithms/0420.strong-password-checker/strong-password-checker_test.go @@ -0,0 +1,43 @@ +package Problem0420 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0420(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/README.md b/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/README.md new file mode 100755 index 000000000..4b2ac4360 --- /dev/null +++ b/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/README.md @@ -0,0 +1,11 @@ +# [421. Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array.go b/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array.go new file mode 100755 index 000000000..7d09de9a2 --- /dev/null +++ b/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array.go @@ -0,0 +1,2 @@ +package Problem0421 + 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 new file mode 100755 index 000000000..898a13ebb --- /dev/null +++ b/Algorithms/0421.maximum-xor-of-two-numbers-in-an-array/maximum-xor-of-two-numbers-in-an-array_test.go @@ -0,0 +1,43 @@ +package Problem0421 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0421(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0422.valid-word-square/README.md b/Algorithms/0422.valid-word-square/README.md new file mode 100755 index 000000000..a28837d4d --- /dev/null +++ b/Algorithms/0422.valid-word-square/README.md @@ -0,0 +1,11 @@ +# [422. Valid Word Square](https://leetcode.com/problems/valid-word-square/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0422.valid-word-square/valid-word-square.go b/Algorithms/0422.valid-word-square/valid-word-square.go new file mode 100755 index 000000000..649d9c7b0 --- /dev/null +++ b/Algorithms/0422.valid-word-square/valid-word-square.go @@ -0,0 +1,2 @@ +package Problem0422 + diff --git a/Algorithms/0422.valid-word-square/valid-word-square_test.go b/Algorithms/0422.valid-word-square/valid-word-square_test.go new file mode 100755 index 000000000..7ac61cb7e --- /dev/null +++ b/Algorithms/0422.valid-word-square/valid-word-square_test.go @@ -0,0 +1,43 @@ +package Problem0422 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0422(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0423.reconstruct-original-digits-from-english/README.md b/Algorithms/0423.reconstruct-original-digits-from-english/README.md new file mode 100755 index 000000000..113552833 --- /dev/null +++ b/Algorithms/0423.reconstruct-original-digits-from-english/README.md @@ -0,0 +1,11 @@ +# [423. Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english.go b/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english.go new file mode 100755 index 000000000..f495a4e4d --- /dev/null +++ b/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english.go @@ -0,0 +1,2 @@ +package Problem0423 + 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 new file mode 100755 index 000000000..a49c0d1b1 --- /dev/null +++ b/Algorithms/0423.reconstruct-original-digits-from-english/reconstruct-original-digits-from-english_test.go @@ -0,0 +1,43 @@ +package Problem0423 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0423(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0424.longest-repeating-character-replacement/README.md b/Algorithms/0424.longest-repeating-character-replacement/README.md new file mode 100755 index 000000000..5507179c2 --- /dev/null +++ b/Algorithms/0424.longest-repeating-character-replacement/README.md @@ -0,0 +1,11 @@ +# [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement.go b/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement.go new file mode 100755 index 000000000..a2bd30e93 --- /dev/null +++ b/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement.go @@ -0,0 +1,2 @@ +package Problem0424 + 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 new file mode 100755 index 000000000..fbd1aa038 --- /dev/null +++ b/Algorithms/0424.longest-repeating-character-replacement/longest-repeating-character-replacement_test.go @@ -0,0 +1,43 @@ +package Problem0424 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0424(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0425.word-squares/README.md b/Algorithms/0425.word-squares/README.md new file mode 100755 index 000000000..f142326e1 --- /dev/null +++ b/Algorithms/0425.word-squares/README.md @@ -0,0 +1,11 @@ +# [425. Word Squares](https://leetcode.com/problems/word-squares/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0425.word-squares/word-squares.go b/Algorithms/0425.word-squares/word-squares.go new file mode 100755 index 000000000..3daf866cc --- /dev/null +++ b/Algorithms/0425.word-squares/word-squares.go @@ -0,0 +1,2 @@ +package Problem0425 + diff --git a/Algorithms/0425.word-squares/word-squares_test.go b/Algorithms/0425.word-squares/word-squares_test.go new file mode 100755 index 000000000..61ed737cc --- /dev/null +++ b/Algorithms/0425.word-squares/word-squares_test.go @@ -0,0 +1,43 @@ +package Problem0425 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0425(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0432.all-oone-data-structure/README.md b/Algorithms/0432.all-oone-data-structure/README.md new file mode 100755 index 000000000..7231ef72e --- /dev/null +++ b/Algorithms/0432.all-oone-data-structure/README.md @@ -0,0 +1,11 @@ +# [432. All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0432.all-oone-data-structure/all-oone-data-structure.go b/Algorithms/0432.all-oone-data-structure/all-oone-data-structure.go new file mode 100755 index 000000000..15ae6f722 --- /dev/null +++ b/Algorithms/0432.all-oone-data-structure/all-oone-data-structure.go @@ -0,0 +1,2 @@ +package Problem0432 + 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 new file mode 100755 index 000000000..2941d5ec3 --- /dev/null +++ b/Algorithms/0432.all-oone-data-structure/all-oone-data-structure_test.go @@ -0,0 +1,43 @@ +package Problem0432 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0432(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0434.number-of-segments-in-a-string/README.md b/Algorithms/0434.number-of-segments-in-a-string/README.md new file mode 100755 index 000000000..09043a213 --- /dev/null +++ b/Algorithms/0434.number-of-segments-in-a-string/README.md @@ -0,0 +1,11 @@ +# [434. Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string.go b/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string.go new file mode 100755 index 000000000..8295a971b --- /dev/null +++ b/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string.go @@ -0,0 +1,2 @@ +package Problem0434 + 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 new file mode 100755 index 000000000..ce5b2a8c4 --- /dev/null +++ b/Algorithms/0434.number-of-segments-in-a-string/number-of-segments-in-a-string_test.go @@ -0,0 +1,43 @@ +package Problem0434 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0434(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0435.non-overlapping-intervals/README.md b/Algorithms/0435.non-overlapping-intervals/README.md new file mode 100755 index 000000000..b758aa74f --- /dev/null +++ b/Algorithms/0435.non-overlapping-intervals/README.md @@ -0,0 +1,11 @@ +# [435. Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals.go b/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals.go new file mode 100755 index 000000000..57515de41 --- /dev/null +++ b/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals.go @@ -0,0 +1,2 @@ +package Problem0435 + diff --git a/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go b/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go new file mode 100755 index 000000000..2c1e0bd11 --- /dev/null +++ b/Algorithms/0435.non-overlapping-intervals/non-overlapping-intervals_test.go @@ -0,0 +1,43 @@ +package Problem0435 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0435(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0436.find-right-interval/README.md b/Algorithms/0436.find-right-interval/README.md new file mode 100755 index 000000000..68ae03247 --- /dev/null +++ b/Algorithms/0436.find-right-interval/README.md @@ -0,0 +1,11 @@ +# [436. Find Right Interval](https://leetcode.com/problems/find-right-interval/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0436.find-right-interval/find-right-interval.go b/Algorithms/0436.find-right-interval/find-right-interval.go new file mode 100755 index 000000000..e651b0245 --- /dev/null +++ b/Algorithms/0436.find-right-interval/find-right-interval.go @@ -0,0 +1,2 @@ +package Problem0436 + diff --git a/Algorithms/0436.find-right-interval/find-right-interval_test.go b/Algorithms/0436.find-right-interval/find-right-interval_test.go new file mode 100755 index 000000000..d671dd074 --- /dev/null +++ b/Algorithms/0436.find-right-interval/find-right-interval_test.go @@ -0,0 +1,43 @@ +package Problem0436 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0436(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0437.path-sum-iii/README.md b/Algorithms/0437.path-sum-iii/README.md new file mode 100755 index 000000000..2d87fe9a8 --- /dev/null +++ b/Algorithms/0437.path-sum-iii/README.md @@ -0,0 +1,11 @@ +# [437. Path Sum III](https://leetcode.com/problems/path-sum-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0437.path-sum-iii/path-sum-iii.go b/Algorithms/0437.path-sum-iii/path-sum-iii.go new file mode 100755 index 000000000..db72f96fe --- /dev/null +++ b/Algorithms/0437.path-sum-iii/path-sum-iii.go @@ -0,0 +1,2 @@ +package Problem0437 + diff --git a/Algorithms/0437.path-sum-iii/path-sum-iii_test.go b/Algorithms/0437.path-sum-iii/path-sum-iii_test.go new file mode 100755 index 000000000..698449223 --- /dev/null +++ b/Algorithms/0437.path-sum-iii/path-sum-iii_test.go @@ -0,0 +1,43 @@ +package Problem0437 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0437(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0438.find-all-anagrams-in-a-string/README.md b/Algorithms/0438.find-all-anagrams-in-a-string/README.md new file mode 100755 index 000000000..21a564f73 --- /dev/null +++ b/Algorithms/0438.find-all-anagrams-in-a-string/README.md @@ -0,0 +1,11 @@ +# [438. Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string.go b/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string.go new file mode 100755 index 000000000..650715cc9 --- /dev/null +++ b/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string.go @@ -0,0 +1,2 @@ +package Problem0438 + 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 new file mode 100755 index 000000000..f256ac725 --- /dev/null +++ b/Algorithms/0438.find-all-anagrams-in-a-string/find-all-anagrams-in-a-string_test.go @@ -0,0 +1,43 @@ +package Problem0438 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0438(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0439.ternary-expression-parser/README.md b/Algorithms/0439.ternary-expression-parser/README.md new file mode 100755 index 000000000..5c17c42cd --- /dev/null +++ b/Algorithms/0439.ternary-expression-parser/README.md @@ -0,0 +1,11 @@ +# [439. Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0439.ternary-expression-parser/ternary-expression-parser.go b/Algorithms/0439.ternary-expression-parser/ternary-expression-parser.go new file mode 100755 index 000000000..e002ace15 --- /dev/null +++ b/Algorithms/0439.ternary-expression-parser/ternary-expression-parser.go @@ -0,0 +1,2 @@ +package Problem0439 + diff --git a/Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go b/Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go new file mode 100755 index 000000000..b018f9297 --- /dev/null +++ b/Algorithms/0439.ternary-expression-parser/ternary-expression-parser_test.go @@ -0,0 +1,43 @@ +package Problem0439 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0439(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0440.k-th-smallest-in-lexicographical-order/README.md b/Algorithms/0440.k-th-smallest-in-lexicographical-order/README.md new file mode 100755 index 000000000..ce70edc2e --- /dev/null +++ b/Algorithms/0440.k-th-smallest-in-lexicographical-order/README.md @@ -0,0 +1,11 @@ +# [440. K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order.go b/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order.go new file mode 100755 index 000000000..99c922c33 --- /dev/null +++ b/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order.go @@ -0,0 +1,2 @@ +package Problem0440 + 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 new file mode 100755 index 000000000..dbeff821a --- /dev/null +++ b/Algorithms/0440.k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order_test.go @@ -0,0 +1,43 @@ +package Problem0440 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0440(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0441.arranging-coins/README.md b/Algorithms/0441.arranging-coins/README.md new file mode 100755 index 000000000..6d1be6dd0 --- /dev/null +++ b/Algorithms/0441.arranging-coins/README.md @@ -0,0 +1,11 @@ +# [441. Arranging Coins](https://leetcode.com/problems/arranging-coins/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0441.arranging-coins/arranging-coins.go b/Algorithms/0441.arranging-coins/arranging-coins.go new file mode 100755 index 000000000..820a31bb6 --- /dev/null +++ b/Algorithms/0441.arranging-coins/arranging-coins.go @@ -0,0 +1,2 @@ +package Problem0441 + diff --git a/Algorithms/0441.arranging-coins/arranging-coins_test.go b/Algorithms/0441.arranging-coins/arranging-coins_test.go new file mode 100755 index 000000000..8479dba48 --- /dev/null +++ b/Algorithms/0441.arranging-coins/arranging-coins_test.go @@ -0,0 +1,43 @@ +package Problem0441 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0441(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0442.find-all-duplicates-in-an-array/README.md b/Algorithms/0442.find-all-duplicates-in-an-array/README.md new file mode 100755 index 000000000..62bb45759 --- /dev/null +++ b/Algorithms/0442.find-all-duplicates-in-an-array/README.md @@ -0,0 +1,11 @@ +# [442. Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.go b/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.go new file mode 100755 index 000000000..408c45b4e --- /dev/null +++ b/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.go @@ -0,0 +1,2 @@ +package Problem0442 + 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 new file mode 100755 index 000000000..723bfa89c --- /dev/null +++ b/Algorithms/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array_test.go @@ -0,0 +1,43 @@ +package Problem0442 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0442(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0444.sequence-reconstruction/README.md b/Algorithms/0444.sequence-reconstruction/README.md new file mode 100755 index 000000000..e0c409414 --- /dev/null +++ b/Algorithms/0444.sequence-reconstruction/README.md @@ -0,0 +1,11 @@ +# [444. Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0444.sequence-reconstruction/sequence-reconstruction.go b/Algorithms/0444.sequence-reconstruction/sequence-reconstruction.go new file mode 100755 index 000000000..0289e7c1c --- /dev/null +++ b/Algorithms/0444.sequence-reconstruction/sequence-reconstruction.go @@ -0,0 +1,2 @@ +package Problem0444 + diff --git a/Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go b/Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go new file mode 100755 index 000000000..e48c1add9 --- /dev/null +++ b/Algorithms/0444.sequence-reconstruction/sequence-reconstruction_test.go @@ -0,0 +1,43 @@ +package Problem0444 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0444(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0445.add-two-numbers-ii/README.md b/Algorithms/0445.add-two-numbers-ii/README.md new file mode 100755 index 000000000..89aa7dc09 --- /dev/null +++ b/Algorithms/0445.add-two-numbers-ii/README.md @@ -0,0 +1,11 @@ +# [445. Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii.go b/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii.go new file mode 100755 index 000000000..04bb7782c --- /dev/null +++ b/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii.go @@ -0,0 +1,2 @@ +package Problem0445 + 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 new file mode 100755 index 000000000..ec1dccab1 --- /dev/null +++ b/Algorithms/0445.add-two-numbers-ii/add-two-numbers-ii_test.go @@ -0,0 +1,43 @@ +package Problem0445 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0445(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0446.arithmetic-slices-ii-subsequence/README.md b/Algorithms/0446.arithmetic-slices-ii-subsequence/README.md new file mode 100755 index 000000000..73bc08bb5 --- /dev/null +++ b/Algorithms/0446.arithmetic-slices-ii-subsequence/README.md @@ -0,0 +1,11 @@ +# [446. Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence.go b/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence.go new file mode 100755 index 000000000..c22c9de2c --- /dev/null +++ b/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence.go @@ -0,0 +1,2 @@ +package Problem0446 + 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 new file mode 100755 index 000000000..017eb4819 --- /dev/null +++ b/Algorithms/0446.arithmetic-slices-ii-subsequence/arithmetic-slices-ii-subsequence_test.go @@ -0,0 +1,43 @@ +package Problem0446 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0446(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0447.number-of-boomerangs/README.md b/Algorithms/0447.number-of-boomerangs/README.md new file mode 100755 index 000000000..9184d5f20 --- /dev/null +++ b/Algorithms/0447.number-of-boomerangs/README.md @@ -0,0 +1,11 @@ +# [447. Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0447.number-of-boomerangs/number-of-boomerangs.go b/Algorithms/0447.number-of-boomerangs/number-of-boomerangs.go new file mode 100755 index 000000000..48d01f13f --- /dev/null +++ b/Algorithms/0447.number-of-boomerangs/number-of-boomerangs.go @@ -0,0 +1,2 @@ +package Problem0447 + diff --git a/Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go b/Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go new file mode 100755 index 000000000..1f8a10708 --- /dev/null +++ b/Algorithms/0447.number-of-boomerangs/number-of-boomerangs_test.go @@ -0,0 +1,43 @@ +package Problem0447 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0447(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0448.find-all-numbers-disappeared-in-an-array/README.md b/Algorithms/0448.find-all-numbers-disappeared-in-an-array/README.md new file mode 100755 index 000000000..d63f11e24 --- /dev/null +++ b/Algorithms/0448.find-all-numbers-disappeared-in-an-array/README.md @@ -0,0 +1,11 @@ +# [448. Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array.go b/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array.go new file mode 100755 index 000000000..e07768116 --- /dev/null +++ b/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array.go @@ -0,0 +1,2 @@ +package Problem0448 + 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 new file mode 100755 index 000000000..217cb9e38 --- /dev/null +++ b/Algorithms/0448.find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array_test.go @@ -0,0 +1,43 @@ +package Problem0448 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0448(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0449.serialize-and-deserialize-bst/README.md b/Algorithms/0449.serialize-and-deserialize-bst/README.md new file mode 100755 index 000000000..d89e103ab --- /dev/null +++ b/Algorithms/0449.serialize-and-deserialize-bst/README.md @@ -0,0 +1,11 @@ +# [449. Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst.go b/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst.go new file mode 100755 index 000000000..454cd6f27 --- /dev/null +++ b/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst.go @@ -0,0 +1,2 @@ +package Problem0449 + 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 new file mode 100755 index 000000000..eaf6a33a4 --- /dev/null +++ b/Algorithms/0449.serialize-and-deserialize-bst/serialize-and-deserialize-bst_test.go @@ -0,0 +1,43 @@ +package Problem0449 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0449(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0450.delete-node-in-a-bst/README.md b/Algorithms/0450.delete-node-in-a-bst/README.md new file mode 100755 index 000000000..7f5cb50bc --- /dev/null +++ b/Algorithms/0450.delete-node-in-a-bst/README.md @@ -0,0 +1,11 @@ +# [450. Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst.go b/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst.go new file mode 100755 index 000000000..626d7ff53 --- /dev/null +++ b/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst.go @@ -0,0 +1,2 @@ +package Problem0450 + 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 new file mode 100755 index 000000000..0cd6c59e6 --- /dev/null +++ b/Algorithms/0450.delete-node-in-a-bst/delete-node-in-a-bst_test.go @@ -0,0 +1,43 @@ +package Problem0450 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0450(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0451.sort-characters-by-frequency/README.md b/Algorithms/0451.sort-characters-by-frequency/README.md new file mode 100755 index 000000000..1ad0eb993 --- /dev/null +++ b/Algorithms/0451.sort-characters-by-frequency/README.md @@ -0,0 +1,11 @@ +# [451. Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency.go b/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency.go new file mode 100755 index 000000000..fdd13229d --- /dev/null +++ b/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency.go @@ -0,0 +1,2 @@ +package Problem0451 + 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 new file mode 100755 index 000000000..ffe46a3b1 --- /dev/null +++ b/Algorithms/0451.sort-characters-by-frequency/sort-characters-by-frequency_test.go @@ -0,0 +1,43 @@ +package Problem0451 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0451(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/README.md b/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/README.md new file mode 100755 index 000000000..b8c6036db --- /dev/null +++ b/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/README.md @@ -0,0 +1,11 @@ +# [452. Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons.go b/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons.go new file mode 100755 index 000000000..002aa4039 --- /dev/null +++ b/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons.go @@ -0,0 +1,2 @@ +package Problem0452 + 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 new file mode 100755 index 000000000..43169460a --- /dev/null +++ b/Algorithms/0452.minimum-number-of-arrows-to-burst-balloons/minimum-number-of-arrows-to-burst-balloons_test.go @@ -0,0 +1,43 @@ +package Problem0452 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0452(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0453.minimum-moves-to-equal-array-elements/README.md b/Algorithms/0453.minimum-moves-to-equal-array-elements/README.md new file mode 100755 index 000000000..48658ce40 --- /dev/null +++ b/Algorithms/0453.minimum-moves-to-equal-array-elements/README.md @@ -0,0 +1,11 @@ +# [453. Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements.go b/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements.go new file mode 100755 index 000000000..d15fcaea5 --- /dev/null +++ b/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements.go @@ -0,0 +1,2 @@ +package Problem0453 + 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 new file mode 100755 index 000000000..729ca9bb0 --- /dev/null +++ b/Algorithms/0453.minimum-moves-to-equal-array-elements/minimum-moves-to-equal-array-elements_test.go @@ -0,0 +1,43 @@ +package Problem0453 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0453(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0454.4sum-ii/4sum-ii.go b/Algorithms/0454.4sum-ii/4sum-ii.go new file mode 100755 index 000000000..65bb9d8d6 --- /dev/null +++ b/Algorithms/0454.4sum-ii/4sum-ii.go @@ -0,0 +1,2 @@ +package Problem0454 + diff --git a/Algorithms/0454.4sum-ii/4sum-ii_test.go b/Algorithms/0454.4sum-ii/4sum-ii_test.go new file mode 100755 index 000000000..45f8913b5 --- /dev/null +++ b/Algorithms/0454.4sum-ii/4sum-ii_test.go @@ -0,0 +1,43 @@ +package Problem0454 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0454(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0454.4sum-ii/README.md b/Algorithms/0454.4sum-ii/README.md new file mode 100755 index 000000000..1030e2e86 --- /dev/null +++ b/Algorithms/0454.4sum-ii/README.md @@ -0,0 +1,11 @@ +# [454. 4Sum II](https://leetcode.com/problems/4sum-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0455.assign-cookies/README.md b/Algorithms/0455.assign-cookies/README.md new file mode 100755 index 000000000..6fe5b88b3 --- /dev/null +++ b/Algorithms/0455.assign-cookies/README.md @@ -0,0 +1,11 @@ +# [455. Assign Cookies](https://leetcode.com/problems/assign-cookies/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0455.assign-cookies/assign-cookies.go b/Algorithms/0455.assign-cookies/assign-cookies.go new file mode 100755 index 000000000..af8169e3b --- /dev/null +++ b/Algorithms/0455.assign-cookies/assign-cookies.go @@ -0,0 +1,2 @@ +package Problem0455 + diff --git a/Algorithms/0455.assign-cookies/assign-cookies_test.go b/Algorithms/0455.assign-cookies/assign-cookies_test.go new file mode 100755 index 000000000..75a79d7bb --- /dev/null +++ b/Algorithms/0455.assign-cookies/assign-cookies_test.go @@ -0,0 +1,43 @@ +package Problem0455 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0455(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0456.132-pattern/132-pattern.go b/Algorithms/0456.132-pattern/132-pattern.go new file mode 100755 index 000000000..5e87029ed --- /dev/null +++ b/Algorithms/0456.132-pattern/132-pattern.go @@ -0,0 +1,2 @@ +package Problem0456 + diff --git a/Algorithms/0456.132-pattern/132-pattern_test.go b/Algorithms/0456.132-pattern/132-pattern_test.go new file mode 100755 index 000000000..3d00114f1 --- /dev/null +++ b/Algorithms/0456.132-pattern/132-pattern_test.go @@ -0,0 +1,43 @@ +package Problem0456 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0456(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0456.132-pattern/README.md b/Algorithms/0456.132-pattern/README.md new file mode 100755 index 000000000..6c1e91c71 --- /dev/null +++ b/Algorithms/0456.132-pattern/README.md @@ -0,0 +1,11 @@ +# [456. 132 Pattern](https://leetcode.com/problems/132-pattern/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0459.repeated-substring-pattern/README.md b/Algorithms/0459.repeated-substring-pattern/README.md new file mode 100755 index 000000000..9f5785528 --- /dev/null +++ b/Algorithms/0459.repeated-substring-pattern/README.md @@ -0,0 +1,11 @@ +# [459. Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern.go b/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern.go new file mode 100755 index 000000000..942b019d4 --- /dev/null +++ b/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern.go @@ -0,0 +1,2 @@ +package Problem0459 + diff --git a/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go b/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go new file mode 100755 index 000000000..7f9e5b320 --- /dev/null +++ b/Algorithms/0459.repeated-substring-pattern/repeated-substring-pattern_test.go @@ -0,0 +1,43 @@ +package Problem0459 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0459(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0460.lfu-cache/README.md b/Algorithms/0460.lfu-cache/README.md new file mode 100755 index 000000000..5b5483c20 --- /dev/null +++ b/Algorithms/0460.lfu-cache/README.md @@ -0,0 +1,11 @@ +# [460. LFU Cache](https://leetcode.com/problems/lfu-cache/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0460.lfu-cache/lfu-cache.go b/Algorithms/0460.lfu-cache/lfu-cache.go new file mode 100755 index 000000000..d5bb42379 --- /dev/null +++ b/Algorithms/0460.lfu-cache/lfu-cache.go @@ -0,0 +1,2 @@ +package Problem0460 + diff --git a/Algorithms/0460.lfu-cache/lfu-cache_test.go b/Algorithms/0460.lfu-cache/lfu-cache_test.go new file mode 100755 index 000000000..edc3b870f --- /dev/null +++ b/Algorithms/0460.lfu-cache/lfu-cache_test.go @@ -0,0 +1,43 @@ +package Problem0460 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0460(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0461.hamming-distance/README.md b/Algorithms/0461.hamming-distance/README.md new file mode 100755 index 000000000..a85e026a7 --- /dev/null +++ b/Algorithms/0461.hamming-distance/README.md @@ -0,0 +1,11 @@ +# [461. Hamming Distance](https://leetcode.com/problems/hamming-distance/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0461.hamming-distance/hamming-distance.go b/Algorithms/0461.hamming-distance/hamming-distance.go new file mode 100755 index 000000000..f4ac627a3 --- /dev/null +++ b/Algorithms/0461.hamming-distance/hamming-distance.go @@ -0,0 +1,2 @@ +package Problem0461 + diff --git a/Algorithms/0461.hamming-distance/hamming-distance_test.go b/Algorithms/0461.hamming-distance/hamming-distance_test.go new file mode 100755 index 000000000..44b7f6fc9 --- /dev/null +++ b/Algorithms/0461.hamming-distance/hamming-distance_test.go @@ -0,0 +1,43 @@ +package Problem0461 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0461(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/README.md b/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/README.md new file mode 100755 index 000000000..32fb94c3e --- /dev/null +++ b/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/README.md @@ -0,0 +1,11 @@ +# [462. Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii.go b/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii.go new file mode 100755 index 000000000..761881a4f --- /dev/null +++ b/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii.go @@ -0,0 +1,2 @@ +package Problem0462 + 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 new file mode 100755 index 000000000..229d0d755 --- /dev/null +++ b/Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii_test.go @@ -0,0 +1,43 @@ +package Problem0462 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0462(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0463.island-perimeter/README.md b/Algorithms/0463.island-perimeter/README.md new file mode 100755 index 000000000..95bebe260 --- /dev/null +++ b/Algorithms/0463.island-perimeter/README.md @@ -0,0 +1,11 @@ +# [463. Island Perimeter](https://leetcode.com/problems/island-perimeter/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0463.island-perimeter/island-perimeter.go b/Algorithms/0463.island-perimeter/island-perimeter.go new file mode 100755 index 000000000..bd0218195 --- /dev/null +++ b/Algorithms/0463.island-perimeter/island-perimeter.go @@ -0,0 +1,2 @@ +package Problem0463 + diff --git a/Algorithms/0463.island-perimeter/island-perimeter_test.go b/Algorithms/0463.island-perimeter/island-perimeter_test.go new file mode 100755 index 000000000..b77966021 --- /dev/null +++ b/Algorithms/0463.island-perimeter/island-perimeter_test.go @@ -0,0 +1,43 @@ +package Problem0463 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0463(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0464.can-i-win/README.md b/Algorithms/0464.can-i-win/README.md new file mode 100755 index 000000000..328a8ee69 --- /dev/null +++ b/Algorithms/0464.can-i-win/README.md @@ -0,0 +1,11 @@ +# [464. Can I Win](https://leetcode.com/problems/can-i-win/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0464.can-i-win/can-i-win.go b/Algorithms/0464.can-i-win/can-i-win.go new file mode 100755 index 000000000..da9fd80aa --- /dev/null +++ b/Algorithms/0464.can-i-win/can-i-win.go @@ -0,0 +1,2 @@ +package Problem0464 + diff --git a/Algorithms/0464.can-i-win/can-i-win_test.go b/Algorithms/0464.can-i-win/can-i-win_test.go new file mode 100755 index 000000000..37cd79d17 --- /dev/null +++ b/Algorithms/0464.can-i-win/can-i-win_test.go @@ -0,0 +1,43 @@ +package Problem0464 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0464(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0465.optimal-account-balancing/README.md b/Algorithms/0465.optimal-account-balancing/README.md new file mode 100755 index 000000000..bfd3554d2 --- /dev/null +++ b/Algorithms/0465.optimal-account-balancing/README.md @@ -0,0 +1,11 @@ +# [465. Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0465.optimal-account-balancing/optimal-account-balancing.go b/Algorithms/0465.optimal-account-balancing/optimal-account-balancing.go new file mode 100755 index 000000000..2f62a5ddf --- /dev/null +++ b/Algorithms/0465.optimal-account-balancing/optimal-account-balancing.go @@ -0,0 +1,2 @@ +package Problem0465 + diff --git a/Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go b/Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go new file mode 100755 index 000000000..2fc5c41a3 --- /dev/null +++ b/Algorithms/0465.optimal-account-balancing/optimal-account-balancing_test.go @@ -0,0 +1,43 @@ +package Problem0465 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0465(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0466.count-the-repetitions/README.md b/Algorithms/0466.count-the-repetitions/README.md new file mode 100755 index 000000000..83d266346 --- /dev/null +++ b/Algorithms/0466.count-the-repetitions/README.md @@ -0,0 +1,11 @@ +# [466. Count The Repetitions](https://leetcode.com/problems/count-the-repetitions/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0466.count-the-repetitions/count-the-repetitions.go b/Algorithms/0466.count-the-repetitions/count-the-repetitions.go new file mode 100755 index 000000000..3fd226646 --- /dev/null +++ b/Algorithms/0466.count-the-repetitions/count-the-repetitions.go @@ -0,0 +1,2 @@ +package Problem0466 + diff --git a/Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go b/Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go new file mode 100755 index 000000000..5afe794eb --- /dev/null +++ b/Algorithms/0466.count-the-repetitions/count-the-repetitions_test.go @@ -0,0 +1,43 @@ +package Problem0466 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0466(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0467.unique-substrings-in-wraparound-string/README.md b/Algorithms/0467.unique-substrings-in-wraparound-string/README.md new file mode 100755 index 000000000..09a2639b0 --- /dev/null +++ b/Algorithms/0467.unique-substrings-in-wraparound-string/README.md @@ -0,0 +1,11 @@ +# [467. Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string.go b/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string.go new file mode 100755 index 000000000..b3a5e0cb8 --- /dev/null +++ b/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string.go @@ -0,0 +1,2 @@ +package Problem0467 + 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 new file mode 100755 index 000000000..59e28e560 --- /dev/null +++ b/Algorithms/0467.unique-substrings-in-wraparound-string/unique-substrings-in-wraparound-string_test.go @@ -0,0 +1,43 @@ +package Problem0467 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0467(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0468.validate-ip-address/README.md b/Algorithms/0468.validate-ip-address/README.md new file mode 100755 index 000000000..64401f385 --- /dev/null +++ b/Algorithms/0468.validate-ip-address/README.md @@ -0,0 +1,11 @@ +# [468. Validate IP Address](https://leetcode.com/problems/validate-ip-address/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0468.validate-ip-address/validate-ip-address.go b/Algorithms/0468.validate-ip-address/validate-ip-address.go new file mode 100755 index 000000000..807ea5527 --- /dev/null +++ b/Algorithms/0468.validate-ip-address/validate-ip-address.go @@ -0,0 +1,2 @@ +package Problem0468 + diff --git a/Algorithms/0468.validate-ip-address/validate-ip-address_test.go b/Algorithms/0468.validate-ip-address/validate-ip-address_test.go new file mode 100755 index 000000000..24dcf480d --- /dev/null +++ b/Algorithms/0468.validate-ip-address/validate-ip-address_test.go @@ -0,0 +1,43 @@ +package Problem0468 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0468(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0469.convex-polygon/README.md b/Algorithms/0469.convex-polygon/README.md new file mode 100755 index 000000000..832351eac --- /dev/null +++ b/Algorithms/0469.convex-polygon/README.md @@ -0,0 +1,11 @@ +# [469. Convex Polygon](https://leetcode.com/problems/convex-polygon/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0469.convex-polygon/convex-polygon.go b/Algorithms/0469.convex-polygon/convex-polygon.go new file mode 100755 index 000000000..249851d80 --- /dev/null +++ b/Algorithms/0469.convex-polygon/convex-polygon.go @@ -0,0 +1,2 @@ +package Problem0469 + diff --git a/Algorithms/0469.convex-polygon/convex-polygon_test.go b/Algorithms/0469.convex-polygon/convex-polygon_test.go new file mode 100755 index 000000000..45589da21 --- /dev/null +++ b/Algorithms/0469.convex-polygon/convex-polygon_test.go @@ -0,0 +1,43 @@ +package Problem0469 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0469(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0471.encode-string-with-shortest-length/README.md b/Algorithms/0471.encode-string-with-shortest-length/README.md new file mode 100755 index 000000000..2140d2ebf --- /dev/null +++ b/Algorithms/0471.encode-string-with-shortest-length/README.md @@ -0,0 +1,11 @@ +# [471. Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length.go b/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length.go new file mode 100755 index 000000000..e070ec2e4 --- /dev/null +++ b/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length.go @@ -0,0 +1,2 @@ +package Problem0471 + 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 new file mode 100755 index 000000000..c53857e3b --- /dev/null +++ b/Algorithms/0471.encode-string-with-shortest-length/encode-string-with-shortest-length_test.go @@ -0,0 +1,43 @@ +package Problem0471 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0471(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0472.concatenated-words/README.md b/Algorithms/0472.concatenated-words/README.md new file mode 100755 index 000000000..7b9961460 --- /dev/null +++ b/Algorithms/0472.concatenated-words/README.md @@ -0,0 +1,11 @@ +# [472. Concatenated Words](https://leetcode.com/problems/concatenated-words/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0472.concatenated-words/concatenated-words.go b/Algorithms/0472.concatenated-words/concatenated-words.go new file mode 100755 index 000000000..87871243c --- /dev/null +++ b/Algorithms/0472.concatenated-words/concatenated-words.go @@ -0,0 +1,2 @@ +package Problem0472 + diff --git a/Algorithms/0472.concatenated-words/concatenated-words_test.go b/Algorithms/0472.concatenated-words/concatenated-words_test.go new file mode 100755 index 000000000..f9f0f6427 --- /dev/null +++ b/Algorithms/0472.concatenated-words/concatenated-words_test.go @@ -0,0 +1,43 @@ +package Problem0472 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0472(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0473.matchsticks-to-square/README.md b/Algorithms/0473.matchsticks-to-square/README.md new file mode 100755 index 000000000..eefc73510 --- /dev/null +++ b/Algorithms/0473.matchsticks-to-square/README.md @@ -0,0 +1,11 @@ +# [473. Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0473.matchsticks-to-square/matchsticks-to-square.go b/Algorithms/0473.matchsticks-to-square/matchsticks-to-square.go new file mode 100755 index 000000000..fe174ffb5 --- /dev/null +++ b/Algorithms/0473.matchsticks-to-square/matchsticks-to-square.go @@ -0,0 +1,2 @@ +package Problem0473 + diff --git a/Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go b/Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go new file mode 100755 index 000000000..9cbc07d4a --- /dev/null +++ b/Algorithms/0473.matchsticks-to-square/matchsticks-to-square_test.go @@ -0,0 +1,43 @@ +package Problem0473 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0473(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0474.ones-and-zeroes/README.md b/Algorithms/0474.ones-and-zeroes/README.md new file mode 100755 index 000000000..a48ea9a6a --- /dev/null +++ b/Algorithms/0474.ones-and-zeroes/README.md @@ -0,0 +1,11 @@ +# [474. Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0474.ones-and-zeroes/ones-and-zeroes.go b/Algorithms/0474.ones-and-zeroes/ones-and-zeroes.go new file mode 100755 index 000000000..411a80106 --- /dev/null +++ b/Algorithms/0474.ones-and-zeroes/ones-and-zeroes.go @@ -0,0 +1,2 @@ +package Problem0474 + diff --git a/Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go b/Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go new file mode 100755 index 000000000..681bf1879 --- /dev/null +++ b/Algorithms/0474.ones-and-zeroes/ones-and-zeroes_test.go @@ -0,0 +1,43 @@ +package Problem0474 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0474(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0475.heaters/README.md b/Algorithms/0475.heaters/README.md new file mode 100755 index 000000000..f112867d3 --- /dev/null +++ b/Algorithms/0475.heaters/README.md @@ -0,0 +1,11 @@ +# [475. Heaters](https://leetcode.com/problems/heaters/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0475.heaters/heaters.go b/Algorithms/0475.heaters/heaters.go new file mode 100755 index 000000000..0175fb64a --- /dev/null +++ b/Algorithms/0475.heaters/heaters.go @@ -0,0 +1,2 @@ +package Problem0475 + diff --git a/Algorithms/0475.heaters/heaters_test.go b/Algorithms/0475.heaters/heaters_test.go new file mode 100755 index 000000000..cab4d7cbc --- /dev/null +++ b/Algorithms/0475.heaters/heaters_test.go @@ -0,0 +1,43 @@ +package Problem0475 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0475(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0476.number-complement/README.md b/Algorithms/0476.number-complement/README.md new file mode 100755 index 000000000..b3fc92f2b --- /dev/null +++ b/Algorithms/0476.number-complement/README.md @@ -0,0 +1,11 @@ +# [476. Number Complement](https://leetcode.com/problems/number-complement/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0476.number-complement/number-complement.go b/Algorithms/0476.number-complement/number-complement.go new file mode 100755 index 000000000..6830cbbec --- /dev/null +++ b/Algorithms/0476.number-complement/number-complement.go @@ -0,0 +1,2 @@ +package Problem0476 + diff --git a/Algorithms/0476.number-complement/number-complement_test.go b/Algorithms/0476.number-complement/number-complement_test.go new file mode 100755 index 000000000..c861cdf32 --- /dev/null +++ b/Algorithms/0476.number-complement/number-complement_test.go @@ -0,0 +1,43 @@ +package Problem0476 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0476(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0477.total-hamming-distance/README.md b/Algorithms/0477.total-hamming-distance/README.md new file mode 100755 index 000000000..b64ca4f89 --- /dev/null +++ b/Algorithms/0477.total-hamming-distance/README.md @@ -0,0 +1,11 @@ +# [477. Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0477.total-hamming-distance/total-hamming-distance.go b/Algorithms/0477.total-hamming-distance/total-hamming-distance.go new file mode 100755 index 000000000..e85a3ffe6 --- /dev/null +++ b/Algorithms/0477.total-hamming-distance/total-hamming-distance.go @@ -0,0 +1,2 @@ +package Problem0477 + diff --git a/Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go b/Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go new file mode 100755 index 000000000..4e80e07d0 --- /dev/null +++ b/Algorithms/0477.total-hamming-distance/total-hamming-distance_test.go @@ -0,0 +1,43 @@ +package Problem0477 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0477(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0479.largest-palindrome-product/README.md b/Algorithms/0479.largest-palindrome-product/README.md new file mode 100755 index 000000000..7383f55ae --- /dev/null +++ b/Algorithms/0479.largest-palindrome-product/README.md @@ -0,0 +1,11 @@ +# [479. Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0479.largest-palindrome-product/largest-palindrome-product.go b/Algorithms/0479.largest-palindrome-product/largest-palindrome-product.go new file mode 100755 index 000000000..aefa811bd --- /dev/null +++ b/Algorithms/0479.largest-palindrome-product/largest-palindrome-product.go @@ -0,0 +1,2 @@ +package Problem0479 + diff --git a/Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go b/Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go new file mode 100755 index 000000000..db24bc66b --- /dev/null +++ b/Algorithms/0479.largest-palindrome-product/largest-palindrome-product_test.go @@ -0,0 +1,43 @@ +package Problem0479 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0479(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0480.sliding-window-median/README.md b/Algorithms/0480.sliding-window-median/README.md new file mode 100755 index 000000000..d17983419 --- /dev/null +++ b/Algorithms/0480.sliding-window-median/README.md @@ -0,0 +1,11 @@ +# [480. Sliding Window Median](https://leetcode.com/problems/sliding-window-median/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0480.sliding-window-median/sliding-window-median.go b/Algorithms/0480.sliding-window-median/sliding-window-median.go new file mode 100755 index 000000000..36dbb7ef3 --- /dev/null +++ b/Algorithms/0480.sliding-window-median/sliding-window-median.go @@ -0,0 +1,2 @@ +package Problem0480 + diff --git a/Algorithms/0480.sliding-window-median/sliding-window-median_test.go b/Algorithms/0480.sliding-window-median/sliding-window-median_test.go new file mode 100755 index 000000000..378dca980 --- /dev/null +++ b/Algorithms/0480.sliding-window-median/sliding-window-median_test.go @@ -0,0 +1,43 @@ +package Problem0480 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0480(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0481.magical-string/README.md b/Algorithms/0481.magical-string/README.md new file mode 100755 index 000000000..e0ad5fb5a --- /dev/null +++ b/Algorithms/0481.magical-string/README.md @@ -0,0 +1,11 @@ +# [481. Magical String](https://leetcode.com/problems/magical-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0481.magical-string/magical-string.go b/Algorithms/0481.magical-string/magical-string.go new file mode 100755 index 000000000..9fca992cd --- /dev/null +++ b/Algorithms/0481.magical-string/magical-string.go @@ -0,0 +1,2 @@ +package Problem0481 + diff --git a/Algorithms/0481.magical-string/magical-string_test.go b/Algorithms/0481.magical-string/magical-string_test.go new file mode 100755 index 000000000..7d7dc6ce0 --- /dev/null +++ b/Algorithms/0481.magical-string/magical-string_test.go @@ -0,0 +1,43 @@ +package Problem0481 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0481(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0482.license-key-formatting/README.md b/Algorithms/0482.license-key-formatting/README.md new file mode 100755 index 000000000..7fb8c25d0 --- /dev/null +++ b/Algorithms/0482.license-key-formatting/README.md @@ -0,0 +1,11 @@ +# [482. License Key Formatting](https://leetcode.com/problems/license-key-formatting/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0482.license-key-formatting/license-key-formatting.go b/Algorithms/0482.license-key-formatting/license-key-formatting.go new file mode 100755 index 000000000..54e9f5d02 --- /dev/null +++ b/Algorithms/0482.license-key-formatting/license-key-formatting.go @@ -0,0 +1,2 @@ +package Problem0482 + diff --git a/Algorithms/0482.license-key-formatting/license-key-formatting_test.go b/Algorithms/0482.license-key-formatting/license-key-formatting_test.go new file mode 100755 index 000000000..69af79781 --- /dev/null +++ b/Algorithms/0482.license-key-formatting/license-key-formatting_test.go @@ -0,0 +1,43 @@ +package Problem0482 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0482(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0483.smallest-good-base/README.md b/Algorithms/0483.smallest-good-base/README.md new file mode 100755 index 000000000..645e12e78 --- /dev/null +++ b/Algorithms/0483.smallest-good-base/README.md @@ -0,0 +1,11 @@ +# [483. Smallest Good Base](https://leetcode.com/problems/smallest-good-base/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0483.smallest-good-base/smallest-good-base.go b/Algorithms/0483.smallest-good-base/smallest-good-base.go new file mode 100755 index 000000000..51cc5924a --- /dev/null +++ b/Algorithms/0483.smallest-good-base/smallest-good-base.go @@ -0,0 +1,2 @@ +package Problem0483 + diff --git a/Algorithms/0483.smallest-good-base/smallest-good-base_test.go b/Algorithms/0483.smallest-good-base/smallest-good-base_test.go new file mode 100755 index 000000000..0641d407d --- /dev/null +++ b/Algorithms/0483.smallest-good-base/smallest-good-base_test.go @@ -0,0 +1,43 @@ +package Problem0483 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0483(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0484.find-permutation/README.md b/Algorithms/0484.find-permutation/README.md new file mode 100755 index 000000000..5ed0a868c --- /dev/null +++ b/Algorithms/0484.find-permutation/README.md @@ -0,0 +1,11 @@ +# [484. Find Permutation](https://leetcode.com/problems/find-permutation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0484.find-permutation/find-permutation.go b/Algorithms/0484.find-permutation/find-permutation.go new file mode 100755 index 000000000..bceb562a2 --- /dev/null +++ b/Algorithms/0484.find-permutation/find-permutation.go @@ -0,0 +1,2 @@ +package Problem0484 + diff --git a/Algorithms/0484.find-permutation/find-permutation_test.go b/Algorithms/0484.find-permutation/find-permutation_test.go new file mode 100755 index 000000000..e75fc3f28 --- /dev/null +++ b/Algorithms/0484.find-permutation/find-permutation_test.go @@ -0,0 +1,43 @@ +package Problem0484 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0484(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0485.max-consecutive-ones/README.md b/Algorithms/0485.max-consecutive-ones/README.md new file mode 100755 index 000000000..3c69664c3 --- /dev/null +++ b/Algorithms/0485.max-consecutive-ones/README.md @@ -0,0 +1,11 @@ +# [485. Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0485.max-consecutive-ones/max-consecutive-ones.go b/Algorithms/0485.max-consecutive-ones/max-consecutive-ones.go new file mode 100755 index 000000000..3825c59ad --- /dev/null +++ b/Algorithms/0485.max-consecutive-ones/max-consecutive-ones.go @@ -0,0 +1,2 @@ +package Problem0485 + diff --git a/Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go b/Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go new file mode 100755 index 000000000..e6b58a3d6 --- /dev/null +++ b/Algorithms/0485.max-consecutive-ones/max-consecutive-ones_test.go @@ -0,0 +1,43 @@ +package Problem0485 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0485(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0486.predict-the-winner/README.md b/Algorithms/0486.predict-the-winner/README.md new file mode 100755 index 000000000..cfb92d829 --- /dev/null +++ b/Algorithms/0486.predict-the-winner/README.md @@ -0,0 +1,11 @@ +# [486. Predict the Winner](https://leetcode.com/problems/predict-the-winner/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0486.predict-the-winner/predict-the-winner.go b/Algorithms/0486.predict-the-winner/predict-the-winner.go new file mode 100755 index 000000000..ec3830dfb --- /dev/null +++ b/Algorithms/0486.predict-the-winner/predict-the-winner.go @@ -0,0 +1,2 @@ +package Problem0486 + diff --git a/Algorithms/0486.predict-the-winner/predict-the-winner_test.go b/Algorithms/0486.predict-the-winner/predict-the-winner_test.go new file mode 100755 index 000000000..adc3ec994 --- /dev/null +++ b/Algorithms/0486.predict-the-winner/predict-the-winner_test.go @@ -0,0 +1,43 @@ +package Problem0486 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0486(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0487.max-consecutive-ones-ii/README.md b/Algorithms/0487.max-consecutive-ones-ii/README.md new file mode 100755 index 000000000..28c896916 --- /dev/null +++ b/Algorithms/0487.max-consecutive-ones-ii/README.md @@ -0,0 +1,11 @@ +# [487. Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii.go b/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii.go new file mode 100755 index 000000000..4b5919b33 --- /dev/null +++ b/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii.go @@ -0,0 +1,2 @@ +package Problem0487 + 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 new file mode 100755 index 000000000..0788799dc --- /dev/null +++ b/Algorithms/0487.max-consecutive-ones-ii/max-consecutive-ones-ii_test.go @@ -0,0 +1,43 @@ +package Problem0487 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0487(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0488.zuma-game/README.md b/Algorithms/0488.zuma-game/README.md new file mode 100755 index 000000000..456330a77 --- /dev/null +++ b/Algorithms/0488.zuma-game/README.md @@ -0,0 +1,11 @@ +# [488. Zuma Game](https://leetcode.com/problems/zuma-game/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0488.zuma-game/zuma-game.go b/Algorithms/0488.zuma-game/zuma-game.go new file mode 100755 index 000000000..1a5ce72c3 --- /dev/null +++ b/Algorithms/0488.zuma-game/zuma-game.go @@ -0,0 +1,2 @@ +package Problem0488 + diff --git a/Algorithms/0488.zuma-game/zuma-game_test.go b/Algorithms/0488.zuma-game/zuma-game_test.go new file mode 100755 index 000000000..253bc97c3 --- /dev/null +++ b/Algorithms/0488.zuma-game/zuma-game_test.go @@ -0,0 +1,43 @@ +package Problem0488 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0488(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0490.the-maze/README.md b/Algorithms/0490.the-maze/README.md new file mode 100755 index 000000000..d72fcf4a9 --- /dev/null +++ b/Algorithms/0490.the-maze/README.md @@ -0,0 +1,11 @@ +# [490. The Maze](https://leetcode.com/problems/the-maze/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0490.the-maze/the-maze.go b/Algorithms/0490.the-maze/the-maze.go new file mode 100755 index 000000000..21260d890 --- /dev/null +++ b/Algorithms/0490.the-maze/the-maze.go @@ -0,0 +1,2 @@ +package Problem0490 + diff --git a/Algorithms/0490.the-maze/the-maze_test.go b/Algorithms/0490.the-maze/the-maze_test.go new file mode 100755 index 000000000..50f293026 --- /dev/null +++ b/Algorithms/0490.the-maze/the-maze_test.go @@ -0,0 +1,43 @@ +package Problem0490 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0490(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0491.increasing-subsequences/README.md b/Algorithms/0491.increasing-subsequences/README.md new file mode 100755 index 000000000..d47a71c20 --- /dev/null +++ b/Algorithms/0491.increasing-subsequences/README.md @@ -0,0 +1,11 @@ +# [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0491.increasing-subsequences/increasing-subsequences.go b/Algorithms/0491.increasing-subsequences/increasing-subsequences.go new file mode 100755 index 000000000..84374b585 --- /dev/null +++ b/Algorithms/0491.increasing-subsequences/increasing-subsequences.go @@ -0,0 +1,2 @@ +package Problem0491 + diff --git a/Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go b/Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go new file mode 100755 index 000000000..5aff1a4fb --- /dev/null +++ b/Algorithms/0491.increasing-subsequences/increasing-subsequences_test.go @@ -0,0 +1,43 @@ +package Problem0491 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0491(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0492.construct-the-rectangle/README.md b/Algorithms/0492.construct-the-rectangle/README.md new file mode 100755 index 000000000..bfd2ade85 --- /dev/null +++ b/Algorithms/0492.construct-the-rectangle/README.md @@ -0,0 +1,11 @@ +# [492. Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0492.construct-the-rectangle/construct-the-rectangle.go b/Algorithms/0492.construct-the-rectangle/construct-the-rectangle.go new file mode 100755 index 000000000..a81152a12 --- /dev/null +++ b/Algorithms/0492.construct-the-rectangle/construct-the-rectangle.go @@ -0,0 +1,2 @@ +package Problem0492 + diff --git a/Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go b/Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go new file mode 100755 index 000000000..5973a652e --- /dev/null +++ b/Algorithms/0492.construct-the-rectangle/construct-the-rectangle_test.go @@ -0,0 +1,43 @@ +package Problem0492 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0492(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0493.reverse-pairs/README.md b/Algorithms/0493.reverse-pairs/README.md new file mode 100755 index 000000000..5743e62c3 --- /dev/null +++ b/Algorithms/0493.reverse-pairs/README.md @@ -0,0 +1,11 @@ +# [493. Reverse Pairs](https://leetcode.com/problems/reverse-pairs/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0493.reverse-pairs/reverse-pairs.go b/Algorithms/0493.reverse-pairs/reverse-pairs.go new file mode 100755 index 000000000..8113ac73a --- /dev/null +++ b/Algorithms/0493.reverse-pairs/reverse-pairs.go @@ -0,0 +1,2 @@ +package Problem0493 + diff --git a/Algorithms/0493.reverse-pairs/reverse-pairs_test.go b/Algorithms/0493.reverse-pairs/reverse-pairs_test.go new file mode 100755 index 000000000..54c6ac943 --- /dev/null +++ b/Algorithms/0493.reverse-pairs/reverse-pairs_test.go @@ -0,0 +1,43 @@ +package Problem0493 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0493(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0494.target-sum/README.md b/Algorithms/0494.target-sum/README.md new file mode 100755 index 000000000..a8a788d23 --- /dev/null +++ b/Algorithms/0494.target-sum/README.md @@ -0,0 +1,11 @@ +# [494. Target Sum](https://leetcode.com/problems/target-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0494.target-sum/target-sum.go b/Algorithms/0494.target-sum/target-sum.go new file mode 100755 index 000000000..1775ded06 --- /dev/null +++ b/Algorithms/0494.target-sum/target-sum.go @@ -0,0 +1,2 @@ +package Problem0494 + diff --git a/Algorithms/0494.target-sum/target-sum_test.go b/Algorithms/0494.target-sum/target-sum_test.go new file mode 100755 index 000000000..260debaa8 --- /dev/null +++ b/Algorithms/0494.target-sum/target-sum_test.go @@ -0,0 +1,43 @@ +package Problem0494 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0494(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0495.teemo-attacking/README.md b/Algorithms/0495.teemo-attacking/README.md new file mode 100755 index 000000000..4c8a02b4b --- /dev/null +++ b/Algorithms/0495.teemo-attacking/README.md @@ -0,0 +1,11 @@ +# [495. Teemo Attacking](https://leetcode.com/problems/teemo-attacking/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0495.teemo-attacking/teemo-attacking.go b/Algorithms/0495.teemo-attacking/teemo-attacking.go new file mode 100755 index 000000000..7ad4c0f88 --- /dev/null +++ b/Algorithms/0495.teemo-attacking/teemo-attacking.go @@ -0,0 +1,2 @@ +package Problem0495 + diff --git a/Algorithms/0495.teemo-attacking/teemo-attacking_test.go b/Algorithms/0495.teemo-attacking/teemo-attacking_test.go new file mode 100755 index 000000000..e9ec2add1 --- /dev/null +++ b/Algorithms/0495.teemo-attacking/teemo-attacking_test.go @@ -0,0 +1,43 @@ +package Problem0495 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0495(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0496.next-greater-element-i/README.md b/Algorithms/0496.next-greater-element-i/README.md new file mode 100755 index 000000000..1cd1dbf5b --- /dev/null +++ b/Algorithms/0496.next-greater-element-i/README.md @@ -0,0 +1,11 @@ +# [496. Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0496.next-greater-element-i/next-greater-element-i.go b/Algorithms/0496.next-greater-element-i/next-greater-element-i.go new file mode 100755 index 000000000..22e421f3f --- /dev/null +++ b/Algorithms/0496.next-greater-element-i/next-greater-element-i.go @@ -0,0 +1,2 @@ +package Problem0496 + 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 new file mode 100755 index 000000000..360bf5204 --- /dev/null +++ b/Algorithms/0496.next-greater-element-i/next-greater-element-i_test.go @@ -0,0 +1,43 @@ +package Problem0496 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0496(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0498.diagonal-traverse/README.md b/Algorithms/0498.diagonal-traverse/README.md new file mode 100755 index 000000000..b7b17934b --- /dev/null +++ b/Algorithms/0498.diagonal-traverse/README.md @@ -0,0 +1,11 @@ +# [498. Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0498.diagonal-traverse/diagonal-traverse.go b/Algorithms/0498.diagonal-traverse/diagonal-traverse.go new file mode 100755 index 000000000..10a2b0844 --- /dev/null +++ b/Algorithms/0498.diagonal-traverse/diagonal-traverse.go @@ -0,0 +1,2 @@ +package Problem0498 + diff --git a/Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go b/Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go new file mode 100755 index 000000000..10fddee15 --- /dev/null +++ b/Algorithms/0498.diagonal-traverse/diagonal-traverse_test.go @@ -0,0 +1,43 @@ +package Problem0498 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0498(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0499.the-maze-iii/README.md b/Algorithms/0499.the-maze-iii/README.md new file mode 100755 index 000000000..4834eb74a --- /dev/null +++ b/Algorithms/0499.the-maze-iii/README.md @@ -0,0 +1,11 @@ +# [499. The Maze III](https://leetcode.com/problems/the-maze-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0499.the-maze-iii/the-maze-iii.go b/Algorithms/0499.the-maze-iii/the-maze-iii.go new file mode 100755 index 000000000..9f07ca398 --- /dev/null +++ b/Algorithms/0499.the-maze-iii/the-maze-iii.go @@ -0,0 +1,2 @@ +package Problem0499 + diff --git a/Algorithms/0499.the-maze-iii/the-maze-iii_test.go b/Algorithms/0499.the-maze-iii/the-maze-iii_test.go new file mode 100755 index 000000000..2c62724c3 --- /dev/null +++ b/Algorithms/0499.the-maze-iii/the-maze-iii_test.go @@ -0,0 +1,43 @@ +package Problem0499 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0499(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0500.keyboard-row/README.md b/Algorithms/0500.keyboard-row/README.md new file mode 100755 index 000000000..f957de41c --- /dev/null +++ b/Algorithms/0500.keyboard-row/README.md @@ -0,0 +1,11 @@ +# [500. Keyboard Row](https://leetcode.com/problems/keyboard-row/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0500.keyboard-row/keyboard-row.go b/Algorithms/0500.keyboard-row/keyboard-row.go new file mode 100755 index 000000000..81e64c074 --- /dev/null +++ b/Algorithms/0500.keyboard-row/keyboard-row.go @@ -0,0 +1,2 @@ +package Problem0500 + diff --git a/Algorithms/0500.keyboard-row/keyboard-row_test.go b/Algorithms/0500.keyboard-row/keyboard-row_test.go new file mode 100755 index 000000000..a26a41ed7 --- /dev/null +++ b/Algorithms/0500.keyboard-row/keyboard-row_test.go @@ -0,0 +1,43 @@ +package Problem0500 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0500(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0501.find-mode-in-binary-search-tree/README.md b/Algorithms/0501.find-mode-in-binary-search-tree/README.md new file mode 100755 index 000000000..ea6ff9d5b --- /dev/null +++ b/Algorithms/0501.find-mode-in-binary-search-tree/README.md @@ -0,0 +1,11 @@ +# [501. Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree.go b/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree.go new file mode 100755 index 000000000..b170600a2 --- /dev/null +++ b/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree.go @@ -0,0 +1,2 @@ +package Problem0501 + 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 new file mode 100755 index 000000000..8364d5be3 --- /dev/null +++ b/Algorithms/0501.find-mode-in-binary-search-tree/find-mode-in-binary-search-tree_test.go @@ -0,0 +1,43 @@ +package Problem0501 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0501(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0502.ipo/README.md b/Algorithms/0502.ipo/README.md new file mode 100755 index 000000000..308e581f6 --- /dev/null +++ b/Algorithms/0502.ipo/README.md @@ -0,0 +1,11 @@ +# [502. IPO](https://leetcode.com/problems/ipo/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0502.ipo/ipo.go b/Algorithms/0502.ipo/ipo.go new file mode 100755 index 000000000..06f123486 --- /dev/null +++ b/Algorithms/0502.ipo/ipo.go @@ -0,0 +1,2 @@ +package Problem0502 + diff --git a/Algorithms/0502.ipo/ipo_test.go b/Algorithms/0502.ipo/ipo_test.go new file mode 100755 index 000000000..f2836d608 --- /dev/null +++ b/Algorithms/0502.ipo/ipo_test.go @@ -0,0 +1,43 @@ +package Problem0502 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0502(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0503.next-greater-element-ii/README.md b/Algorithms/0503.next-greater-element-ii/README.md new file mode 100755 index 000000000..6588d6316 --- /dev/null +++ b/Algorithms/0503.next-greater-element-ii/README.md @@ -0,0 +1,11 @@ +# [503. Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0503.next-greater-element-ii/next-greater-element-ii.go b/Algorithms/0503.next-greater-element-ii/next-greater-element-ii.go new file mode 100755 index 000000000..cf8b040d6 --- /dev/null +++ b/Algorithms/0503.next-greater-element-ii/next-greater-element-ii.go @@ -0,0 +1,2 @@ +package Problem0503 + 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 new file mode 100755 index 000000000..bd39a5229 --- /dev/null +++ b/Algorithms/0503.next-greater-element-ii/next-greater-element-ii_test.go @@ -0,0 +1,43 @@ +package Problem0503 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0503(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0504.base-7/README.md b/Algorithms/0504.base-7/README.md new file mode 100755 index 000000000..04af88b8b --- /dev/null +++ b/Algorithms/0504.base-7/README.md @@ -0,0 +1,11 @@ +# [504. Base 7](https://leetcode.com/problems/base-7/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0504.base-7/base-7.go b/Algorithms/0504.base-7/base-7.go new file mode 100755 index 000000000..501bfa114 --- /dev/null +++ b/Algorithms/0504.base-7/base-7.go @@ -0,0 +1,2 @@ +package Problem0504 + diff --git a/Algorithms/0504.base-7/base-7_test.go b/Algorithms/0504.base-7/base-7_test.go new file mode 100755 index 000000000..d65e04075 --- /dev/null +++ b/Algorithms/0504.base-7/base-7_test.go @@ -0,0 +1,43 @@ +package Problem0504 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0504(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0505.the-maze-ii/README.md b/Algorithms/0505.the-maze-ii/README.md new file mode 100755 index 000000000..08f6d1f63 --- /dev/null +++ b/Algorithms/0505.the-maze-ii/README.md @@ -0,0 +1,11 @@ +# [505. The Maze II](https://leetcode.com/problems/the-maze-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0505.the-maze-ii/the-maze-ii.go b/Algorithms/0505.the-maze-ii/the-maze-ii.go new file mode 100755 index 000000000..ce7d6381c --- /dev/null +++ b/Algorithms/0505.the-maze-ii/the-maze-ii.go @@ -0,0 +1,2 @@ +package Problem0505 + diff --git a/Algorithms/0505.the-maze-ii/the-maze-ii_test.go b/Algorithms/0505.the-maze-ii/the-maze-ii_test.go new file mode 100755 index 000000000..37ac73e05 --- /dev/null +++ b/Algorithms/0505.the-maze-ii/the-maze-ii_test.go @@ -0,0 +1,43 @@ +package Problem0505 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0505(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0506.relative-ranks/README.md b/Algorithms/0506.relative-ranks/README.md new file mode 100755 index 000000000..01d8eb58d --- /dev/null +++ b/Algorithms/0506.relative-ranks/README.md @@ -0,0 +1,11 @@ +# [506. Relative Ranks](https://leetcode.com/problems/relative-ranks/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0506.relative-ranks/relative-ranks.go b/Algorithms/0506.relative-ranks/relative-ranks.go new file mode 100755 index 000000000..485b0c739 --- /dev/null +++ b/Algorithms/0506.relative-ranks/relative-ranks.go @@ -0,0 +1,2 @@ +package Problem0506 + diff --git a/Algorithms/0506.relative-ranks/relative-ranks_test.go b/Algorithms/0506.relative-ranks/relative-ranks_test.go new file mode 100755 index 000000000..bc9012a14 --- /dev/null +++ b/Algorithms/0506.relative-ranks/relative-ranks_test.go @@ -0,0 +1,43 @@ +package Problem0506 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0506(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0507.perfect-number/README.md b/Algorithms/0507.perfect-number/README.md new file mode 100755 index 000000000..90a104488 --- /dev/null +++ b/Algorithms/0507.perfect-number/README.md @@ -0,0 +1,11 @@ +# [507. Perfect Number](https://leetcode.com/problems/perfect-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0507.perfect-number/perfect-number.go b/Algorithms/0507.perfect-number/perfect-number.go new file mode 100755 index 000000000..a4ccbcce3 --- /dev/null +++ b/Algorithms/0507.perfect-number/perfect-number.go @@ -0,0 +1,2 @@ +package Problem0507 + diff --git a/Algorithms/0507.perfect-number/perfect-number_test.go b/Algorithms/0507.perfect-number/perfect-number_test.go new file mode 100755 index 000000000..b49efe03c --- /dev/null +++ b/Algorithms/0507.perfect-number/perfect-number_test.go @@ -0,0 +1,43 @@ +package Problem0507 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0507(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0508.most-frequent-subtree-sum/README.md b/Algorithms/0508.most-frequent-subtree-sum/README.md new file mode 100755 index 000000000..393f9e9c7 --- /dev/null +++ b/Algorithms/0508.most-frequent-subtree-sum/README.md @@ -0,0 +1,11 @@ +# [508. Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum.go b/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum.go new file mode 100755 index 000000000..b70878e5f --- /dev/null +++ b/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum.go @@ -0,0 +1,2 @@ +package Problem0508 + 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 new file mode 100755 index 000000000..e35fae27a --- /dev/null +++ b/Algorithms/0508.most-frequent-subtree-sum/most-frequent-subtree-sum_test.go @@ -0,0 +1,43 @@ +package Problem0508 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0508(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0513.find-bottom-left-tree-value/README.md b/Algorithms/0513.find-bottom-left-tree-value/README.md new file mode 100755 index 000000000..6be7b2f8c --- /dev/null +++ b/Algorithms/0513.find-bottom-left-tree-value/README.md @@ -0,0 +1,11 @@ +# [513. Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value.go b/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value.go new file mode 100755 index 000000000..25206b2cf --- /dev/null +++ b/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value.go @@ -0,0 +1,2 @@ +package Problem0513 + 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 new file mode 100755 index 000000000..eca8c69d8 --- /dev/null +++ b/Algorithms/0513.find-bottom-left-tree-value/find-bottom-left-tree-value_test.go @@ -0,0 +1,43 @@ +package Problem0513 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0513(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0514.freedom-trail/README.md b/Algorithms/0514.freedom-trail/README.md new file mode 100755 index 000000000..08164ec61 --- /dev/null +++ b/Algorithms/0514.freedom-trail/README.md @@ -0,0 +1,11 @@ +# [514. Freedom Trail](https://leetcode.com/problems/freedom-trail/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0514.freedom-trail/freedom-trail.go b/Algorithms/0514.freedom-trail/freedom-trail.go new file mode 100755 index 000000000..0bcbe4072 --- /dev/null +++ b/Algorithms/0514.freedom-trail/freedom-trail.go @@ -0,0 +1,2 @@ +package Problem0514 + diff --git a/Algorithms/0514.freedom-trail/freedom-trail_test.go b/Algorithms/0514.freedom-trail/freedom-trail_test.go new file mode 100755 index 000000000..c0783d2cf --- /dev/null +++ b/Algorithms/0514.freedom-trail/freedom-trail_test.go @@ -0,0 +1,43 @@ +package Problem0514 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0514(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0515.find-largest-value-in-each-tree-row/README.md b/Algorithms/0515.find-largest-value-in-each-tree-row/README.md new file mode 100755 index 000000000..cfde5e4f0 --- /dev/null +++ b/Algorithms/0515.find-largest-value-in-each-tree-row/README.md @@ -0,0 +1,11 @@ +# [515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row.go b/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row.go new file mode 100755 index 000000000..93436a0d4 --- /dev/null +++ b/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row.go @@ -0,0 +1,2 @@ +package Problem0515 + 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 new file mode 100755 index 000000000..923acf4e1 --- /dev/null +++ b/Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row_test.go @@ -0,0 +1,43 @@ +package Problem0515 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0515(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0516.longest-palindromic-subsequence/README.md b/Algorithms/0516.longest-palindromic-subsequence/README.md new file mode 100755 index 000000000..4e0367c4c --- /dev/null +++ b/Algorithms/0516.longest-palindromic-subsequence/README.md @@ -0,0 +1,11 @@ +# [516. Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence.go b/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence.go new file mode 100755 index 000000000..e75ceef46 --- /dev/null +++ b/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence.go @@ -0,0 +1,2 @@ +package Problem0516 + diff --git a/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go b/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go new file mode 100755 index 000000000..bfd73554f --- /dev/null +++ b/Algorithms/0516.longest-palindromic-subsequence/longest-palindromic-subsequence_test.go @@ -0,0 +1,43 @@ +package Problem0516 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0516(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0517.super-washing-machines/README.md b/Algorithms/0517.super-washing-machines/README.md new file mode 100755 index 000000000..075678b82 --- /dev/null +++ b/Algorithms/0517.super-washing-machines/README.md @@ -0,0 +1,11 @@ +# [517. Super Washing Machines](https://leetcode.com/problems/super-washing-machines/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0517.super-washing-machines/super-washing-machines.go b/Algorithms/0517.super-washing-machines/super-washing-machines.go new file mode 100755 index 000000000..86a6940b1 --- /dev/null +++ b/Algorithms/0517.super-washing-machines/super-washing-machines.go @@ -0,0 +1,2 @@ +package Problem0517 + diff --git a/Algorithms/0517.super-washing-machines/super-washing-machines_test.go b/Algorithms/0517.super-washing-machines/super-washing-machines_test.go new file mode 100755 index 000000000..d7f5184bb --- /dev/null +++ b/Algorithms/0517.super-washing-machines/super-washing-machines_test.go @@ -0,0 +1,43 @@ +package Problem0517 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0517(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0520.detect-capital/README.md b/Algorithms/0520.detect-capital/README.md new file mode 100755 index 000000000..b089f54cb --- /dev/null +++ b/Algorithms/0520.detect-capital/README.md @@ -0,0 +1,11 @@ +# [520. Detect Capital](https://leetcode.com/problems/detect-capital/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0520.detect-capital/detect-capital.go b/Algorithms/0520.detect-capital/detect-capital.go new file mode 100755 index 000000000..3f62cd2a8 --- /dev/null +++ b/Algorithms/0520.detect-capital/detect-capital.go @@ -0,0 +1,2 @@ +package Problem0520 + diff --git a/Algorithms/0520.detect-capital/detect-capital_test.go b/Algorithms/0520.detect-capital/detect-capital_test.go new file mode 100755 index 000000000..83deeac2f --- /dev/null +++ b/Algorithms/0520.detect-capital/detect-capital_test.go @@ -0,0 +1,43 @@ +package Problem0520 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0520(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0521.longest-uncommon-subsequence-i/README.md b/Algorithms/0521.longest-uncommon-subsequence-i/README.md new file mode 100755 index 000000000..ace6c6d37 --- /dev/null +++ b/Algorithms/0521.longest-uncommon-subsequence-i/README.md @@ -0,0 +1,11 @@ +# [521. Longest Uncommon Subsequence I ](https://leetcode.com/problems/longest-uncommon-subsequence-i/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i.go b/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i.go new file mode 100755 index 000000000..b23fff157 --- /dev/null +++ b/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i.go @@ -0,0 +1,2 @@ +package Problem0521 + 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 new file mode 100755 index 000000000..3e0438fc7 --- /dev/null +++ b/Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i_test.go @@ -0,0 +1,43 @@ +package Problem0521 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0521(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0522.longest-uncommon-subsequence-ii/README.md b/Algorithms/0522.longest-uncommon-subsequence-ii/README.md new file mode 100755 index 000000000..0d9a309f0 --- /dev/null +++ b/Algorithms/0522.longest-uncommon-subsequence-ii/README.md @@ -0,0 +1,11 @@ +# [522. Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii.go b/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii.go new file mode 100755 index 000000000..81fe543a2 --- /dev/null +++ b/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii.go @@ -0,0 +1,2 @@ +package Problem0522 + 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 new file mode 100755 index 000000000..44f43a6ea --- /dev/null +++ b/Algorithms/0522.longest-uncommon-subsequence-ii/longest-uncommon-subsequence-ii_test.go @@ -0,0 +1,43 @@ +package Problem0522 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0522(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0523.continuous-subarray-sum/README.md b/Algorithms/0523.continuous-subarray-sum/README.md new file mode 100755 index 000000000..8e71ecd4a --- /dev/null +++ b/Algorithms/0523.continuous-subarray-sum/README.md @@ -0,0 +1,11 @@ +# [523. Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum.go b/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum.go new file mode 100755 index 000000000..77de5a48c --- /dev/null +++ b/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum.go @@ -0,0 +1,2 @@ +package Problem0523 + diff --git a/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go b/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go new file mode 100755 index 000000000..98f058d95 --- /dev/null +++ b/Algorithms/0523.continuous-subarray-sum/continuous-subarray-sum_test.go @@ -0,0 +1,43 @@ +package Problem0523 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0523(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0524.longest-word-in-dictionary-through-deleting/README.md b/Algorithms/0524.longest-word-in-dictionary-through-deleting/README.md new file mode 100755 index 000000000..dfee955e3 --- /dev/null +++ b/Algorithms/0524.longest-word-in-dictionary-through-deleting/README.md @@ -0,0 +1,11 @@ +# [524. Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting.go b/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting.go new file mode 100755 index 000000000..cfbb97241 --- /dev/null +++ b/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting.go @@ -0,0 +1,2 @@ +package Problem0524 + 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 new file mode 100755 index 000000000..95c2c74af --- /dev/null +++ b/Algorithms/0524.longest-word-in-dictionary-through-deleting/longest-word-in-dictionary-through-deleting_test.go @@ -0,0 +1,43 @@ +package Problem0524 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0524(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0525.contiguous-array/README.md b/Algorithms/0525.contiguous-array/README.md new file mode 100755 index 000000000..8739903b6 --- /dev/null +++ b/Algorithms/0525.contiguous-array/README.md @@ -0,0 +1,11 @@ +# [525. Contiguous Array](https://leetcode.com/problems/contiguous-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0525.contiguous-array/contiguous-array.go b/Algorithms/0525.contiguous-array/contiguous-array.go new file mode 100755 index 000000000..bf75d7bff --- /dev/null +++ b/Algorithms/0525.contiguous-array/contiguous-array.go @@ -0,0 +1,2 @@ +package Problem0525 + diff --git a/Algorithms/0525.contiguous-array/contiguous-array_test.go b/Algorithms/0525.contiguous-array/contiguous-array_test.go new file mode 100755 index 000000000..39de93756 --- /dev/null +++ b/Algorithms/0525.contiguous-array/contiguous-array_test.go @@ -0,0 +1,43 @@ +package Problem0525 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0525(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0526.beautiful-arrangement/README.md b/Algorithms/0526.beautiful-arrangement/README.md new file mode 100755 index 000000000..e1aead8c2 --- /dev/null +++ b/Algorithms/0526.beautiful-arrangement/README.md @@ -0,0 +1,11 @@ +# [526. Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0526.beautiful-arrangement/beautiful-arrangement.go b/Algorithms/0526.beautiful-arrangement/beautiful-arrangement.go new file mode 100755 index 000000000..c43af4c20 --- /dev/null +++ b/Algorithms/0526.beautiful-arrangement/beautiful-arrangement.go @@ -0,0 +1,2 @@ +package Problem0526 + diff --git a/Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go b/Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go new file mode 100755 index 000000000..18042ab76 --- /dev/null +++ b/Algorithms/0526.beautiful-arrangement/beautiful-arrangement_test.go @@ -0,0 +1,43 @@ +package Problem0526 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0526(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0527.word-abbreviation/README.md b/Algorithms/0527.word-abbreviation/README.md new file mode 100755 index 000000000..a2e22993e --- /dev/null +++ b/Algorithms/0527.word-abbreviation/README.md @@ -0,0 +1,11 @@ +# [527. Word Abbreviation](https://leetcode.com/problems/word-abbreviation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0527.word-abbreviation/word-abbreviation.go b/Algorithms/0527.word-abbreviation/word-abbreviation.go new file mode 100755 index 000000000..ea6133818 --- /dev/null +++ b/Algorithms/0527.word-abbreviation/word-abbreviation.go @@ -0,0 +1,2 @@ +package Problem0527 + diff --git a/Algorithms/0527.word-abbreviation/word-abbreviation_test.go b/Algorithms/0527.word-abbreviation/word-abbreviation_test.go new file mode 100755 index 000000000..79709c0c6 --- /dev/null +++ b/Algorithms/0527.word-abbreviation/word-abbreviation_test.go @@ -0,0 +1,43 @@ +package Problem0527 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0527(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0529.minesweeper/README.md b/Algorithms/0529.minesweeper/README.md new file mode 100755 index 000000000..b8c2757ce --- /dev/null +++ b/Algorithms/0529.minesweeper/README.md @@ -0,0 +1,11 @@ +# [529. Minesweeper](https://leetcode.com/problems/minesweeper/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0529.minesweeper/minesweeper.go b/Algorithms/0529.minesweeper/minesweeper.go new file mode 100755 index 000000000..39e666fc7 --- /dev/null +++ b/Algorithms/0529.minesweeper/minesweeper.go @@ -0,0 +1,2 @@ +package Problem0529 + diff --git a/Algorithms/0529.minesweeper/minesweeper_test.go b/Algorithms/0529.minesweeper/minesweeper_test.go new file mode 100755 index 000000000..289c9c052 --- /dev/null +++ b/Algorithms/0529.minesweeper/minesweeper_test.go @@ -0,0 +1,43 @@ +package Problem0529 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0529(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0530.minimum-absolute-difference-in-bst/README.md b/Algorithms/0530.minimum-absolute-difference-in-bst/README.md new file mode 100755 index 000000000..bd9c82086 --- /dev/null +++ b/Algorithms/0530.minimum-absolute-difference-in-bst/README.md @@ -0,0 +1,11 @@ +# [530. Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst.go b/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst.go new file mode 100755 index 000000000..bfb7a8f07 --- /dev/null +++ b/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst.go @@ -0,0 +1,2 @@ +package Problem0530 + 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 new file mode 100755 index 000000000..a519c595a --- /dev/null +++ b/Algorithms/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst_test.go @@ -0,0 +1,43 @@ +package Problem0530 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0530(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0531.lonely-pixel-i/README.md b/Algorithms/0531.lonely-pixel-i/README.md new file mode 100755 index 000000000..23252445e --- /dev/null +++ b/Algorithms/0531.lonely-pixel-i/README.md @@ -0,0 +1,11 @@ +# [531. Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0531.lonely-pixel-i/lonely-pixel-i.go b/Algorithms/0531.lonely-pixel-i/lonely-pixel-i.go new file mode 100755 index 000000000..b1109b708 --- /dev/null +++ b/Algorithms/0531.lonely-pixel-i/lonely-pixel-i.go @@ -0,0 +1,2 @@ +package Problem0531 + diff --git a/Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go b/Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go new file mode 100755 index 000000000..5056a2d95 --- /dev/null +++ b/Algorithms/0531.lonely-pixel-i/lonely-pixel-i_test.go @@ -0,0 +1,43 @@ +package Problem0531 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0531(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0532.k-diff-pairs-in-an-array/README.md b/Algorithms/0532.k-diff-pairs-in-an-array/README.md new file mode 100755 index 000000000..d1772668f --- /dev/null +++ b/Algorithms/0532.k-diff-pairs-in-an-array/README.md @@ -0,0 +1,11 @@ +# [532. K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array.go b/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array.go new file mode 100755 index 000000000..0c317fdbe --- /dev/null +++ b/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array.go @@ -0,0 +1,2 @@ +package Problem0532 + 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 new file mode 100755 index 000000000..ac737052b --- /dev/null +++ b/Algorithms/0532.k-diff-pairs-in-an-array/k-diff-pairs-in-an-array_test.go @@ -0,0 +1,43 @@ +package Problem0532 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0532(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0533.lonely-pixel-ii/README.md b/Algorithms/0533.lonely-pixel-ii/README.md new file mode 100755 index 000000000..66fff4efe --- /dev/null +++ b/Algorithms/0533.lonely-pixel-ii/README.md @@ -0,0 +1,11 @@ +# [533. Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii.go b/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii.go new file mode 100755 index 000000000..d65251432 --- /dev/null +++ b/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii.go @@ -0,0 +1,2 @@ +package Problem0533 + diff --git a/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go b/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go new file mode 100755 index 000000000..b993bde71 --- /dev/null +++ b/Algorithms/0533.lonely-pixel-ii/lonely-pixel-ii_test.go @@ -0,0 +1,43 @@ +package Problem0533 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0533(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0535.encode-and-decode-tinyurl/README.md b/Algorithms/0535.encode-and-decode-tinyurl/README.md new file mode 100755 index 000000000..255890b2f --- /dev/null +++ b/Algorithms/0535.encode-and-decode-tinyurl/README.md @@ -0,0 +1,11 @@ +# [535. Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl.go b/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl.go new file mode 100755 index 000000000..a6cb8ed37 --- /dev/null +++ b/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl.go @@ -0,0 +1,2 @@ +package Problem0535 + 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 new file mode 100755 index 000000000..36238fb5e --- /dev/null +++ b/Algorithms/0535.encode-and-decode-tinyurl/encode-and-decode-tinyurl_test.go @@ -0,0 +1,43 @@ +package Problem0535 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0535(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0536.construct-binary-tree-from-string/README.md b/Algorithms/0536.construct-binary-tree-from-string/README.md new file mode 100755 index 000000000..7774efcc0 --- /dev/null +++ b/Algorithms/0536.construct-binary-tree-from-string/README.md @@ -0,0 +1,11 @@ +# [536. Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string.go b/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string.go new file mode 100755 index 000000000..b60e621c5 --- /dev/null +++ b/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string.go @@ -0,0 +1,2 @@ +package Problem0536 + 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 new file mode 100755 index 000000000..d6e8b4cd4 --- /dev/null +++ b/Algorithms/0536.construct-binary-tree-from-string/construct-binary-tree-from-string_test.go @@ -0,0 +1,43 @@ +package Problem0536 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0536(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0537.complex-number-multiplication/README.md b/Algorithms/0537.complex-number-multiplication/README.md new file mode 100755 index 000000000..9f1f79e36 --- /dev/null +++ b/Algorithms/0537.complex-number-multiplication/README.md @@ -0,0 +1,11 @@ +# [537. Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0537.complex-number-multiplication/complex-number-multiplication.go b/Algorithms/0537.complex-number-multiplication/complex-number-multiplication.go new file mode 100755 index 000000000..176a2f7e6 --- /dev/null +++ b/Algorithms/0537.complex-number-multiplication/complex-number-multiplication.go @@ -0,0 +1,2 @@ +package Problem0537 + diff --git a/Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go b/Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go new file mode 100755 index 000000000..92a433eff --- /dev/null +++ b/Algorithms/0537.complex-number-multiplication/complex-number-multiplication_test.go @@ -0,0 +1,43 @@ +package Problem0537 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0537(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0538.convert-bst-to-greater-tree/README.md b/Algorithms/0538.convert-bst-to-greater-tree/README.md new file mode 100755 index 000000000..225264ee4 --- /dev/null +++ b/Algorithms/0538.convert-bst-to-greater-tree/README.md @@ -0,0 +1,11 @@ +# [538. Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree.go b/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree.go new file mode 100755 index 000000000..d59de3923 --- /dev/null +++ b/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree.go @@ -0,0 +1,2 @@ +package Problem0538 + 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 new file mode 100755 index 000000000..c0d648774 --- /dev/null +++ b/Algorithms/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree_test.go @@ -0,0 +1,43 @@ +package Problem0538 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0538(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0539.minimum-time-difference/README.md b/Algorithms/0539.minimum-time-difference/README.md new file mode 100755 index 000000000..aa23a0f90 --- /dev/null +++ b/Algorithms/0539.minimum-time-difference/README.md @@ -0,0 +1,11 @@ +# [539. Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0539.minimum-time-difference/minimum-time-difference.go b/Algorithms/0539.minimum-time-difference/minimum-time-difference.go new file mode 100755 index 000000000..7c04a7d14 --- /dev/null +++ b/Algorithms/0539.minimum-time-difference/minimum-time-difference.go @@ -0,0 +1,2 @@ +package Problem0539 + diff --git a/Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go b/Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go new file mode 100755 index 000000000..a68e40034 --- /dev/null +++ b/Algorithms/0539.minimum-time-difference/minimum-time-difference_test.go @@ -0,0 +1,43 @@ +package Problem0539 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0539(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0540.single-element-in-a-sorted-array/README.md b/Algorithms/0540.single-element-in-a-sorted-array/README.md new file mode 100755 index 000000000..d80f52406 --- /dev/null +++ b/Algorithms/0540.single-element-in-a-sorted-array/README.md @@ -0,0 +1,11 @@ +# [540. Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array.go b/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array.go new file mode 100755 index 000000000..419759dfe --- /dev/null +++ b/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array.go @@ -0,0 +1,2 @@ +package Problem0540 + 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 new file mode 100755 index 000000000..aa61d70bc --- /dev/null +++ b/Algorithms/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array_test.go @@ -0,0 +1,43 @@ +package Problem0540 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0540(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0541.reverse-string-ii/README.md b/Algorithms/0541.reverse-string-ii/README.md new file mode 100755 index 000000000..4fc976cd6 --- /dev/null +++ b/Algorithms/0541.reverse-string-ii/README.md @@ -0,0 +1,11 @@ +# [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0541.reverse-string-ii/reverse-string-ii.go b/Algorithms/0541.reverse-string-ii/reverse-string-ii.go new file mode 100755 index 000000000..038df55f8 --- /dev/null +++ b/Algorithms/0541.reverse-string-ii/reverse-string-ii.go @@ -0,0 +1,2 @@ +package Problem0541 + diff --git a/Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go b/Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go new file mode 100755 index 000000000..d5d0814c7 --- /dev/null +++ b/Algorithms/0541.reverse-string-ii/reverse-string-ii_test.go @@ -0,0 +1,43 @@ +package Problem0541 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0541(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0542.01-matrix/01-matrix.go b/Algorithms/0542.01-matrix/01-matrix.go new file mode 100755 index 000000000..a0ec9d619 --- /dev/null +++ b/Algorithms/0542.01-matrix/01-matrix.go @@ -0,0 +1,2 @@ +package Problem0542 + diff --git a/Algorithms/0542.01-matrix/01-matrix_test.go b/Algorithms/0542.01-matrix/01-matrix_test.go new file mode 100755 index 000000000..889fb04a9 --- /dev/null +++ b/Algorithms/0542.01-matrix/01-matrix_test.go @@ -0,0 +1,43 @@ +package Problem0542 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0542(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0542.01-matrix/README.md b/Algorithms/0542.01-matrix/README.md new file mode 100755 index 000000000..f789a1132 --- /dev/null +++ b/Algorithms/0542.01-matrix/README.md @@ -0,0 +1,11 @@ +# [542. 01 Matrix](https://leetcode.com/problems/01-matrix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0543.diameter-of-binary-tree/README.md b/Algorithms/0543.diameter-of-binary-tree/README.md new file mode 100755 index 000000000..1e0894dc6 --- /dev/null +++ b/Algorithms/0543.diameter-of-binary-tree/README.md @@ -0,0 +1,11 @@ +# [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree.go b/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree.go new file mode 100755 index 000000000..ee6cb9342 --- /dev/null +++ b/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0543 + 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 new file mode 100755 index 000000000..44a1880fa --- /dev/null +++ b/Algorithms/0543.diameter-of-binary-tree/diameter-of-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0543 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0543(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0544.output-contest-matches/README.md b/Algorithms/0544.output-contest-matches/README.md new file mode 100755 index 000000000..6678bbc1b --- /dev/null +++ b/Algorithms/0544.output-contest-matches/README.md @@ -0,0 +1,11 @@ +# [544. Output Contest Matches](https://leetcode.com/problems/output-contest-matches/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0544.output-contest-matches/output-contest-matches.go b/Algorithms/0544.output-contest-matches/output-contest-matches.go new file mode 100755 index 000000000..0c84cf41e --- /dev/null +++ b/Algorithms/0544.output-contest-matches/output-contest-matches.go @@ -0,0 +1,2 @@ +package Problem0544 + diff --git a/Algorithms/0544.output-contest-matches/output-contest-matches_test.go b/Algorithms/0544.output-contest-matches/output-contest-matches_test.go new file mode 100755 index 000000000..b82799852 --- /dev/null +++ b/Algorithms/0544.output-contest-matches/output-contest-matches_test.go @@ -0,0 +1,43 @@ +package Problem0544 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0544(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0545.boundary-of-binary-tree/README.md b/Algorithms/0545.boundary-of-binary-tree/README.md new file mode 100755 index 000000000..d515d8b41 --- /dev/null +++ b/Algorithms/0545.boundary-of-binary-tree/README.md @@ -0,0 +1,11 @@ +# [545. Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree.go b/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree.go new file mode 100755 index 000000000..8d708310a --- /dev/null +++ b/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0545 + 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 new file mode 100755 index 000000000..f8062e858 --- /dev/null +++ b/Algorithms/0545.boundary-of-binary-tree/boundary-of-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0545 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0545(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0546.remove-boxes/README.md b/Algorithms/0546.remove-boxes/README.md new file mode 100755 index 000000000..f4eb5526b --- /dev/null +++ b/Algorithms/0546.remove-boxes/README.md @@ -0,0 +1,11 @@ +# [546. Remove Boxes](https://leetcode.com/problems/remove-boxes/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0546.remove-boxes/remove-boxes.go b/Algorithms/0546.remove-boxes/remove-boxes.go new file mode 100755 index 000000000..eb9e2a6d0 --- /dev/null +++ b/Algorithms/0546.remove-boxes/remove-boxes.go @@ -0,0 +1,2 @@ +package Problem0546 + diff --git a/Algorithms/0546.remove-boxes/remove-boxes_test.go b/Algorithms/0546.remove-boxes/remove-boxes_test.go new file mode 100755 index 000000000..2587a868e --- /dev/null +++ b/Algorithms/0546.remove-boxes/remove-boxes_test.go @@ -0,0 +1,43 @@ +package Problem0546 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0546(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0547.friend-circles/README.md b/Algorithms/0547.friend-circles/README.md new file mode 100755 index 000000000..3c64762d2 --- /dev/null +++ b/Algorithms/0547.friend-circles/README.md @@ -0,0 +1,11 @@ +# [547. Friend Circles](https://leetcode.com/problems/friend-circles/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0547.friend-circles/friend-circles.go b/Algorithms/0547.friend-circles/friend-circles.go new file mode 100755 index 000000000..9a6b6ccb0 --- /dev/null +++ b/Algorithms/0547.friend-circles/friend-circles.go @@ -0,0 +1,2 @@ +package Problem0547 + diff --git a/Algorithms/0547.friend-circles/friend-circles_test.go b/Algorithms/0547.friend-circles/friend-circles_test.go new file mode 100755 index 000000000..e099bc054 --- /dev/null +++ b/Algorithms/0547.friend-circles/friend-circles_test.go @@ -0,0 +1,43 @@ +package Problem0547 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0547(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0548.split-array-with-equal-sum/README.md b/Algorithms/0548.split-array-with-equal-sum/README.md new file mode 100755 index 000000000..80617be8e --- /dev/null +++ b/Algorithms/0548.split-array-with-equal-sum/README.md @@ -0,0 +1,11 @@ +# [548. Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum.go b/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum.go new file mode 100755 index 000000000..af07087c9 --- /dev/null +++ b/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum.go @@ -0,0 +1,2 @@ +package Problem0548 + 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 new file mode 100755 index 000000000..38777e296 --- /dev/null +++ b/Algorithms/0548.split-array-with-equal-sum/split-array-with-equal-sum_test.go @@ -0,0 +1,43 @@ +package Problem0548 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0548(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/README.md b/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/README.md new file mode 100755 index 000000000..4cbae28ab --- /dev/null +++ b/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/README.md @@ -0,0 +1,11 @@ +# [549. Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii.go b/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii.go new file mode 100755 index 000000000..5b63fb8c1 --- /dev/null +++ b/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii.go @@ -0,0 +1,2 @@ +package Problem0549 + 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 new file mode 100755 index 000000000..5928acae3 --- /dev/null +++ b/Algorithms/0549.binary-tree-longest-consecutive-sequence-ii/binary-tree-longest-consecutive-sequence-ii_test.go @@ -0,0 +1,43 @@ +package Problem0549 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0549(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0551.student-attendance-record-i/README.md b/Algorithms/0551.student-attendance-record-i/README.md new file mode 100755 index 000000000..e93dbd4e9 --- /dev/null +++ b/Algorithms/0551.student-attendance-record-i/README.md @@ -0,0 +1,11 @@ +# [551. Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0551.student-attendance-record-i/student-attendance-record-i.go b/Algorithms/0551.student-attendance-record-i/student-attendance-record-i.go new file mode 100755 index 000000000..aff5186d5 --- /dev/null +++ b/Algorithms/0551.student-attendance-record-i/student-attendance-record-i.go @@ -0,0 +1,2 @@ +package Problem0551 + 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 new file mode 100755 index 000000000..b219d898d --- /dev/null +++ b/Algorithms/0551.student-attendance-record-i/student-attendance-record-i_test.go @@ -0,0 +1,43 @@ +package Problem0551 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0551(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0552.student-attendance-record-ii/README.md b/Algorithms/0552.student-attendance-record-ii/README.md new file mode 100755 index 000000000..889104585 --- /dev/null +++ b/Algorithms/0552.student-attendance-record-ii/README.md @@ -0,0 +1,11 @@ +# [552. Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii.go b/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii.go new file mode 100755 index 000000000..9f76346ec --- /dev/null +++ b/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii.go @@ -0,0 +1,2 @@ +package Problem0552 + 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 new file mode 100755 index 000000000..7ab4fe183 --- /dev/null +++ b/Algorithms/0552.student-attendance-record-ii/student-attendance-record-ii_test.go @@ -0,0 +1,43 @@ +package Problem0552 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0552(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0553.optimal-division/README.md b/Algorithms/0553.optimal-division/README.md new file mode 100755 index 000000000..3c5b13086 --- /dev/null +++ b/Algorithms/0553.optimal-division/README.md @@ -0,0 +1,11 @@ +# [553. Optimal Division](https://leetcode.com/problems/optimal-division/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0553.optimal-division/optimal-division.go b/Algorithms/0553.optimal-division/optimal-division.go new file mode 100755 index 000000000..2f42fdab4 --- /dev/null +++ b/Algorithms/0553.optimal-division/optimal-division.go @@ -0,0 +1,2 @@ +package Problem0553 + diff --git a/Algorithms/0553.optimal-division/optimal-division_test.go b/Algorithms/0553.optimal-division/optimal-division_test.go new file mode 100755 index 000000000..a33cf0b2c --- /dev/null +++ b/Algorithms/0553.optimal-division/optimal-division_test.go @@ -0,0 +1,43 @@ +package Problem0553 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0553(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0554.brick-wall/README.md b/Algorithms/0554.brick-wall/README.md new file mode 100755 index 000000000..cce50c022 --- /dev/null +++ b/Algorithms/0554.brick-wall/README.md @@ -0,0 +1,11 @@ +# [554. Brick Wall](https://leetcode.com/problems/brick-wall/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0554.brick-wall/brick-wall.go b/Algorithms/0554.brick-wall/brick-wall.go new file mode 100755 index 000000000..a0dde9329 --- /dev/null +++ b/Algorithms/0554.brick-wall/brick-wall.go @@ -0,0 +1,2 @@ +package Problem0554 + diff --git a/Algorithms/0554.brick-wall/brick-wall_test.go b/Algorithms/0554.brick-wall/brick-wall_test.go new file mode 100755 index 000000000..7c1b5ada7 --- /dev/null +++ b/Algorithms/0554.brick-wall/brick-wall_test.go @@ -0,0 +1,43 @@ +package Problem0554 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0554(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0555.split-concatenated-strings/README.md b/Algorithms/0555.split-concatenated-strings/README.md new file mode 100755 index 000000000..5ef2d12cb --- /dev/null +++ b/Algorithms/0555.split-concatenated-strings/README.md @@ -0,0 +1,11 @@ +# [555. Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0555.split-concatenated-strings/split-concatenated-strings.go b/Algorithms/0555.split-concatenated-strings/split-concatenated-strings.go new file mode 100755 index 000000000..cef466f28 --- /dev/null +++ b/Algorithms/0555.split-concatenated-strings/split-concatenated-strings.go @@ -0,0 +1,2 @@ +package Problem0555 + diff --git a/Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go b/Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go new file mode 100755 index 000000000..750e6bd93 --- /dev/null +++ b/Algorithms/0555.split-concatenated-strings/split-concatenated-strings_test.go @@ -0,0 +1,43 @@ +package Problem0555 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0555(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0556.next-greater-element-iii/README.md b/Algorithms/0556.next-greater-element-iii/README.md new file mode 100755 index 000000000..38153b13c --- /dev/null +++ b/Algorithms/0556.next-greater-element-iii/README.md @@ -0,0 +1,11 @@ +# [556. Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0556.next-greater-element-iii/next-greater-element-iii.go b/Algorithms/0556.next-greater-element-iii/next-greater-element-iii.go new file mode 100755 index 000000000..784b4bb1f --- /dev/null +++ b/Algorithms/0556.next-greater-element-iii/next-greater-element-iii.go @@ -0,0 +1,2 @@ +package Problem0556 + 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 new file mode 100755 index 000000000..0a1202ddd --- /dev/null +++ b/Algorithms/0556.next-greater-element-iii/next-greater-element-iii_test.go @@ -0,0 +1,43 @@ +package Problem0556 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0556(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0557.reverse-words-in-a-string-iii/README.md b/Algorithms/0557.reverse-words-in-a-string-iii/README.md new file mode 100755 index 000000000..b2bc2d710 --- /dev/null +++ b/Algorithms/0557.reverse-words-in-a-string-iii/README.md @@ -0,0 +1,11 @@ +# [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.go b/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.go new file mode 100755 index 000000000..1adb0da9c --- /dev/null +++ b/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.go @@ -0,0 +1,2 @@ +package Problem0557 + 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 new file mode 100755 index 000000000..c214fb2a1 --- /dev/null +++ b/Algorithms/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii_test.go @@ -0,0 +1,43 @@ +package Problem0557 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0557(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0560.subarray-sum-equals-k/README.md b/Algorithms/0560.subarray-sum-equals-k/README.md new file mode 100755 index 000000000..562e68137 --- /dev/null +++ b/Algorithms/0560.subarray-sum-equals-k/README.md @@ -0,0 +1,11 @@ +# [560. Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k.go b/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k.go new file mode 100755 index 000000000..3bfa2ecbd --- /dev/null +++ b/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k.go @@ -0,0 +1,2 @@ +package Problem0560 + 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 new file mode 100755 index 000000000..cf676f5d1 --- /dev/null +++ b/Algorithms/0560.subarray-sum-equals-k/subarray-sum-equals-k_test.go @@ -0,0 +1,43 @@ +package Problem0560 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0560(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0561.array-partition-i/README.md b/Algorithms/0561.array-partition-i/README.md new file mode 100755 index 000000000..596803ab4 --- /dev/null +++ b/Algorithms/0561.array-partition-i/README.md @@ -0,0 +1,11 @@ +# [561. Array Partition I](https://leetcode.com/problems/array-partition-i/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0561.array-partition-i/array-partition-i.go b/Algorithms/0561.array-partition-i/array-partition-i.go new file mode 100755 index 000000000..e92d7f86f --- /dev/null +++ b/Algorithms/0561.array-partition-i/array-partition-i.go @@ -0,0 +1,2 @@ +package Problem0561 + diff --git a/Algorithms/0561.array-partition-i/array-partition-i_test.go b/Algorithms/0561.array-partition-i/array-partition-i_test.go new file mode 100755 index 000000000..84aa3c193 --- /dev/null +++ b/Algorithms/0561.array-partition-i/array-partition-i_test.go @@ -0,0 +1,43 @@ +package Problem0561 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0561(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/README.md b/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/README.md new file mode 100755 index 000000000..e7768e3e9 --- /dev/null +++ b/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/README.md @@ -0,0 +1,11 @@ +# [562. Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix.go b/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix.go new file mode 100755 index 000000000..b3c5eaa0c --- /dev/null +++ b/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix.go @@ -0,0 +1,2 @@ +package Problem0562 + 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 new file mode 100755 index 000000000..b3cbfcdd8 --- /dev/null +++ b/Algorithms/0562.longest-line-of-consecutive-one-in-matrix/longest-line-of-consecutive-one-in-matrix_test.go @@ -0,0 +1,43 @@ +package Problem0562 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0562(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0563.binary-tree-tilt/README.md b/Algorithms/0563.binary-tree-tilt/README.md new file mode 100755 index 000000000..81acc69d9 --- /dev/null +++ b/Algorithms/0563.binary-tree-tilt/README.md @@ -0,0 +1,11 @@ +# [563. Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0563.binary-tree-tilt/binary-tree-tilt.go b/Algorithms/0563.binary-tree-tilt/binary-tree-tilt.go new file mode 100755 index 000000000..6cd8f2721 --- /dev/null +++ b/Algorithms/0563.binary-tree-tilt/binary-tree-tilt.go @@ -0,0 +1,2 @@ +package Problem0563 + diff --git a/Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go b/Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go new file mode 100755 index 000000000..ce89f2dbe --- /dev/null +++ b/Algorithms/0563.binary-tree-tilt/binary-tree-tilt_test.go @@ -0,0 +1,43 @@ +package Problem0563 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0563(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0564.find-the-closest-palindrome/README.md b/Algorithms/0564.find-the-closest-palindrome/README.md new file mode 100755 index 000000000..760fa1270 --- /dev/null +++ b/Algorithms/0564.find-the-closest-palindrome/README.md @@ -0,0 +1,11 @@ +# [564. Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome.go b/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome.go new file mode 100755 index 000000000..e29bb1fe3 --- /dev/null +++ b/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome.go @@ -0,0 +1,2 @@ +package Problem0564 + 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 new file mode 100755 index 000000000..fe8d9c818 --- /dev/null +++ b/Algorithms/0564.find-the-closest-palindrome/find-the-closest-palindrome_test.go @@ -0,0 +1,43 @@ +package Problem0564 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0564(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0565.array-nesting/README.md b/Algorithms/0565.array-nesting/README.md new file mode 100755 index 000000000..f5864de17 --- /dev/null +++ b/Algorithms/0565.array-nesting/README.md @@ -0,0 +1,11 @@ +# [565. Array Nesting](https://leetcode.com/problems/array-nesting/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0565.array-nesting/array-nesting.go b/Algorithms/0565.array-nesting/array-nesting.go new file mode 100755 index 000000000..7f25d1960 --- /dev/null +++ b/Algorithms/0565.array-nesting/array-nesting.go @@ -0,0 +1,2 @@ +package Problem0565 + diff --git a/Algorithms/0565.array-nesting/array-nesting_test.go b/Algorithms/0565.array-nesting/array-nesting_test.go new file mode 100755 index 000000000..88ffdb803 --- /dev/null +++ b/Algorithms/0565.array-nesting/array-nesting_test.go @@ -0,0 +1,43 @@ +package Problem0565 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0565(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0566.reshape-the-matrix/README.md b/Algorithms/0566.reshape-the-matrix/README.md new file mode 100755 index 000000000..576025ba6 --- /dev/null +++ b/Algorithms/0566.reshape-the-matrix/README.md @@ -0,0 +1,11 @@ +# [566. Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0566.reshape-the-matrix/reshape-the-matrix.go b/Algorithms/0566.reshape-the-matrix/reshape-the-matrix.go new file mode 100755 index 000000000..1adb6216a --- /dev/null +++ b/Algorithms/0566.reshape-the-matrix/reshape-the-matrix.go @@ -0,0 +1,2 @@ +package Problem0566 + diff --git a/Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go b/Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go new file mode 100755 index 000000000..77934e640 --- /dev/null +++ b/Algorithms/0566.reshape-the-matrix/reshape-the-matrix_test.go @@ -0,0 +1,43 @@ +package Problem0566 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0566(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0567.permutation-in-string/README.md b/Algorithms/0567.permutation-in-string/README.md new file mode 100755 index 000000000..a4ca39951 --- /dev/null +++ b/Algorithms/0567.permutation-in-string/README.md @@ -0,0 +1,11 @@ +# [567. Permutation in String](https://leetcode.com/problems/permutation-in-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0567.permutation-in-string/permutation-in-string.go b/Algorithms/0567.permutation-in-string/permutation-in-string.go new file mode 100755 index 000000000..766e8b740 --- /dev/null +++ b/Algorithms/0567.permutation-in-string/permutation-in-string.go @@ -0,0 +1,2 @@ +package Problem0567 + diff --git a/Algorithms/0567.permutation-in-string/permutation-in-string_test.go b/Algorithms/0567.permutation-in-string/permutation-in-string_test.go new file mode 100755 index 000000000..04aa8a9e5 --- /dev/null +++ b/Algorithms/0567.permutation-in-string/permutation-in-string_test.go @@ -0,0 +1,43 @@ +package Problem0567 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0567(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0568.maximum-vacation-days/README.md b/Algorithms/0568.maximum-vacation-days/README.md new file mode 100755 index 000000000..172bddb97 --- /dev/null +++ b/Algorithms/0568.maximum-vacation-days/README.md @@ -0,0 +1,11 @@ +# [568. Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0568.maximum-vacation-days/maximum-vacation-days.go b/Algorithms/0568.maximum-vacation-days/maximum-vacation-days.go new file mode 100755 index 000000000..876db8cd3 --- /dev/null +++ b/Algorithms/0568.maximum-vacation-days/maximum-vacation-days.go @@ -0,0 +1,2 @@ +package Problem0568 + diff --git a/Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go b/Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go new file mode 100755 index 000000000..df7e4e02f --- /dev/null +++ b/Algorithms/0568.maximum-vacation-days/maximum-vacation-days_test.go @@ -0,0 +1,43 @@ +package Problem0568 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0568(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0572.subtree-of-another-tree/README.md b/Algorithms/0572.subtree-of-another-tree/README.md new file mode 100755 index 000000000..93f71b1ef --- /dev/null +++ b/Algorithms/0572.subtree-of-another-tree/README.md @@ -0,0 +1,11 @@ +# [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree.go b/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree.go new file mode 100755 index 000000000..8c388e04d --- /dev/null +++ b/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree.go @@ -0,0 +1,2 @@ +package Problem0572 + 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 new file mode 100755 index 000000000..0873cc20a --- /dev/null +++ b/Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree_test.go @@ -0,0 +1,43 @@ +package Problem0572 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0572(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0573.squirrel-simulation/README.md b/Algorithms/0573.squirrel-simulation/README.md new file mode 100755 index 000000000..18edef69d --- /dev/null +++ b/Algorithms/0573.squirrel-simulation/README.md @@ -0,0 +1,11 @@ +# [573. Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0573.squirrel-simulation/squirrel-simulation.go b/Algorithms/0573.squirrel-simulation/squirrel-simulation.go new file mode 100755 index 000000000..0cffa2e80 --- /dev/null +++ b/Algorithms/0573.squirrel-simulation/squirrel-simulation.go @@ -0,0 +1,2 @@ +package Problem0573 + diff --git a/Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go b/Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go new file mode 100755 index 000000000..e8a83e430 --- /dev/null +++ b/Algorithms/0573.squirrel-simulation/squirrel-simulation_test.go @@ -0,0 +1,43 @@ +package Problem0573 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0573(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0575.distribute-candies/README.md b/Algorithms/0575.distribute-candies/README.md new file mode 100755 index 000000000..645d7dda0 --- /dev/null +++ b/Algorithms/0575.distribute-candies/README.md @@ -0,0 +1,11 @@ +# [575. Distribute Candies](https://leetcode.com/problems/distribute-candies/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0575.distribute-candies/distribute-candies.go b/Algorithms/0575.distribute-candies/distribute-candies.go new file mode 100755 index 000000000..d9c2904e3 --- /dev/null +++ b/Algorithms/0575.distribute-candies/distribute-candies.go @@ -0,0 +1,2 @@ +package Problem0575 + diff --git a/Algorithms/0575.distribute-candies/distribute-candies_test.go b/Algorithms/0575.distribute-candies/distribute-candies_test.go new file mode 100755 index 000000000..f43de2644 --- /dev/null +++ b/Algorithms/0575.distribute-candies/distribute-candies_test.go @@ -0,0 +1,43 @@ +package Problem0575 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0575(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0576.out-of-boundary-paths/README.md b/Algorithms/0576.out-of-boundary-paths/README.md new file mode 100755 index 000000000..f0f48eb0c --- /dev/null +++ b/Algorithms/0576.out-of-boundary-paths/README.md @@ -0,0 +1,11 @@ +# [576. Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths.go b/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths.go new file mode 100755 index 000000000..793c62bf2 --- /dev/null +++ b/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths.go @@ -0,0 +1,2 @@ +package Problem0576 + 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 new file mode 100755 index 000000000..6b94b2856 --- /dev/null +++ b/Algorithms/0576.out-of-boundary-paths/out-of-boundary-paths_test.go @@ -0,0 +1,43 @@ +package Problem0576 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0576(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0581.shortest-unsorted-continuous-subarray/README.md b/Algorithms/0581.shortest-unsorted-continuous-subarray/README.md new file mode 100755 index 000000000..ecdc77bac --- /dev/null +++ b/Algorithms/0581.shortest-unsorted-continuous-subarray/README.md @@ -0,0 +1,11 @@ +# [581. Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray.go b/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray.go new file mode 100755 index 000000000..9f90ef7ab --- /dev/null +++ b/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray.go @@ -0,0 +1,2 @@ +package Problem0581 + 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 new file mode 100755 index 000000000..6be8f5b10 --- /dev/null +++ b/Algorithms/0581.shortest-unsorted-continuous-subarray/shortest-unsorted-continuous-subarray_test.go @@ -0,0 +1,43 @@ +package Problem0581 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0581(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0582.kill-process/README.md b/Algorithms/0582.kill-process/README.md new file mode 100755 index 000000000..273b8f1cb --- /dev/null +++ b/Algorithms/0582.kill-process/README.md @@ -0,0 +1,11 @@ +# [582. Kill Process](https://leetcode.com/problems/kill-process/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0582.kill-process/kill-process.go b/Algorithms/0582.kill-process/kill-process.go new file mode 100755 index 000000000..01a3d613a --- /dev/null +++ b/Algorithms/0582.kill-process/kill-process.go @@ -0,0 +1,2 @@ +package Problem0582 + diff --git a/Algorithms/0582.kill-process/kill-process_test.go b/Algorithms/0582.kill-process/kill-process_test.go new file mode 100755 index 000000000..0f887e571 --- /dev/null +++ b/Algorithms/0582.kill-process/kill-process_test.go @@ -0,0 +1,43 @@ +package Problem0582 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0582(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0583.delete-operation-for-two-strings/README.md b/Algorithms/0583.delete-operation-for-two-strings/README.md new file mode 100755 index 000000000..f19ff9a06 --- /dev/null +++ b/Algorithms/0583.delete-operation-for-two-strings/README.md @@ -0,0 +1,11 @@ +# [583. Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings.go b/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings.go new file mode 100755 index 000000000..a6ee8d87d --- /dev/null +++ b/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings.go @@ -0,0 +1,2 @@ +package Problem0583 + 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 new file mode 100755 index 000000000..bf91a4bda --- /dev/null +++ b/Algorithms/0583.delete-operation-for-two-strings/delete-operation-for-two-strings_test.go @@ -0,0 +1,43 @@ +package Problem0583 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0583(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0587.erect-the-fence/README.md b/Algorithms/0587.erect-the-fence/README.md new file mode 100755 index 000000000..a1ed88679 --- /dev/null +++ b/Algorithms/0587.erect-the-fence/README.md @@ -0,0 +1,11 @@ +# [587. Erect the Fence](https://leetcode.com/problems/erect-the-fence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0587.erect-the-fence/erect-the-fence.go b/Algorithms/0587.erect-the-fence/erect-the-fence.go new file mode 100755 index 000000000..6f24172e2 --- /dev/null +++ b/Algorithms/0587.erect-the-fence/erect-the-fence.go @@ -0,0 +1,2 @@ +package Problem0587 + diff --git a/Algorithms/0587.erect-the-fence/erect-the-fence_test.go b/Algorithms/0587.erect-the-fence/erect-the-fence_test.go new file mode 100755 index 000000000..0c9758313 --- /dev/null +++ b/Algorithms/0587.erect-the-fence/erect-the-fence_test.go @@ -0,0 +1,43 @@ +package Problem0587 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0587(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0588.design-in-memory-file-system/README.md b/Algorithms/0588.design-in-memory-file-system/README.md new file mode 100755 index 000000000..70f6605a6 --- /dev/null +++ b/Algorithms/0588.design-in-memory-file-system/README.md @@ -0,0 +1,11 @@ +# [588. Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system.go b/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system.go new file mode 100755 index 000000000..6d1747f3b --- /dev/null +++ b/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system.go @@ -0,0 +1,2 @@ +package Problem0588 + 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 new file mode 100755 index 000000000..01fa73c3b --- /dev/null +++ b/Algorithms/0588.design-in-memory-file-system/design-in-memory-file-system_test.go @@ -0,0 +1,43 @@ +package Problem0588 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0588(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0591.tag-validator/README.md b/Algorithms/0591.tag-validator/README.md new file mode 100755 index 000000000..4743d5561 --- /dev/null +++ b/Algorithms/0591.tag-validator/README.md @@ -0,0 +1,11 @@ +# [591. Tag Validator](https://leetcode.com/problems/tag-validator/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0591.tag-validator/tag-validator.go b/Algorithms/0591.tag-validator/tag-validator.go new file mode 100755 index 000000000..3a27ea973 --- /dev/null +++ b/Algorithms/0591.tag-validator/tag-validator.go @@ -0,0 +1,2 @@ +package Problem0591 + diff --git a/Algorithms/0591.tag-validator/tag-validator_test.go b/Algorithms/0591.tag-validator/tag-validator_test.go new file mode 100755 index 000000000..4c87e3106 --- /dev/null +++ b/Algorithms/0591.tag-validator/tag-validator_test.go @@ -0,0 +1,43 @@ +package Problem0591 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0591(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0592.fraction-addition-and-subtraction/README.md b/Algorithms/0592.fraction-addition-and-subtraction/README.md new file mode 100755 index 000000000..34c52724e --- /dev/null +++ b/Algorithms/0592.fraction-addition-and-subtraction/README.md @@ -0,0 +1,11 @@ +# [592. Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction.go b/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction.go new file mode 100755 index 000000000..0b162a68b --- /dev/null +++ b/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction.go @@ -0,0 +1,2 @@ +package Problem0592 + 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 new file mode 100755 index 000000000..2c8feefce --- /dev/null +++ b/Algorithms/0592.fraction-addition-and-subtraction/fraction-addition-and-subtraction_test.go @@ -0,0 +1,43 @@ +package Problem0592 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0592(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0593.valid-square/README.md b/Algorithms/0593.valid-square/README.md new file mode 100755 index 000000000..46456a264 --- /dev/null +++ b/Algorithms/0593.valid-square/README.md @@ -0,0 +1,11 @@ +# [593. Valid Square](https://leetcode.com/problems/valid-square/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0593.valid-square/valid-square.go b/Algorithms/0593.valid-square/valid-square.go new file mode 100755 index 000000000..0321ff8ff --- /dev/null +++ b/Algorithms/0593.valid-square/valid-square.go @@ -0,0 +1,2 @@ +package Problem0593 + diff --git a/Algorithms/0593.valid-square/valid-square_test.go b/Algorithms/0593.valid-square/valid-square_test.go new file mode 100755 index 000000000..d2780d753 --- /dev/null +++ b/Algorithms/0593.valid-square/valid-square_test.go @@ -0,0 +1,43 @@ +package Problem0593 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0593(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0594.longest-harmonious-subsequence/README.md b/Algorithms/0594.longest-harmonious-subsequence/README.md new file mode 100755 index 000000000..d8b4cb41b --- /dev/null +++ b/Algorithms/0594.longest-harmonious-subsequence/README.md @@ -0,0 +1,11 @@ +# [594. Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence.go b/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence.go new file mode 100755 index 000000000..9b06b3826 --- /dev/null +++ b/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence.go @@ -0,0 +1,2 @@ +package Problem0594 + diff --git a/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go b/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go new file mode 100755 index 000000000..5549594ff --- /dev/null +++ b/Algorithms/0594.longest-harmonious-subsequence/longest-harmonious-subsequence_test.go @@ -0,0 +1,43 @@ +package Problem0594 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0594(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0598.range-addition-ii/README.md b/Algorithms/0598.range-addition-ii/README.md new file mode 100755 index 000000000..f5fcee36b --- /dev/null +++ b/Algorithms/0598.range-addition-ii/README.md @@ -0,0 +1,11 @@ +# [598. Range Addition II](https://leetcode.com/problems/range-addition-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0598.range-addition-ii/range-addition-ii.go b/Algorithms/0598.range-addition-ii/range-addition-ii.go new file mode 100755 index 000000000..e76306470 --- /dev/null +++ b/Algorithms/0598.range-addition-ii/range-addition-ii.go @@ -0,0 +1,2 @@ +package Problem0598 + diff --git a/Algorithms/0598.range-addition-ii/range-addition-ii_test.go b/Algorithms/0598.range-addition-ii/range-addition-ii_test.go new file mode 100755 index 000000000..c748b3aae --- /dev/null +++ b/Algorithms/0598.range-addition-ii/range-addition-ii_test.go @@ -0,0 +1,43 @@ +package Problem0598 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0598(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0599.minimum-index-sum-of-two-lists/README.md b/Algorithms/0599.minimum-index-sum-of-two-lists/README.md new file mode 100755 index 000000000..8da4e5c4a --- /dev/null +++ b/Algorithms/0599.minimum-index-sum-of-two-lists/README.md @@ -0,0 +1,11 @@ +# [599. Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists.go b/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists.go new file mode 100755 index 000000000..8ec3950ba --- /dev/null +++ b/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists.go @@ -0,0 +1,2 @@ +package Problem0599 + 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 new file mode 100755 index 000000000..567d98ce7 --- /dev/null +++ b/Algorithms/0599.minimum-index-sum-of-two-lists/minimum-index-sum-of-two-lists_test.go @@ -0,0 +1,43 @@ +package Problem0599 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0599(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0600.non-negative-integers-without-consecutive-ones/README.md b/Algorithms/0600.non-negative-integers-without-consecutive-ones/README.md new file mode 100755 index 000000000..1c9b487f5 --- /dev/null +++ b/Algorithms/0600.non-negative-integers-without-consecutive-ones/README.md @@ -0,0 +1,11 @@ +# [600. Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones.go b/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones.go new file mode 100755 index 000000000..286c6072f --- /dev/null +++ b/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones.go @@ -0,0 +1,2 @@ +package Problem0600 + 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 new file mode 100755 index 000000000..8f474fb07 --- /dev/null +++ b/Algorithms/0600.non-negative-integers-without-consecutive-ones/non-negative-integers-without-consecutive-ones_test.go @@ -0,0 +1,43 @@ +package Problem0600 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0600(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0604.design-compressed-string-iterator/README.md b/Algorithms/0604.design-compressed-string-iterator/README.md new file mode 100755 index 000000000..5f9ec3abf --- /dev/null +++ b/Algorithms/0604.design-compressed-string-iterator/README.md @@ -0,0 +1,11 @@ +# [604. Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator.go b/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator.go new file mode 100755 index 000000000..33bbd62cb --- /dev/null +++ b/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator.go @@ -0,0 +1,2 @@ +package Problem0604 + 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 new file mode 100755 index 000000000..a485f6171 --- /dev/null +++ b/Algorithms/0604.design-compressed-string-iterator/design-compressed-string-iterator_test.go @@ -0,0 +1,43 @@ +package Problem0604 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0604(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0605.can-place-flowers/README.md b/Algorithms/0605.can-place-flowers/README.md new file mode 100755 index 000000000..50d650a60 --- /dev/null +++ b/Algorithms/0605.can-place-flowers/README.md @@ -0,0 +1,11 @@ +# [605. Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0605.can-place-flowers/can-place-flowers.go b/Algorithms/0605.can-place-flowers/can-place-flowers.go new file mode 100755 index 000000000..1d2bd0d7c --- /dev/null +++ b/Algorithms/0605.can-place-flowers/can-place-flowers.go @@ -0,0 +1,2 @@ +package Problem0605 + diff --git a/Algorithms/0605.can-place-flowers/can-place-flowers_test.go b/Algorithms/0605.can-place-flowers/can-place-flowers_test.go new file mode 100755 index 000000000..dfba17a1c --- /dev/null +++ b/Algorithms/0605.can-place-flowers/can-place-flowers_test.go @@ -0,0 +1,43 @@ +package Problem0605 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0605(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0606.construct-string-from-binary-tree/README.md b/Algorithms/0606.construct-string-from-binary-tree/README.md new file mode 100755 index 000000000..c148c7575 --- /dev/null +++ b/Algorithms/0606.construct-string-from-binary-tree/README.md @@ -0,0 +1,11 @@ +# [606. Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree.go b/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree.go new file mode 100755 index 000000000..173733375 --- /dev/null +++ b/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0606 + 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 new file mode 100755 index 000000000..c163af8a5 --- /dev/null +++ b/Algorithms/0606.construct-string-from-binary-tree/construct-string-from-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0606 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0606(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0609.find-duplicate-file-in-system/README.md b/Algorithms/0609.find-duplicate-file-in-system/README.md new file mode 100755 index 000000000..c866e7941 --- /dev/null +++ b/Algorithms/0609.find-duplicate-file-in-system/README.md @@ -0,0 +1,11 @@ +# [609. Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system.go b/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system.go new file mode 100755 index 000000000..5fb7faccb --- /dev/null +++ b/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system.go @@ -0,0 +1,2 @@ +package Problem0609 + 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 new file mode 100755 index 000000000..568e77abe --- /dev/null +++ b/Algorithms/0609.find-duplicate-file-in-system/find-duplicate-file-in-system_test.go @@ -0,0 +1,43 @@ +package Problem0609 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0609(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0611.valid-triangle-number/README.md b/Algorithms/0611.valid-triangle-number/README.md new file mode 100755 index 000000000..fea6e1597 --- /dev/null +++ b/Algorithms/0611.valid-triangle-number/README.md @@ -0,0 +1,11 @@ +# [611. Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0611.valid-triangle-number/valid-triangle-number.go b/Algorithms/0611.valid-triangle-number/valid-triangle-number.go new file mode 100755 index 000000000..a7c52df3a --- /dev/null +++ b/Algorithms/0611.valid-triangle-number/valid-triangle-number.go @@ -0,0 +1,2 @@ +package Problem0611 + diff --git a/Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go b/Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go new file mode 100755 index 000000000..9718b79fb --- /dev/null +++ b/Algorithms/0611.valid-triangle-number/valid-triangle-number_test.go @@ -0,0 +1,43 @@ +package Problem0611 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0611(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0616.add-bold-tag-in-string/README.md b/Algorithms/0616.add-bold-tag-in-string/README.md new file mode 100755 index 000000000..a003a51f5 --- /dev/null +++ b/Algorithms/0616.add-bold-tag-in-string/README.md @@ -0,0 +1,11 @@ +# [616. Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string.go b/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string.go new file mode 100755 index 000000000..269973a95 --- /dev/null +++ b/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string.go @@ -0,0 +1,2 @@ +package Problem0616 + 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 new file mode 100755 index 000000000..4cac6481c --- /dev/null +++ b/Algorithms/0616.add-bold-tag-in-string/add-bold-tag-in-string_test.go @@ -0,0 +1,43 @@ +package Problem0616 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0616(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0617.merge-two-binary-trees/README.md b/Algorithms/0617.merge-two-binary-trees/README.md new file mode 100755 index 000000000..95413cff8 --- /dev/null +++ b/Algorithms/0617.merge-two-binary-trees/README.md @@ -0,0 +1,11 @@ +# [617. Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees.go b/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees.go new file mode 100755 index 000000000..428674e2e --- /dev/null +++ b/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees.go @@ -0,0 +1,2 @@ +package Problem0617 + 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 new file mode 100755 index 000000000..ae8961f2e --- /dev/null +++ b/Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees_test.go @@ -0,0 +1,43 @@ +package Problem0617 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0617(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0621.task-scheduler/README.md b/Algorithms/0621.task-scheduler/README.md new file mode 100755 index 000000000..e966bbef4 --- /dev/null +++ b/Algorithms/0621.task-scheduler/README.md @@ -0,0 +1,11 @@ +# [621. Task Scheduler](https://leetcode.com/problems/task-scheduler/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0621.task-scheduler/task-scheduler.go b/Algorithms/0621.task-scheduler/task-scheduler.go new file mode 100755 index 000000000..cb7e9c43a --- /dev/null +++ b/Algorithms/0621.task-scheduler/task-scheduler.go @@ -0,0 +1,2 @@ +package Problem0621 + diff --git a/Algorithms/0621.task-scheduler/task-scheduler_test.go b/Algorithms/0621.task-scheduler/task-scheduler_test.go new file mode 100755 index 000000000..5df2efebc --- /dev/null +++ b/Algorithms/0621.task-scheduler/task-scheduler_test.go @@ -0,0 +1,43 @@ +package Problem0621 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0621(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0623.add-one-row-to-tree/README.md b/Algorithms/0623.add-one-row-to-tree/README.md new file mode 100755 index 000000000..ed225f454 --- /dev/null +++ b/Algorithms/0623.add-one-row-to-tree/README.md @@ -0,0 +1,11 @@ +# [623. Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree.go b/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree.go new file mode 100755 index 000000000..194634dcf --- /dev/null +++ b/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree.go @@ -0,0 +1,2 @@ +package Problem0623 + 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 new file mode 100755 index 000000000..80a20b013 --- /dev/null +++ b/Algorithms/0623.add-one-row-to-tree/add-one-row-to-tree_test.go @@ -0,0 +1,43 @@ +package Problem0623 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0623(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0624.maximum-distance-in-arrays/README.md b/Algorithms/0624.maximum-distance-in-arrays/README.md new file mode 100755 index 000000000..a8189e186 --- /dev/null +++ b/Algorithms/0624.maximum-distance-in-arrays/README.md @@ -0,0 +1,11 @@ +# [624. Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays.go b/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays.go new file mode 100755 index 000000000..959fe2b39 --- /dev/null +++ b/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays.go @@ -0,0 +1,2 @@ +package Problem0624 + 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 new file mode 100755 index 000000000..99fa889d3 --- /dev/null +++ b/Algorithms/0624.maximum-distance-in-arrays/maximum-distance-in-arrays_test.go @@ -0,0 +1,43 @@ +package Problem0624 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0624(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0625.minimum-factorization/README.md b/Algorithms/0625.minimum-factorization/README.md new file mode 100755 index 000000000..dbfd839eb --- /dev/null +++ b/Algorithms/0625.minimum-factorization/README.md @@ -0,0 +1,11 @@ +# [625. Minimum Factorization](https://leetcode.com/problems/minimum-factorization/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0625.minimum-factorization/minimum-factorization.go b/Algorithms/0625.minimum-factorization/minimum-factorization.go new file mode 100755 index 000000000..ef8db4ed7 --- /dev/null +++ b/Algorithms/0625.minimum-factorization/minimum-factorization.go @@ -0,0 +1,2 @@ +package Problem0625 + diff --git a/Algorithms/0625.minimum-factorization/minimum-factorization_test.go b/Algorithms/0625.minimum-factorization/minimum-factorization_test.go new file mode 100755 index 000000000..a17806910 --- /dev/null +++ b/Algorithms/0625.minimum-factorization/minimum-factorization_test.go @@ -0,0 +1,43 @@ +package Problem0625 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0625(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0628.maximum-product-of-three-numbers/README.md b/Algorithms/0628.maximum-product-of-three-numbers/README.md new file mode 100755 index 000000000..66fd918ea --- /dev/null +++ b/Algorithms/0628.maximum-product-of-three-numbers/README.md @@ -0,0 +1,11 @@ +# [628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers.go b/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers.go new file mode 100755 index 000000000..bdd50f105 --- /dev/null +++ b/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers.go @@ -0,0 +1,2 @@ +package Problem0628 + 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 new file mode 100755 index 000000000..3b0195cb7 --- /dev/null +++ b/Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers_test.go @@ -0,0 +1,43 @@ +package Problem0628 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0628(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0629.k-inverse-pairs-array/README.md b/Algorithms/0629.k-inverse-pairs-array/README.md new file mode 100755 index 000000000..da1a93fee --- /dev/null +++ b/Algorithms/0629.k-inverse-pairs-array/README.md @@ -0,0 +1,11 @@ +# [629. K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array.go b/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array.go new file mode 100755 index 000000000..b59aeff72 --- /dev/null +++ b/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array.go @@ -0,0 +1,2 @@ +package Problem0629 + 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 new file mode 100755 index 000000000..0254e6735 --- /dev/null +++ b/Algorithms/0629.k-inverse-pairs-array/k-inverse-pairs-array_test.go @@ -0,0 +1,43 @@ +package Problem0629 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0629(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0630.course-schedule-iii/README.md b/Algorithms/0630.course-schedule-iii/README.md new file mode 100755 index 000000000..4ee9a8b0a --- /dev/null +++ b/Algorithms/0630.course-schedule-iii/README.md @@ -0,0 +1,11 @@ +# [630. Course Schedule III](https://leetcode.com/problems/course-schedule-iii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0630.course-schedule-iii/course-schedule-iii.go b/Algorithms/0630.course-schedule-iii/course-schedule-iii.go new file mode 100755 index 000000000..d93a96925 --- /dev/null +++ b/Algorithms/0630.course-schedule-iii/course-schedule-iii.go @@ -0,0 +1,2 @@ +package Problem0630 + diff --git a/Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go b/Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go new file mode 100755 index 000000000..8f3ed11be --- /dev/null +++ b/Algorithms/0630.course-schedule-iii/course-schedule-iii_test.go @@ -0,0 +1,43 @@ +package Problem0630 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0630(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0631.design-excel-sum-formula/README.md b/Algorithms/0631.design-excel-sum-formula/README.md new file mode 100755 index 000000000..e2c4cda75 --- /dev/null +++ b/Algorithms/0631.design-excel-sum-formula/README.md @@ -0,0 +1,11 @@ +# [631. Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula.go b/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula.go new file mode 100755 index 000000000..68fd3c79a --- /dev/null +++ b/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula.go @@ -0,0 +1,2 @@ +package Problem0631 + 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 new file mode 100755 index 000000000..23bf4de6e --- /dev/null +++ b/Algorithms/0631.design-excel-sum-formula/design-excel-sum-formula_test.go @@ -0,0 +1,43 @@ +package Problem0631 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0631(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0632.smallest-range/README.md b/Algorithms/0632.smallest-range/README.md new file mode 100755 index 000000000..161d4916a --- /dev/null +++ b/Algorithms/0632.smallest-range/README.md @@ -0,0 +1,11 @@ +# [632. Smallest Range](https://leetcode.com/problems/smallest-range/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0632.smallest-range/smallest-range.go b/Algorithms/0632.smallest-range/smallest-range.go new file mode 100755 index 000000000..bb85b8d32 --- /dev/null +++ b/Algorithms/0632.smallest-range/smallest-range.go @@ -0,0 +1,2 @@ +package Problem0632 + diff --git a/Algorithms/0632.smallest-range/smallest-range_test.go b/Algorithms/0632.smallest-range/smallest-range_test.go new file mode 100755 index 000000000..02bb6a4d7 --- /dev/null +++ b/Algorithms/0632.smallest-range/smallest-range_test.go @@ -0,0 +1,43 @@ +package Problem0632 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0632(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0633.sum-of-square-numbers/README.md b/Algorithms/0633.sum-of-square-numbers/README.md new file mode 100755 index 000000000..f8ffdfdfa --- /dev/null +++ b/Algorithms/0633.sum-of-square-numbers/README.md @@ -0,0 +1,11 @@ +# [633. Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers.go b/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers.go new file mode 100755 index 000000000..60eff487a --- /dev/null +++ b/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers.go @@ -0,0 +1,2 @@ +package Problem0633 + 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 new file mode 100755 index 000000000..5910a77e6 --- /dev/null +++ b/Algorithms/0633.sum-of-square-numbers/sum-of-square-numbers_test.go @@ -0,0 +1,43 @@ +package Problem0633 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0633(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0634.find-the-derangement-of-an-array/README.md b/Algorithms/0634.find-the-derangement-of-an-array/README.md new file mode 100755 index 000000000..4011e9f9d --- /dev/null +++ b/Algorithms/0634.find-the-derangement-of-an-array/README.md @@ -0,0 +1,11 @@ +# [634. Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array.go b/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array.go new file mode 100755 index 000000000..b6370d316 --- /dev/null +++ b/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array.go @@ -0,0 +1,2 @@ +package Problem0634 + 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 new file mode 100755 index 000000000..a61febcce --- /dev/null +++ b/Algorithms/0634.find-the-derangement-of-an-array/find-the-derangement-of-an-array_test.go @@ -0,0 +1,43 @@ +package Problem0634 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0634(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0635.design-log-storage-system/README.md b/Algorithms/0635.design-log-storage-system/README.md new file mode 100755 index 000000000..8c4623af9 --- /dev/null +++ b/Algorithms/0635.design-log-storage-system/README.md @@ -0,0 +1,11 @@ +# [635. Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0635.design-log-storage-system/design-log-storage-system.go b/Algorithms/0635.design-log-storage-system/design-log-storage-system.go new file mode 100755 index 000000000..60f28f21a --- /dev/null +++ b/Algorithms/0635.design-log-storage-system/design-log-storage-system.go @@ -0,0 +1,2 @@ +package Problem0635 + 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 new file mode 100755 index 000000000..a06dfa68c --- /dev/null +++ b/Algorithms/0635.design-log-storage-system/design-log-storage-system_test.go @@ -0,0 +1,43 @@ +package Problem0635 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0635(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0636.exclusive-time-of-functions/README.md b/Algorithms/0636.exclusive-time-of-functions/README.md new file mode 100755 index 000000000..f4536caf9 --- /dev/null +++ b/Algorithms/0636.exclusive-time-of-functions/README.md @@ -0,0 +1,11 @@ +# [636. Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions.go b/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions.go new file mode 100755 index 000000000..ae6312346 --- /dev/null +++ b/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions.go @@ -0,0 +1,2 @@ +package Problem0636 + 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 new file mode 100755 index 000000000..5e45b31fe --- /dev/null +++ b/Algorithms/0636.exclusive-time-of-functions/exclusive-time-of-functions_test.go @@ -0,0 +1,43 @@ +package Problem0636 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0636(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0637.average-of-levels-in-binary-tree/README.md b/Algorithms/0637.average-of-levels-in-binary-tree/README.md new file mode 100755 index 000000000..ffa42a8db --- /dev/null +++ b/Algorithms/0637.average-of-levels-in-binary-tree/README.md @@ -0,0 +1,11 @@ +# [637. Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree.go b/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree.go new file mode 100755 index 000000000..4686315f5 --- /dev/null +++ b/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree.go @@ -0,0 +1,2 @@ +package Problem0637 + 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 new file mode 100755 index 000000000..49b5592c8 --- /dev/null +++ b/Algorithms/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree_test.go @@ -0,0 +1,43 @@ +package Problem0637 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0637(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0638.shopping-offers/README.md b/Algorithms/0638.shopping-offers/README.md new file mode 100755 index 000000000..64a028c30 --- /dev/null +++ b/Algorithms/0638.shopping-offers/README.md @@ -0,0 +1,11 @@ +# [638. Shopping Offers](https://leetcode.com/problems/shopping-offers/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0638.shopping-offers/shopping-offers.go b/Algorithms/0638.shopping-offers/shopping-offers.go new file mode 100755 index 000000000..9c026b777 --- /dev/null +++ b/Algorithms/0638.shopping-offers/shopping-offers.go @@ -0,0 +1,2 @@ +package Problem0638 + diff --git a/Algorithms/0638.shopping-offers/shopping-offers_test.go b/Algorithms/0638.shopping-offers/shopping-offers_test.go new file mode 100755 index 000000000..c92743aa5 --- /dev/null +++ b/Algorithms/0638.shopping-offers/shopping-offers_test.go @@ -0,0 +1,43 @@ +package Problem0638 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0638(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0639.decode-ways-ii/README.md b/Algorithms/0639.decode-ways-ii/README.md new file mode 100755 index 000000000..60d43e10d --- /dev/null +++ b/Algorithms/0639.decode-ways-ii/README.md @@ -0,0 +1,11 @@ +# [639. Decode Ways II](https://leetcode.com/problems/decode-ways-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0639.decode-ways-ii/decode-ways-ii.go b/Algorithms/0639.decode-ways-ii/decode-ways-ii.go new file mode 100755 index 000000000..e5523894c --- /dev/null +++ b/Algorithms/0639.decode-ways-ii/decode-ways-ii.go @@ -0,0 +1,2 @@ +package Problem0639 + diff --git a/Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go b/Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go new file mode 100755 index 000000000..2a591f6e3 --- /dev/null +++ b/Algorithms/0639.decode-ways-ii/decode-ways-ii_test.go @@ -0,0 +1,43 @@ +package Problem0639 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0639(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0640.solve-the-equation/README.md b/Algorithms/0640.solve-the-equation/README.md new file mode 100755 index 000000000..dc8d1f03f --- /dev/null +++ b/Algorithms/0640.solve-the-equation/README.md @@ -0,0 +1,11 @@ +# [640. Solve the Equation](https://leetcode.com/problems/solve-the-equation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0640.solve-the-equation/solve-the-equation.go b/Algorithms/0640.solve-the-equation/solve-the-equation.go new file mode 100755 index 000000000..3d9abd40f --- /dev/null +++ b/Algorithms/0640.solve-the-equation/solve-the-equation.go @@ -0,0 +1,2 @@ +package Problem0640 + diff --git a/Algorithms/0640.solve-the-equation/solve-the-equation_test.go b/Algorithms/0640.solve-the-equation/solve-the-equation_test.go new file mode 100755 index 000000000..897393c64 --- /dev/null +++ b/Algorithms/0640.solve-the-equation/solve-the-equation_test.go @@ -0,0 +1,43 @@ +package Problem0640 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0640(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0642.design-search-autocomplete-system/README.md b/Algorithms/0642.design-search-autocomplete-system/README.md new file mode 100755 index 000000000..de17a6e02 --- /dev/null +++ b/Algorithms/0642.design-search-autocomplete-system/README.md @@ -0,0 +1,11 @@ +# [642. Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system.go b/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system.go new file mode 100755 index 000000000..164482885 --- /dev/null +++ b/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system.go @@ -0,0 +1,2 @@ +package Problem0642 + 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 new file mode 100755 index 000000000..70f76f1cd --- /dev/null +++ b/Algorithms/0642.design-search-autocomplete-system/design-search-autocomplete-system_test.go @@ -0,0 +1,43 @@ +package Problem0642 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0642(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0643.maximum-average-subarray-i/README.md b/Algorithms/0643.maximum-average-subarray-i/README.md new file mode 100755 index 000000000..b35f93e96 --- /dev/null +++ b/Algorithms/0643.maximum-average-subarray-i/README.md @@ -0,0 +1,11 @@ +# [643. Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i.go b/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i.go new file mode 100755 index 000000000..e500b4eeb --- /dev/null +++ b/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i.go @@ -0,0 +1,2 @@ +package Problem0643 + 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 new file mode 100755 index 000000000..a72f47fd1 --- /dev/null +++ b/Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i_test.go @@ -0,0 +1,43 @@ +package Problem0643 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0643(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0644.maximum-average-subarray-ii/README.md b/Algorithms/0644.maximum-average-subarray-ii/README.md new file mode 100755 index 000000000..e578b9220 --- /dev/null +++ b/Algorithms/0644.maximum-average-subarray-ii/README.md @@ -0,0 +1,11 @@ +# [644. Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii.go b/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii.go new file mode 100755 index 000000000..4b3274baf --- /dev/null +++ b/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii.go @@ -0,0 +1,2 @@ +package Problem0644 + 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 new file mode 100755 index 000000000..5d91dd527 --- /dev/null +++ b/Algorithms/0644.maximum-average-subarray-ii/maximum-average-subarray-ii_test.go @@ -0,0 +1,43 @@ +package Problem0644 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0644(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0645.set-mismatch/README.md b/Algorithms/0645.set-mismatch/README.md new file mode 100755 index 000000000..89f800875 --- /dev/null +++ b/Algorithms/0645.set-mismatch/README.md @@ -0,0 +1,11 @@ +# [645. Set Mismatch](https://leetcode.com/problems/set-mismatch/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0645.set-mismatch/set-mismatch.go b/Algorithms/0645.set-mismatch/set-mismatch.go new file mode 100755 index 000000000..5f8c7eb5f --- /dev/null +++ b/Algorithms/0645.set-mismatch/set-mismatch.go @@ -0,0 +1,2 @@ +package Problem0645 + diff --git a/Algorithms/0645.set-mismatch/set-mismatch_test.go b/Algorithms/0645.set-mismatch/set-mismatch_test.go new file mode 100755 index 000000000..a80c76562 --- /dev/null +++ b/Algorithms/0645.set-mismatch/set-mismatch_test.go @@ -0,0 +1,43 @@ +package Problem0645 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0645(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0646.maximum-length-of-pair-chain/README.md b/Algorithms/0646.maximum-length-of-pair-chain/README.md new file mode 100755 index 000000000..30b6df305 --- /dev/null +++ b/Algorithms/0646.maximum-length-of-pair-chain/README.md @@ -0,0 +1,11 @@ +# [646. Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain.go b/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain.go new file mode 100755 index 000000000..c62345cc6 --- /dev/null +++ b/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain.go @@ -0,0 +1,2 @@ +package Problem0646 + 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 new file mode 100755 index 000000000..610907df2 --- /dev/null +++ b/Algorithms/0646.maximum-length-of-pair-chain/maximum-length-of-pair-chain_test.go @@ -0,0 +1,43 @@ +package Problem0646 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0646(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0647.palindromic-substrings/README.md b/Algorithms/0647.palindromic-substrings/README.md new file mode 100755 index 000000000..7ee2abd3d --- /dev/null +++ b/Algorithms/0647.palindromic-substrings/README.md @@ -0,0 +1,11 @@ +# [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0647.palindromic-substrings/palindromic-substrings.go b/Algorithms/0647.palindromic-substrings/palindromic-substrings.go new file mode 100755 index 000000000..054525e72 --- /dev/null +++ b/Algorithms/0647.palindromic-substrings/palindromic-substrings.go @@ -0,0 +1,2 @@ +package Problem0647 + diff --git a/Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go b/Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go new file mode 100755 index 000000000..5181dbd81 --- /dev/null +++ b/Algorithms/0647.palindromic-substrings/palindromic-substrings_test.go @@ -0,0 +1,43 @@ +package Problem0647 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0647(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Algorithms/0648.replace-words/README.md b/Algorithms/0648.replace-words/README.md new file mode 100755 index 000000000..39a5b15a4 --- /dev/null +++ b/Algorithms/0648.replace-words/README.md @@ -0,0 +1,11 @@ +# [648. Replace Words](https://leetcode.com/problems/replace-words/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Algorithms/0648.replace-words/replace-words.go b/Algorithms/0648.replace-words/replace-words.go new file mode 100755 index 000000000..a10fb4a4b --- /dev/null +++ b/Algorithms/0648.replace-words/replace-words.go @@ -0,0 +1,2 @@ +package Problem0648 + diff --git a/Algorithms/0648.replace-words/replace-words_test.go b/Algorithms/0648.replace-words/replace-words_test.go new file mode 100755 index 000000000..8d16681cd --- /dev/null +++ b/Algorithms/0648.replace-words/replace-words_test.go @@ -0,0 +1,43 @@ +package Problem0648 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0648(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0433.minimum-genetic-mutation/README.md b/Draft/0433.minimum-genetic-mutation/README.md new file mode 100755 index 000000000..cfdfac92e --- /dev/null +++ b/Draft/0433.minimum-genetic-mutation/README.md @@ -0,0 +1,11 @@ +# [433. Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation.go b/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation.go new file mode 100755 index 000000000..73d45c540 --- /dev/null +++ b/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation.go @@ -0,0 +1,2 @@ +package Problem0433 + diff --git a/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go b/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go new file mode 100755 index 000000000..23e8af990 --- /dev/null +++ b/Draft/0433.minimum-genetic-mutation/minimum-genetic-mutation_test.go @@ -0,0 +1,43 @@ +package Problem0433 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0433(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0457.circular-array-loop/README.md b/Draft/0457.circular-array-loop/README.md new file mode 100755 index 000000000..2d9982104 --- /dev/null +++ b/Draft/0457.circular-array-loop/README.md @@ -0,0 +1,11 @@ +# [457. Circular Array Loop](https://leetcode.com/problems/circular-array-loop/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0457.circular-array-loop/circular-array-loop.go b/Draft/0457.circular-array-loop/circular-array-loop.go new file mode 100755 index 000000000..753756a6e --- /dev/null +++ b/Draft/0457.circular-array-loop/circular-array-loop.go @@ -0,0 +1,2 @@ +package Problem0457 + diff --git a/Draft/0457.circular-array-loop/circular-array-loop_test.go b/Draft/0457.circular-array-loop/circular-array-loop_test.go new file mode 100755 index 000000000..5532ce669 --- /dev/null +++ b/Draft/0457.circular-array-loop/circular-array-loop_test.go @@ -0,0 +1,43 @@ +package Problem0457 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0457(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0458.poor-pigs/README.md b/Draft/0458.poor-pigs/README.md new file mode 100755 index 000000000..46f438ba1 --- /dev/null +++ b/Draft/0458.poor-pigs/README.md @@ -0,0 +1,11 @@ +# [458. Poor Pigs](https://leetcode.com/problems/poor-pigs/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0458.poor-pigs/poor-pigs.go b/Draft/0458.poor-pigs/poor-pigs.go new file mode 100755 index 000000000..73cd8e22f --- /dev/null +++ b/Draft/0458.poor-pigs/poor-pigs.go @@ -0,0 +1,2 @@ +package Problem0458 + diff --git a/Draft/0458.poor-pigs/poor-pigs_test.go b/Draft/0458.poor-pigs/poor-pigs_test.go new file mode 100755 index 000000000..b5c1388d0 --- /dev/null +++ b/Draft/0458.poor-pigs/poor-pigs_test.go @@ -0,0 +1,43 @@ +package Problem0458 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0458(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0518.coin-change-2/README.md b/Draft/0518.coin-change-2/README.md new file mode 100755 index 000000000..2686f3c76 --- /dev/null +++ b/Draft/0518.coin-change-2/README.md @@ -0,0 +1,11 @@ +# [518. Coin Change 2](https://leetcode.com/problems/coin-change-2/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0518.coin-change-2/coin-change-2.go b/Draft/0518.coin-change-2/coin-change-2.go new file mode 100755 index 000000000..28026e5cf --- /dev/null +++ b/Draft/0518.coin-change-2/coin-change-2.go @@ -0,0 +1,2 @@ +package Problem0518 + diff --git a/Draft/0518.coin-change-2/coin-change-2_test.go b/Draft/0518.coin-change-2/coin-change-2_test.go new file mode 100755 index 000000000..59b8d025d --- /dev/null +++ b/Draft/0518.coin-change-2/coin-change-2_test.go @@ -0,0 +1,43 @@ +package Problem0518 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0518(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0578.get-highest-answer-rate-question/README.md b/Draft/0578.get-highest-answer-rate-question/README.md new file mode 100755 index 000000000..1cc4f6578 --- /dev/null +++ b/Draft/0578.get-highest-answer-rate-question/README.md @@ -0,0 +1,11 @@ +# [578. Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question.go b/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question.go new file mode 100755 index 000000000..4373f6bc1 --- /dev/null +++ b/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question.go @@ -0,0 +1,2 @@ +package Problem0578 + 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 new file mode 100755 index 000000000..f41299cd2 --- /dev/null +++ b/Draft/0578.get-highest-answer-rate-question/get-highest-answer-rate-question_test.go @@ -0,0 +1,43 @@ +package Problem0578 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0578(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0579.find-cumulative-salary-of-an-employee/README.md b/Draft/0579.find-cumulative-salary-of-an-employee/README.md new file mode 100755 index 000000000..d5b9aceac --- /dev/null +++ b/Draft/0579.find-cumulative-salary-of-an-employee/README.md @@ -0,0 +1,11 @@ +# [579. Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee.go b/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee.go new file mode 100755 index 000000000..1815b0f7f --- /dev/null +++ b/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee.go @@ -0,0 +1,2 @@ +package Problem0579 + 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 new file mode 100755 index 000000000..6b21d1cc9 --- /dev/null +++ b/Draft/0579.find-cumulative-salary-of-an-employee/find-cumulative-salary-of-an-employee_test.go @@ -0,0 +1,43 @@ +package Problem0579 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0579(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0603.consecutive-available-seats/README.md b/Draft/0603.consecutive-available-seats/README.md new file mode 100755 index 000000000..87663ccda --- /dev/null +++ b/Draft/0603.consecutive-available-seats/README.md @@ -0,0 +1,11 @@ +# [603. Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0603.consecutive-available-seats/consecutive-available-seats.go b/Draft/0603.consecutive-available-seats/consecutive-available-seats.go new file mode 100755 index 000000000..c673ec399 --- /dev/null +++ b/Draft/0603.consecutive-available-seats/consecutive-available-seats.go @@ -0,0 +1,2 @@ +package Problem0603 + diff --git a/Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go b/Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go new file mode 100755 index 000000000..c65675a50 --- /dev/null +++ b/Draft/0603.consecutive-available-seats/consecutive-available-seats_test.go @@ -0,0 +1,43 @@ +package Problem0603 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0603(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Draft/0626.exchange-seats/README.md b/Draft/0626.exchange-seats/README.md new file mode 100755 index 000000000..dfb6db675 --- /dev/null +++ b/Draft/0626.exchange-seats/README.md @@ -0,0 +1,11 @@ +# [626. Exchange Seats](https://leetcode.com/problems/exchange-seats/) + +## 题目 + + +## 解题思路 + + +## 总结 + + diff --git a/Draft/0626.exchange-seats/exchange-seats.go b/Draft/0626.exchange-seats/exchange-seats.go new file mode 100755 index 000000000..d6e0fa83a --- /dev/null +++ b/Draft/0626.exchange-seats/exchange-seats.go @@ -0,0 +1,2 @@ +package Problem0626 + diff --git a/Draft/0626.exchange-seats/exchange-seats_test.go b/Draft/0626.exchange-seats/exchange-seats_test.go new file mode 100755 index 000000000..d5c35a3db --- /dev/null +++ b/Draft/0626.exchange-seats/exchange-seats_test.go @@ -0,0 +1,43 @@ +package Problem0626 + +import ( + "testing" + + "github.com/stretchr/testify/assert" +) + +type question struct { + para + ans +} + +// para 是参数 +// one 代表第一个参数 +type para struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans struct { + one string +} + +func Test_Problem0626(t *testing.T) { + ast := assert.New(t) + + qs := []question{ + + question{ + para{""}, + ans{""}, + }, + + } + + for _, q := range qs { + a, p := q.ans, q.para + + ast.Equal(a.one, p.one, "输入:%v", p) + } +} diff --git a/Helper b/Helper index 80d9ca3f09997d8832f7af484e19fc54fd184c3d..945d0a4bb1dfce0493b1016b152877b0d96c21f5 100755 GIT binary patch delta 390 zcmWN{O(=tL90%}z5C3O>kC)9mkCz#Cvfb=BE zVR6}hl*nNh9GpxmYqg7mvYV8H@8NU%r0ru$!}WKN`Zr5Ks}v+I1-0BHOfU0hLe%)ldUY4xhP>JjT#s zXlZ$2bw0A9^o&bc7a12{WNLqBNVjZv9n?buG(ri_@% delta 389 zcmWN{&nts*90%||58v%;!ydnR{FvWzSUc`!IVcB{N-xhN;^!|V3Cvrp&_uD(s`*(#V;!6Yu2T6T>siCJyb(M~&9`_dqhyE2rb~%R@_icq%i3eyq8Kgc9(87fPWF%E8BT3H`WD>5i^S z=BF2zXIEzyR;;9>bJD5!8>bV?_E$m`R6`BaLLJmY1KWP%tc-S4f4~S*+=>PaXoMzc Wh8FNcE3`p7bU-I`aWv39@bwR|H<&sA diff --git a/README.md b/README.md index 354eb82a3..c9e42db25 100755 --- a/README.md +++ b/README.md @@ -15,16 +15,16 @@ ## 已添加的题目 |题号|题目|难度|总体通过率|收藏| |:-:|:-|:-: | :-: | :-: | -|1|[Two Sum](./algorithms/0001.two-sum)|☆|34%|| -|2|[Add Two Numbers](./algorithms/0002.add-two-numbers)|☆ ☆|27%|| -|3|[Longest Substring Without Repeating Characters](./algorithms/0003.longest-substring-without-repeating-characters)|☆ ☆|24%|| -|4|[Median of Two Sorted Arrays](./algorithms/0004.median-of-two-sorted-arrays)|☆ ☆ ☆|21%|| -|5|[Longest Palindromic Substring](./algorithms/0005.longest-palindromic-substring)|☆ ☆|25%|| -|6|[ZigZag Conversion](./algorithms/0006.zigzag-conversion)|☆ ☆|26%|| -|7|[Reverse Integer](./algorithms/0007.reverse-integer)|☆|24%|| -|8|[String to Integer (atoi)](./algorithms/0008.string-to-integer-atoi)|☆ ☆|13%|| -|9|[Palindrome Number](./algorithms/0009.palindrome-number)|☆|35%|| -|10|[Regular Expression Matching](./algorithms/0010.regular-expression-matching)|☆ ☆ ☆|24%|❤| +|1|[Two Sum](./Algorithms/0001.two-sum)|☆|34%|| +|2|[Add Two Numbers](./Algorithms/0002.add-two-numbers)|☆ ☆|27%|| +|3|[Longest Substring Without Repeating Characters](./Algorithms/0003.longest-substring-without-repeating-characters)|☆ ☆|24%|| +|4|[Median of Two Sorted Arrays](./Algorithms/0004.median-of-two-sorted-arrays)|☆ ☆ ☆|21%|| +|5|[Longest Palindromic Substring](./Algorithms/0005.longest-palindromic-substring)|☆ ☆|25%|| +|6|[ZigZag Conversion](./Algorithms/0006.zigzag-conversion)|☆ ☆|26%|| +|7|[Reverse Integer](./Algorithms/0007.reverse-integer)|☆|24%|| +|8|[String to Integer (atoi)](./Algorithms/0008.string-to-integer-atoi)|☆ ☆|13%|| +|9|[Palindrome Number](./Algorithms/0009.palindrome-number)|☆|35%|| +|10|[Regular Expression Matching](./Algorithms/0010.regular-expression-matching)|☆ ☆ ☆|24%|❤| ## helper文件夹 [helper](./helper)会帮助处理大部分琐碎的工作。