LeetCode 491. 非递减子序列
class Solution {
private:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, int start_index) {
if(path.size() >= 2) {
result.push_back(path);
}
unordered_set<int> uset;
for(int i = start_index; i < nums.size(); i++) {
if(i > start_index && uset.find(nums[i]) != uset.end())
{
continue;
}
if(!path.empty() && nums[i] < path.back()) {
continue;
}
// 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();
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return result;
}
};
循环中 i > start_index 代表着同层,但并不意味着 i == start_index就是下一层
一个for循环只能在自己所处的层中进行判断,无法涉及下一层,类比层序遍历
LeetCode 46. 全排列
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int> &nums, vector<bool> array) {
if(path.size() == nums.size()) {
result.push_back(path);
return;
}
for(int i = 0; i < nums.size(); i++) {
if(array[i] == true) {
continue;
}
array[i] = true;
path.push_back(nums[i]);
backtracking(nums, array);
path.pop_back();
array[i] = false;
}
}
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> array(nums.size(), false);
backtracking(nums, array);
return result;
}
};
LeetCode 47. 全排列II
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, vector<bool> used) {
if(path.size() == nums.size()) {
result.push_back(path);
return;
}
vector<bool> row_used(21, false);
for(int i = 0; i < nums.size(); i++) {
if(row_used[nums[i] + 10] == true) { // 同层数字不同
continue;
}
if(used[i] == true) {
continue;
}
row_used[nums[i] + 10] = true;
path.push_back(nums[i]);
used[i] = true;
backtracking(nums, used); // 一个分支中序号不同
used[i] = false;
path.pop_back();
}
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return result;
}
};
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
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++) {
// 同一树枝共享一个used数组
// 如果发现相同数字,但是在自己这一根树枝上发现没有被标记,说明与自己是同一层
if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) {
continue;
}
if (used[i] == false) {
used[i] = true;
path.push_back(nums[i]);
used[i] = true;
backtracking(nums, used);
used[i] = false;
path.pop_back();
used[i] = false;
}
}
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return result;
}
};