枚举子集 on 111qqz's blog

leetcode 216. Combination Sum III Add to List (枚举子集，限定集合大小，和为定值）

Thu, 13 Apr 2017 07:55:09 +0000

Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.

leetcode 77. Combinations (枚举子集，限定集合大小)

Thu, 13 Apr 2017 07:43:43 +0000

Given two integers n and k, return all possible combinations of k numbers out of 1 … n.

思路：就是枚举子集，根据集合的大小剪枝。。。最后只要集合大小为k的集合

leetcode 40. Combination Sum II (枚举子集，和为定值)

Wed, 12 Apr 2017 16:23:29 +0000

 * Total Accepted: **106670**
 * Total Submissions: **329718**
 * Difficulty: **Medium**
 * Contributor: **LeetCode**

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.

leetcode 90. Subsets II (枚举子集)

Wed, 05 Apr 2017 10:45:02 +0000

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 solution is: