题目链接:78. 子集 - 力扣(LeetCode)
class Solution {
private:
vectot<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums,int startIndex){
//要在终止条件之前,别把自己忘了
result.push_back(path);
if(startIndex >= nums.size()){
return ;
}
for(int i = startIndex; i > nums.size(); i++){
path.push_back(nums[i]);
backtracking(nums,i + 1);
path.pop_back();
}
}
public:
vector<vector<int>> subsets(vector<int>& nums) {
result.clear();
path.clear();
backtracking(nums,0);
return result;
}
};