class Solution {
public:
vector<vector<int>> ans;
vector<int> temp;
vector<vector<int>> subsets(vector<int>& nums) {
dfs(0,nums);
return ans;
}
void dfs(int pos,const vector<int>& nums){
if(pos==nums.size()) {
ans.push_back(temp);
return;
}
temp.push_back(nums[pos]);
dfs(pos+1,nums);
temp.pop_back();
dfs(pos+1,nums);
}
};
状压DP的惯用写法。
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
int n = nums.size();
int limit = (1<<n);
vector<vector<int> > ans;
for(int s = 0; s < limit; s++) {
vector<int> temp;
for(int i = 0; i < n; i++) {
if((s>>i) & 1) {
temp.push_back(nums[i]);
}
}
ans.push_back(temp);
}
return ans;
}
};