Given a set of distinct integers, nums, return all possible subsets.
Note: 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], [] ]
二进制生成子集,遍历i中的每一位,将“1”的放入数组
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
int n=nums.size();
vector<vector<int>> res;
for(int i=0;i<(1<<n);i++){
vector<int>v;
for(int j=0;j<n;j++){
if(i&(1<<j)) v.push_back(nums[j]);
}
res.push_back(v);
}
return res;
}
};