leetcode打卡#day31 491. 非递减子序列、46. 全排列、47. 全排列 II

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);
        } 
        //这里的uset代替了used数组,用于数组去重
        unordered_set<int> uset;
        for (int i = startIndex; i < nums.size(); i++) {
            //1、上一层插入的数据不在uset的最后一位，说明同一树层已经出现过
            //2、当前待插入的元素要 >= path的最后一个元素
            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 result;
    }
};

46. 全排列

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking (vector<int>& nums, vector<bool> used) {
        if (path.size() == nums.size()) {
            result.push_back(path);
            return;
        }
        for (int i = 0; i < nums.size(); i++) {
            //如果used[i] == true的话说明该数字已经被用过，不再使用
            if (used[i] == true) continue;
            path.push_back(nums[i]);
            used[i] = true;
            backtracking(nums, used);
            path.pop_back();
            used[i] = false;
        }
    }
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<bool> used(nums.size(), false);
        backtracking(nums, used);
        return result;
    }
};

去重复的全排

47. 全排列 II

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking (vector<int>& nums, vector<bool> used) {
        if (path.size() == nums.size()) {
            result.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();
        }
    }
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<bool> used(nums.size(),false);
        backtracking(nums, used);
        return result;
    }
};