LeetCode_Note

leetcode personal note

Question List

• [1_two_sum.cpp]
• [10_regular-expression-matching.cpp]
• [100_same-tree.cpp]
• [1001_sorted-merge-lcci.cpp]
• [101_symmetric-tree.cpp]
• [102_binary-tree-level-order-traversal.cpp]
• [103_binary-tree-zigzag-level-order-traversal.cpp]
• [104_maximum-depth-of-binary-tree.cpp]
• [105_construct-binary-tree-from-preorder-and-inorder-traversal.cpp]
• [106_construct-binary-tree-from-inorder-and-postorder-traversal.cpp]
• [107_binary-tree-level-order-traversal-ii.cpp]
• [108_convert-sorted-array-to-binary-search-tree.cpp]
• [109_convert-sorted-list-to-binary-search-tree.cpp]
• [11_container-with-most-water.cpp]
• [110_balanced-binary-tree.cpp]
• [1103_distribute-candies-to-people.cpp]
• [111_minimum-depth-of-binary-tree.cpp]
• [112_path-sum.cpp]
• [113_path-sum-ii.cpp]
• [114_flatten-binary-tree-to-linked-list.cpp]
• [115_distinct-subsequences.cpp]
• [116_populating-next-right-pointers-in-each-node.cpp]
• [117_populating-next-right-pointers-in-each-node-ii.cpp]
• [118_pascals-triangle.cpp]
• [119_pascals-triangle-ii.cpp]
• [12_integer-to-roman.cpp]
• [120_triangle.cpp]
• [121_best-time-to-buy-and-sell-stock.cpp]
• [122_best-time-to-buy-and-sell-stock-ii.cpp]
• [124_binary-tree-maximum-path-sum.cpp]
• [125_valid-palindrome.cpp]
• [127_word-ladder.cpp]
• [128_longest-consecutive-sequence.cpp]
• [129_sum-root-to-leaf-numbers.cpp]
• [13_offer.cpp]
• [13_roman-to-integer.cpp]
• [130_surrounded-regions.cpp]
• [131_palindrome-partitioning.cpp]
• [133_clone-graph.cpp]
• [134_gas-station.cpp]
• [135_candy.cpp]
• [136_single-number.cpp]
• [139_word-break.cpp]
• [14_longest-common-prefix.cpp]
• [141_linked-list-cycle.cpp]
• [144_binary-tree-preorder-traversal.cpp]
• [145_binary-tree-postorder-traversal.cpp]
• [146_lru-cache.cpp]
• [149_max-points-on-a-line.cpp]
• [15_3sum.cpp]
• [151_reverse-words-in-a-string.cpp]
• [152_maximum-product-subarray.cpp]
• [153_find-minimum-in-rotated-sorted-array.cpp]
• [155_min-stack.cpp]
• [16_3sum-closest.cpp]
• [169_majority-element.cpp]
• [17_letter-combinations-of-a-phone-number.cpp]
• [18_4sum.cpp]
• [19_remove-nth-node-from-end-of-list.cpp]
• [198_house-robber.cpp]
• [199_binary-tree-right-side-view.cpp]
• [2_add-two-numbers.cpp]
• [20_valid-parentheses.cpp]
• [202_happy-number.cpp]
• [206_reverse-linked-list.cpp]
• [21_merge-two-sorted-lists.cpp]
• [22_generate-parentheses.cpp]
• [24_swap-nodes-in-pairs.cpp]
• [25_reverse-nodes-in-k-group.cpp]
• [26_remove-duplicates-from-sorted-array.cpp]
• [27_remove-element.cpp]
• [28_implement-strstr.cpp]
• [287_find-the-duplicate-number.cpp]
• [29_divide-two-integers.cpp]
• [3_longest-substring-without-repeating-characters.cpp]
• [30_substring-with-concatenation-of-all-words.cpp]
• [300_longest-increasing-subsequence.cpp]
• [31_next-permutation.cpp]
• [32_longest-valid-parentheses.cpp]
• [33_search-in-rotated-sorted-array.cpp]
• [34_find-first-and-last-position-of-element-in-sorted-array.cpp]
• [35_search-insert-position.cpp]
• [36_valid-sudoku.cpp]
• [37_sudoku-solver.cpp]
• [38_count-and-say.cpp]
• [39_combination-sum.cpp]
• [394_decode-string.cpp]
• [4_median-of-two-sorted-arrays.cpp]
• [40_combination-sum-ii.cpp]
• [41_first-missing-positive.cpp]
• [42_trapping-rain-water.cpp]
• [43_multiply-strings.cpp]
• [44_wildcard-matching.cpp]
• [45_jump-game-ii.cpp]
• [46_permutations.cpp]
• [47_permutations-ii.cpp]
• [48_rotate-image.cpp]
• [49_group-anagrams.cpp]
• [5_longest-palindromic-substring.cpp]
• [50_powx-n.cpp]
• [50_powx-n - 副本.cpp]
• [51_n-queens.cpp]
• [53_maximum-subarray.cpp]
• [54_spiral-matrix.cpp]
• [543_diameter-of-binary-tree.cpp]
• [55_jump-game.cpp]
• [56_merge-intervals.cpp]
• [560_subarray-sum-equals-k.cpp]
• [57_offer.cpp]
• [57_insert-interval.cpp]
• [58_length-of-last-word.cpp]
• [6_zigzag-conversion.cpp]
• [60_permutation-sequence.cpp]
• [61_rotate-list.cpp]
• [62_unique-paths.cpp]
• [64_minimum-path-sum.cpp]
• [65_valid-number.cpp]
• [66_plus-one.cpp]
• [67_add-binary.cpp]
• [68_text-justification.cpp]
• [69_sqrtx.cpp]
• [7_reverse-integer.cpp]
• [70_climbing-stairs.cpp]
• [71_simplify-path.cpp]
• [72_edit-distance.cpp]
• [73_set-matrix-zeroes.cpp]
• [74_search-a-2d-matrix.cpp]
• [75_sort-colors.cpp]
• [76_minimum-window-substring.cpp]
• [77_combinations.cpp]
• [78_subsets.cpp]
• [79_word-search.cpp]
• [8_string-to-integer-atoi.cpp]
• [83_remove-duplicates-from-sorted-list.cpp]
• [836_rectangle-overlap.cpp]
• [84_largest-rectangle-in-histogram.cpp]
• [85_maximal-rectangle.cpp]
• [86_partition-list.cpp]
• [87_scramble-string.cpp]
• [88_merge-sorted-array.cpp]
• [89_gray-code.cpp]
• [9_palindrome-number.cpp]
• [91_decode-ways.cpp]
• [93_restore-ip-addresses.cpp]
• [94_binary-tree-inorder-traversal.cpp]
• [95_unique-binary-search-trees-ii.cpp]
• [96_unique-binary-search-trees.cpp]
• [97_interleaving-string.cpp]
• [974_subarray-sums-divisible-by-k.cpp]
• [98_validate-binary-search-tree.cpp]
• [99_recover-binary-search-tree.cpp]