解法一 recursion DFS
class Solution {
public:
vector<vector<int>> subsets(vector<int> &nums) {
vector<vector<int>> res;
vector<int> temp;
sort(nums.begin(), nums.end());
helper(nums, 0, temp, res);
return res;
}
void helper(vector<int>& nums, int i, vector<int>& temp, vector<vector<int>>& res){
res.push_back(temp);
for(;i<nums.size();i++){
temp.push_back(nums[i]);
helper(nums, i+1, temp, res);
temp.pop_back();
}
}
};
解法二 non-recursion
BFS
class Solution {
public:
vector<vector<int>> subsets(vector<int> &nums) {
vector<vector<int>> res{};
sort(nums.begin(), nums.end());
queue<vector<int>> q;
q.push(vector<int>{});
while(!q.empty()){
vector<int> temp = q.front(); q.pop();
res.push_back(temp);
for(int i=0;i<nums.size();i++){
if(temp.empty() || temp[temp.size()-1]<nums[i]){
temp.push_back(nums[i]);
q.push(temp);
temp.pop_back();
}
}
}
return res;
}
};
利用二进制