class Solution {
public:
vector<int>path;
vector<vector<int> >ans;
void backtracking(vector<int>nums,int star){
if(star>=nums.size())return;
for(int i=star;i<nums.size();i++){
path.push_back(nums[i]);
ans.push_back(path);
backtracking(nums,i+1);
path.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
ans.push_back(path);
backtracking(nums,0);
return ans;
}
};
78. 子集
最新推荐文章于 2024-08-09 20:36:57 发布