491. 非递减子序列
方法:回溯
类似求子集问题,但是不能先排序,利用unorder_set来记录本层元素是否重复使用
class Solution {
private:
vector<int> path;
vector<vector<int>> ret;
void backtracking(vector<int>& nums, int startIndex) {
if (path.size() >= 2) ret.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();
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return ret;
}
};
46. 全排列
方法:回溯
与之前问题相比不需要startIndex了,因为排列问题for循环每层都是从数组首元素开始,而used数组,其实就是记录此时path里都有哪些元素使用了,一个排列里一个元素只能使用一次
class Solution {
private:
vector<int> path;
vector<vector<int>> ret;
void backtracking(vector<int>& nums, vector<bool>& used) {
if (path.size() == nums.size()) {
ret.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;
}
}
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(), 0);
backtracking(nums, used);
return ret;
}
};
47. 全排列 II
方法:回溯
和40,90,一样的去重,但是这个题树层去重和树枝去重都可以
class Solution {
private:
vector<int> path;
vector<vector<int>> ret;
void backtracking(vector<int>& nums, vector<bool>& used) {
if (path.size() == nums.size()) {
ret.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);
path.pop_back();
used[i] = false;
}
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<bool> used(nums.size(), 0);
backtracking(nums, used);
return ret;
}
};