题意理解
给定一个数组,求它的全部子集
问题分析
用回溯法
待学习
其他
https://leetcode-cn.com/problems/subsets/
链接
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> ans;
vector<int> curr;
if (nums.size() == 0) {
ans.push_back(curr);
}
else {
helper(ans, nums, curr, 0);
}
return ans;
}
void helper(vector<vector<int>>& ans, vector<int>& nums, vector<int>& curr, int i) {
ans.push_back(curr);
for (int j = i; j < nums.size(); j++) {
curr.push_back(nums[j]);
helper(ans, nums, curr, j+1);
curr.pop_back();
}
}
};