Leetcode491.递增子序列
思路:子集问题,不能排序,利用unordered_set去重或者根据题目条件用数组做哈希运算。
利用unordered_set去重
class Solution {
public:
vector<vector<int>>res;
vector<int> path;
void backtracking (vector<int>& nums, int startIndex) {
if (path.size() > 1) {
res.push_back(path);
}
if (startIndex >= nums.size()){
return ;
}
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;
}
};
利用数组做哈希:
class Solution {
public:
vector<vector<int>>res;
vector<int> path;
void backtracking (vector<int>& nums, int startIndex) {
if (path.size() > 1) {
res.push_back(path);
}
if (startIndex >= nums.size()){
return ;
}
int used[201] = {0};
for (int i = startIndex; i < nums.size(); i++){
if ((!path.empty() && nums[i] < path.back()) || used[nums[i] + 100] == 1) continue;
used[nums[i] + 100] = 1;
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return res;
}
};
Leetcode46.全排列
思路:排列问题,每次递归都从0开始,不用startIndex;另外用used标记一下本次递归用过的元素将其跳过
class Solution {
public:
vector<vector<int>> res;
vector<int> path;
void backtracking(vector<int>& nums, vector<bool>& used){
if (path.size() == nums.size()){
res.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);
path.pop_back();
used[i] = false;
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return res;
}
};
Leetcode47.全排列 II
思路:加了一个排序后去重,另外这题树层去重和树枝去重均可。
class Solution {
public:
vector<vector<int>> res;
vector<int> path;
void backtracking(vector<int>& nums, vector<bool>& used){
if (path.size() == nums.size()) {
res.push_back(path);
return ;
}
for (int i = 0; i < nums.size(); i++) {
if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) continue;
if (used[i] == true) continue;
used[i] = true;
path.push_back(nums[i]);
backtracking(nums, used);
used[i] = false;
path.pop_back();
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return res;
}
};
即这里的树层去重
if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) continue;
改成树枝去重也可以
if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == true) continue;
不过还是觉得树层去重更好理解一些,而且效率也是更快的。
第二十九天打卡,昨天练的胸痛,今天上午没去健身,把题刷了,今天争取多学一些操作系统,加油!!!