目录
题目:
代码(首刷看解析 2024年2月3日):
class Solution {
private:
vector<vector<int>> res;
vector<int> path;
public:
void backtracking(vector<int>& nums, int startIndex) {
if (path.size() > 1) {
res.push_back(path);
}
unordered_set<int> uset;
for (int i = startIndex; i < nums.size(); ++i) {
if (!path.empty() && nums[i] < path.back() ||
uset.find(nums[i]) != uset.end()) {
continue;
}
uset.insert(nums[i]);
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return res;
}
};
代码(二刷看解析 2024年5月23日)
class Solution {
private:
vector<vector<int>> res;
vector<int> path;
void backtracking(vector<int>& nums, int startIndex) {
if (path.size() > 1) {
res.push_back(path);
}
unordered_set<int> uset;//同一层去重,当递归时会清空
for (int i = startIndex; i < nums.size(); i++) {
if ((path.size() > 0 && nums[i] < path.back()) ||
(uset.contains(nums[i])))
continue;
uset.insert(nums[i]);
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
res.clear();
path.clear();
backtracking(nums, 0);
return res;
}
};