29 Search(dfs) and BackTrack
Last updated
Was this helpful?
Last updated
Was this helpful?
所有search,或求具体方案,就用dfs。求个数用dp。
复杂度是O(答案个数*构造每个答案的时间)
(L123)
(L132)
(L582)
-- U+面经
(L136)
(L473)
411 Minimum Unique Word Abbreviation
294 Flip Game II
526 Beautiful Arrangement
L90 k Sum II
698 Partition to K Equal Sum Subsets
Divide and conquer
95 Unique Binary Search Tree II
241 Different Ways to Add Parentheses
other related:
293 Flip Game -- String
L89 k Sum - DP
-- Hash table
-- DP
(132)