增量法求所有子集,相比回溯,更快。
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> res(1,vector<int>());
if(nums.size() == 0) return res;
for(auto &x: nums){
vector<vector<int>> tool(res);
for(auto &t: tool){
t.push_back(x);
res.push_back(t);
}
}
return res;
}