Arcome的博客

ProblemGiven a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.ExampleFor example,If nums = [1,2,3], a solution is:[ [3], [1

Subsets Series Subsets I: http://blog.youkuaiyun.com/arcome/article/details/53888806 Subsets II: ProblemGiven a collection of integers that might contain duplicates, nums, return all possible subsets

Combination Sum Series Combination Sum I: Combination Sum II: Combination Sum III: ProblemFind all possible combinations of k numbers that add up to a number n, given that only numbers f

Combination Sum Series Combination Sum I: Combination Sum II: Combination Sum III: http://blog.youkuaiyun.com/Arcome/article/details/53758448ProblemGiven a set of candidate numbers (C) (without

ProblemGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.Examplegiven n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())",

Permutations Series Permutations I: Permutations II: ProblemGiven a collection of distinct numbers, return all possible permutations.Example[1,2,3] have the following permutations:[ [1,2,3

ProblemGiven two integers n and k, return all possible combinations of k numbers out of 1 ... n.ExampleFor example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [