代码随想录算法训练营第二十八天|491.递增子序列、46.全排列、47.全排列II

题目链接：491.递增子序列

要点：回溯算法无法排序时的去重

class Solution {
public:
    vector<vector<int>> result;
    vector<int> vec;
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        backtracking(nums, 0);
        return result;
    }

    void backtracking(const vector<int>& nums, int start_idx) {
        if(vec.size() > 1) result.push_back(vec);
        if(start_idx == nums.size()) return;

        unordered_set<int> used;
        for(int i = start_idx; i < nums.size(); i++) {
            if(!vec.empty() && nums[i] < *(vec.end() - 1)) continue;
            if(used.find(nums[i]) != used.end()) continue;
            used.insert(nums[i]);
            vec.push_back(nums[i]);
            backtracking(nums, i + 1);
            vec.pop_back();
        }
    }
};

题目链接：46.全排列

要点：排列问题中的used数组

class Solution {
public:
    vector<int> path;
    vector<vector<int>> result;
    vector<vector<int>> permute(vector<int>& nums) {
        vector<bool> used(nums.size(), false);
        backtracking(nums, used);
        return result;
    }

    void backtracking(vector<int> &nums, vector<bool>& used) {
        if(nums.size() == path.size()) {
            result.push_back(path);
            return;
        }

        for(int i = 0; i < nums.size(); i++) {
            if(!used[i]) {
                path.push_back(nums[i]);
                used[i] = true;
                backtracking(nums, used);
                path.pop_back();
                used[i] = false;
            }
        }
    }
};

题目链接：47.全排列II

排列问题 中的去重

class Solution {
public:
    vector<int> vec;
    vector<vector<int>> result;
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<bool> used(nums.size(), false);
        backtracking(nums, used);
        return result;
    }

    void backtracking(vector<int>& nums, vector<bool>& used) {
        if(nums.size() == vec.size()) {
            result.push_back(vec);
            return;
        }

        for(int i = 0; i < nums.size(); i++) {
            if(i > 0 && nums[i] == nums[i - 1] && !used[i - 1]) continue;
            if(!used[i]){
            vec.push_back(nums[i]);
            used[i] = true;
            backtracking(nums, used);
            used[i] = false;
            vec.pop_back();
            }
        }
    }
};