給定一組不含重複元素的整數數組 nums,返回該數組所有可能的子集(冪集)。
說明:解集不能包含重複的子集。
示例:
輸入: nums = [1,2,3]
輸出:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]來源:力扣(LeetCode)
鏈接:https://leetcode-cn.com/problems/subsets
著作權歸領釦網絡所有。商業轉載請聯繫官方授權,非商業轉載請註明出處。
解法:
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums)
{
vector<vector<int>> res;
vector<int> curr;
help(nums, 0, res, curr);
for (auto c : res)
{
for (auto s : c)
cout << s << " ";
cout << endl;
}
return res;
}
void help(vector<int> & nums, int start, vector<vector<int>> & res, vector<int> &curr)
{
if (start == nums.size())
{
res.push_back(curr);
return;
}
curr.push_back(nums[start]);
help(nums, start + 1, res, curr);
curr.pop_back();
help(nums, start + 1, res, curr);
}
};
int main()
{
vector<int> nums;
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
int temp;
cin >> temp;
nums.push_back(temp);
}
Solution s;
s.subsets(nums);
return 0;
}