LeetCode 78. Subsets
2016-11-20 10:51
381 查看
描述
给出一个数组,求出所有的子数组解决
高中的排列组合问题,记录数组的长度为n,则可以取的组合为C(n, 0), C(n, 1), C(n,2)直到C(n,n),又因为C(n, 0) + C(n, 1) + ....+C(n, n) = 2 ^ n,即判断每个数是否取出来
class Solution { public: vector<vector<int>> res; vector<int> temp; int length; vector<vector<int>> subsets(vector<int>& nums) { length = nums.size(); help(0, nums); return res; } void help(int pos, vector<int> &nums) { if (pos == length) { res.push_back(temp); return ; } temp.push_back(nums[pos]); help(pos + 1, nums); temp.pop_back(); help(pos + 1, nums); } };
相关文章推荐
- LeetCode(78) Subsets
- [LeetCode 78] Subsets
- LeetCode78 Subsets
- [Leetcode] 78. Subsets
- Leetcode 78. Subsets & 90. Subsets II
- Leetcode 78. Subsets
- Leetcode 78 Subsets
- [leetcode]78. Subsets
- LeetCode 78 Subsets
- 递归-数组的子集:leetcode 78 Subsets
- [leetcode 78] Subsets
- 【LeetCode】78_Subsets
- LeetCode 78. Subsets
- [LeetCode]78. Subsets
- [LeetCode] 78. Subsets
- [Leetcode]#78 Subsets
- LeetCode 78 Subsets
- LeetCode 78 Subsets (所有子集)
- Leetcode 78 Subsets
- LeetCode 78. Subsets