LeetCode 491 递增子序列
题目链接:491
思路:求子序列不能对原数组进行排序。通过求子集的方式求子序列,由于本身要求是递增子序列,因此判断递增的同时也进行了去重。
代码:
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, int start) {
if (path.size() >= 2) result.push_back(path);
unordered_set<int> used;
for (int i=start; i<nums.size(); ++i) {
if (used.count(nums[i])) continue;
if (!path.empty() && nums[i] < path[path.size()-1]) continue;
used.emplace(nums[i]);
path.push_back(nums[i]);
backtracking(nums, i+1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
path.clear();
result.clear();
backtracking(nums, 0);
return result;
}
};
LeetCode 46 全排列
题目链接:46
思路:排列问题,不用startIndex
,在单层递归中直接遍历数组,同时进行树枝去重。
代码:
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, vector<int>& used) {
if (path.size() == nums.size()) {
result.push_back(path);
return;
}
for (int i=0; i<nums.size(); ++i) {
if (used[i]) continue;
path.push_back(nums[i]);
used[i] = 1;
backtracking(nums, used);
path.pop_back();
used[i] = 0;
}
}
vector<vector<int>> permute(vector<int>& nums) {
path.clear();
result.clear();
vector<int> used(nums.size());
backtracking(nums, used);
return result;
}
};
LeetCode 47 全排列 II
题目链接:47
思路:全排列的去重,即在原来的基础上进行树层去重即可。
代码:
class Solution {
public:
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]) continue;
if (i>0 && !used[i-1] && nums[i]==nums[i-1]) continue;
path.push_back(nums[i]);
used[i] = true;
backtracking(nums, used);
used[i] = false;
path.pop_back();
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
path.clear();
result.clear();
vector<bool> used(nums.size(), false);
sort(nums.begin(), nums.end());
backtracking(nums, used);
return result;
}
};