Subsets
来源:互联网 发布:和淘宝类似的购物网站 编辑:程序博客网 时间:2024/06/06 08:23
Given a set of distinct integers, nums, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If nums = [1,2,3], a solution is:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If nums = [1,2,3], a solution is:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
思路:
(1)首先放入[] 到结果的vector<vector<int>>res的数组中,这个时候res的size为1
(2)将res中的集合中的vector<int>元素取出来,向其中添加nums数组中的元素而后再将结果添加到res中,这个时候res的size为2,这其中就有两个元素了,一个是[],一个是[nums[0]]
(3)以此类推即可
class Solution {public: vector<vector<int>> subsets(vector<int>& nums) { vector<vector<int>>res; vector<int>slo; if(nums.empty()) return res; sort(nums.begin(),nums.end()); res.push_back(slo); for(int i=0;i<nums.size();i++) { int n=res.size(); for(int j=0;j<n;j++) { slo=res[j]; slo.push_back(nums[i]); res.push_back(slo); } } return res; }};
0 0
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- Subsets
- 自定义ViewGroup的学习:九宫格
- iOS开发服务器返回(null) 与<null>的处理
- Could not find schema information for the element 'supportedRuntime'.
- SIP呼叫流程典型流程图解及其详细解释
- Java生成kml文件
- Subsets
- 修复mysql表
- javascript深入理解js闭包
- Activity向Fragment中传值
- Android下利用Bitmap切割图片
- iOS开发cell自定义高亮和选中背景颜色
- Python常用包帮助文档
- Ubuntu12.04(64bit)上部署编译运行Openfire+Spark环境
- “TDD已死”之论战调查