回溯法
文章平均质量分 85
candy_crush
胡编乱写
展开
-
Combination Sum I,II,III
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimited numb原创 2016-08-20 20:22:33 · 226 阅读 · 0 评论 -
Subsets 子集和
Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,3], a solution is: [ [3], [1],原创 2016-08-24 11:48:46 · 299 阅读 · 0 评论 -
Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,2], a sol原创 2016-08-24 12:45:24 · 206 阅读 · 0 评论