- 博客(3)
- 收藏
- 关注
RSS订阅原创 LC40 Combination Sum II 回溯
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combination.N...
2018-03-22 19:00:01
142
原创 LC22 General Parentheses 回溯/递归 生产所有有效的括号对
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())", "...
2018-03-21 22:14:39
216
原创 LC46, 47 Permutation I and II 回溯
LC46 PermutationGiven a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], ...
2018-03-07 20:10:30
194
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人