491.非递减子序列
题目链接:491.非递减子序列
文档链接:491.非递减子序列
视频链接:回溯算法精讲,树层去重与树枝去重 | LeetCode:491.递增子序列
C++实现
class Solution {
private:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, int startIdx){
if(path.size()>1){
result.push_back(path);
}
unordered_set<int> uset;
for(int i = startIdx; 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();
}
return;
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
result.clear();
path.clear();
backtracking(nums, 0);
return result;
}
};
46.全排列
题目链接:46.全排列
文档链接:46.全排列
视频链接:组合与排列的区别,回溯算法求解的时候,有何不同?| LeetCode:46.全排列
C++实现
class Solution {
private:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, vector<bool> used){
if(path.size() == nums.size()){
result.push_back(path);
return;
}
for(int i = 0;i<nums.size();i++){
if(used[i] == true) continue;
used[i] = true;
path.push_back(nums[i]);
backtracking(nums, used);
used[i] = false;
path.pop_back();
}
return;
}
public:
vector<vector<int>> permute(vector<int>& nums) {
path.clear();
result.clear();
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return result;
}
};
47.全排列 II
题目链接:47.全排列 II
文档链接:47.全排列 II
视频链接:回溯算法求解全排列,如何去重?| LeetCode:47.全排列 II
C++实现
class Solution {
private:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, vector<bool> used){
if(path.size() == nums.size()){
result.push_back(path);
return;
}
for(int i = 0; i < nums.size(); i++){
if((used[i] == true) ||( i>0 && nums[i] == nums[i-1] && used[i-1] ==false)){
continue;
}
used[i] = true;
path.push_back(nums[i]);
backtracking(nums, used);
used[i] = false;
path.pop_back();
}
return;
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
path.clear();
result.clear();
sort(nums.begin(), nums.end());
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return result;
}
};