目录
题目:
代码(首刷看解析 2024年2月3日):
class Solution {
private:
vector<vector<int>> res;
vector<int> path;
public:
void backtracking(vector<int>& nums, int startIndex) {
res.push_back(path);
for (int i = startIndex; i < nums.size(); ++i) {
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
backtracking(nums, 0);
return res;
}
};
代码(二刷自解 2024年3月7日)
class Solution {
public:
vector<vector<int>> result;
vector<int> paths;
void backtracking(vector<int>& nums, int startIndex) {
result.push_back(paths);
// 遍历
for (int i = startIndex; i < nums.size(); ++i) {
// 更新paths
paths.emplace_back(nums[i]);
// 递归
backtracking(nums, i + 1);
// 回溯
paths.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
result.clear();
paths.clear();
backtracking(nums, 0);
return result;
}
};
代码(三刷自解 2024年5月23日)
class Solution {
private:
vector<vector<int>> res;
vector<int> path;
void backtracking(vector<int>& nums, int startIndex) {
res.push_back(path);
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) {
res.clear();
path.clear();
backtracking(nums, 0);
return res;
}
};