491.递增子序列
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, int startIndex) {
if (path.size() > 1) {
result.push_back(path);
}
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();
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
result.clear();
path.clear();
backtracking(nums, 0);
return result;
}
};
46.全排列
class Solution {
vector<vector<int>> res;
vector<int> path;
void traversal(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]==false)
{
path.push_back(nums[i]);
used[i] = true;
traversal(nums, used);
path.pop_back();
used[i] = false;
}
}
return;
}
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(),false);
path.clear();
res.clear();
traversal(nums,used);
return res;
}
};
47.全排列 II
class Solution {
vector<vector<int>> res;
vector<int> path;
void traversal(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;
if(i>0&&used[i-1]==false&&nums[i]==nums[i-1]) continue;
path.push_back(nums[i]);
used[i] = true;
traversal(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(), false);
res.clear();
path.clear();
traversal(nums ,used);
return res;
}
};