给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: nums = [1,2,3]
输出:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
附上作者原文地址:https://www.cnblogs.com/ariel-dreamland/p/9154503.html
排列组合类型的题目,确实做的少,做完之后就忘,上次做的是电话号码,还得多复习。
#include<iostream>
#include<vector>
#include<stdlib.h>
using namespace std;
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> res(1);
for (int i = 0; i < nums.size(); i++) {
int size = res.size();
for (int j = 0; j < size; j++) {
res.push_back(res[j]);
res.back().push_back(nums[i]);
}
}
return res;
}
};
int main() {
vector<int> nums = { 1,2,3 };
Solution *ps = new Solution();
vector<vector<int>> res = ps->subsets(nums);
for (int i = 0; i < res.size(); i++) {
vector<int> temp = res[i];
for (int j = 0; j < temp.size(); j++) {
cout << temp[j] << " ";
}
cout << endl;
}
system("pause");
return 0;
}