记录刷题心得

语言

算法

Depth First Search

DFS + Memorization and Dynamic Programming

记忆化搜索和动态规划虽然分别叫做Top-Down和Bottom-Up的方法, 但本质都是现将问题化简到更小的子问题直至base case, 然后通过base case的值不断反推回去, 这个过程中cache子问题的最优解, 这样递归到相同子问题时可以直接返回已经缓存的子问题最优解

Name		Name	Last commit message	Last commit date
Latest commit History 99 Commits
102_linked-list-cycle		102_linked-list-cycle
1031_is-graph-bipartite		1031_is-graph-bipartite
103_linked-list-cycle-ii		103_linked-list-cycle-ii
104_merge-k-sorted-lists		104_merge-k-sorted-lists
105_copy-list-with-random-pointer		105_copy-list-with-random-pointer
1060_daily-temperatures		1060_daily-temperatures
1075_subarray-product-less-than-k		1075_subarray-product-less-than-k
107_word-break		107_word-break
111_climbing-stairs		111_climbing-stairs
112_remove-duplicates-from-sorted-list		112_remove-duplicates-from-sorted-list
113_remove-duplicates-from-sorted-list-ii		113_remove-duplicates-from-sorted-list-ii
116_jump-game		116_jump-game
1175_brick_wall		1175_brick_wall
117_jump-game-2		117_jump-game-2
119_edit-distance		119_edit-distance
120_word-ladder		120_word-ladder
121_word-ladder-ii		121_word-ladder-ii
122_largest-rectangle-in-histogram		122_largest-rectangle-in-histogram
1235_serialize-and-deserialize-bst		1235_serialize-and-deserialize-bst
123_word-search		123_word-search
1242_non-overlapping-intervals		1242_non-overlapping-intervals
126_set-matrix-zeroes		126_set-matrix-zeroes
127_topological-sorting		127_topological-sorting
1281_top-k-frequent-elements		1281_top-k-frequent-elements
1283_reverse-string		1283_reverse-string
1297_count-of-smaller-numbers-after-self		1297_count-of-smaller-numbers-after-self
12_min-stack		12_min-stack
130_heapify		130_heapify
132_word-search-2		132_word-search-2
134-lru-cache		134-lru-cache
137_clone-graph		137_clone-graph
138_subarray-sum		138_subarray-sum
139_subarray-sum-closest		139_subarray-sum-closest
13_strStr		13_strStr
143_sort-colors-2		143_sort-colors-2
148_sort-colors		148_sort-colors
14_first-position-of-target		14_first-position-of-target
1506_all-nodes-distance-k-in-binary-tree		1506_all-nodes-distance-k-in-binary-tree
152_combinations		152_combinations
154_regular-expression-matching		154_regular-expression-matching
155_minimum-depth-of-binary-tree		155_minimum-depth-of-binary-tree
156_merge-intervals		156_merge-intervals
15_permutations		15_permutations
161_rotate-image		161_rotate-image
165_merge-two-sorted-lists		165_merge-two-sorted-lists
167_add-two-numbers		167_add-two-numbers
16_permutations-2		16_permutations-2
178_graph-valid-tree		178_graph-valid-tree
17_subsets		17_subsets
1819_longest-semi-alternating-substring		1819_longest-semi-alternating-substring
1820_find-letter		1820_find-letter
1821_min-deletions-to-obtain-string-in-right-format		1821_min-deletions-to-obtain-string-in-right-format
1822_minimum-moves		1822_minimum-moves
1823_longest-prefix-of-array		1823_longest-prefix-of-array
192_wildcard-matching		192_wildcard-matching
193_longest-valid-parentheses		193_longest-valid-parentheses
213_string-compression		213_string-compression
215_rate-limiter		215_rate-limiter
221_add-two-numbers-ii		221_add-two-numbers-ii
245_subtree		245_subtree
246_binary-tree-path-sum-ii		246_binary-tree-path-sum-ii
28_search-a-2d-matrix		28_search-a-2d-matrix
30_insert-intervals		30_insert-intervals
32_minimum-window-substring		32_minimum-window-substring
33_n-queens		33_n-queens
35_reverse-linkedlist		35_reverse-linkedlist
365_sliding-window-maximum		365_sliding-window-maximum
36_reversed-linkedlist-2		36_reversed-linkedlist-2
374_spiral-matrix		374_spiral-matrix
376_binary-tree-path-sum		376_binary-tree-path-sum
380_intersection-of-two-linked-lists		380_intersection-of-two-linked-lists
386_longest-substring-with-at-most-k-distinct-characters		386_longest-substring-with-at-most-k-distinct-characters
389_valid-sudoku		389_valid-sudoku
38_search-a-2d-matrix-ii		38_search-a-2d-matrix-ii
392_house-robber		392_house-robber
399_nuts-and-bolts-problem		399_nuts-and-bolts-problem
3_longest-substring-without-repeating-characters		3_longest-substring-without-repeating-characters
400_maximum-gap		400_maximum-gap
40_implement-queue-by-two-stacks		40_implement-queue-by-two-stacks
417_valid-number		417_valid-number
41_maximum-subarray		41_maximum-subarray
428_Pow(x, n)		428_Pow(x, n)
42_maximum-subarray-2		42_maximum-subarray-2
431_onnected-component-in-undirected-graph		431_onnected-component-in-undirected-graph
433_number-of-islands		433_number-of-islands
434_number-of-islands-ii		434_number-of-islands-ii
43_maximum-subarray-3		43_maximum-subarray-3
447_search-in-a-big-sorted-array		447_search-in-a-big-sorted-array
450_reverse-nodes-in-k-group		450_reverse-nodes-in-k-group
452_remove-linked-list-elements		452_remove-linked-list-elements
453_flatten-binary-tree-to-linked-list		453_flatten-binary-tree-to-linked-list
464_sort-integers-2		464_sort-integers-2
469_same-tree		469_same-tree
471_top-k-frequent-words		471_top-k-frequent-words
474_lowest-common-ancestor-ii		474_lowest-common-ancestor-ii
480_binary-tree-paths		480_binary-tree-paths
486_merge-k-sorted-arrays		486_merge-k-sorted-arrays
494_implement-stack-by-two-queues		494_implement-stack-by-two-queues
512_decode-ways		512_decode-ways
514_paint-fence		514_paint-fence

KevinZhou92/Lintcode_Python

Folders and files

Latest commit

History