7.26代码随想录训练营第29天 | 回溯题目练习：491.递增子序列 ， 46.全排列 ， 47.全排列 II

第一题
491.递增子序列
递归法：

class Solution {
public:
    vector<int> vec;
    vector<vector<int>> out;
    void traversal(vector<int>& nums, int index){
        if(vec.size() >= 2){
            out.push_back(vec);
            
        }
        int used[201] = {0};
        for(int i = index; i < nums.size();i++){
            if((!vec.empty() && nums[i] < vec.back()) || used[nums[i] + 100] == 1) continue;
            vec.push_back(nums[i]);
            used[nums[i] + 100] = 1;
            traversal(nums, i+1);
            vec.pop_back();
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        traversal(nums, 0);
        return out;
    }
};

第二题
46.全排列
递归法：

class Solution {
public:
    vector<int> vec;
    vector<vector<int>> out;
    void traversal(vector<int>& nums, vector<bool>& used){
        if(vec.size() == nums.size()) {
            out.push_back(vec);
            return;
        }
        for(int i = 0; i < nums.size(); i++){
            if(used[i] == true) continue;
            vec.push_back(nums[i]);
            used[i] = true;
            traversal(nums, used);
            used[i] = false;
            vec.pop_back();
        }
    }
    vector<vector<int>> permute(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<bool> used(nums.size(), false);
        traversal(nums, used);
        return out;
    }
};

第三题
47.全排列 II
递归法：

class Solution {
public:
    vector<vector<int>> out;
    vector<int> vec;
    void traversal(vector<int>& nums, vector<bool>& used){
        if(vec.size() == nums.size()){
            out.push_back(vec);
            return;
        }
        for(int i = 0; i < nums.size(); i++){
            if((i > 0 && nums[i] == nums[i-1] && used[i-1] == false) || used[i] == true)continue;
            vec.push_back(nums[i]);
            used[i] = true;
            traversal(nums, used);
            used[i] = false;
            vec.pop_back();
        }
    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<bool> used(nums.size(), false);
        traversal(nums, used);
        return out;
    }
};