day 25 （代码随想录补卡）491.递增子序列|46.全排列 |47.全排列 II

qq_38788700

已于 2024-08-30 11:29:36 修改

阅读量198

点赞数 1

文章标签：算法

于 2024-08-30 11:29:34 首次发布

本文链接：https://blog.csdn.net/qq_38788700/article/details/141713637

版权

491.递增子序列

https://leetcode.cn/problems/non-decreasing-subsequences/description/

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);
           
        }
        unordered_set<int> uset; // 使用set对本层元素进行去重
        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) {
        result.clear();
        path.clear();
        backtracking(nums, 0);
        return result;
    }
};

46.全排列

https://leetcode.cn/problems/permutations/submissions/559811116/

class Solution {
public:
    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 (used[i] == true) continue; //path里已收录的元素，直接跳过
            used[i] = true;
            path.push_back(nums[i]);
            backtracking(nums,used);
            path.pop_back();   //回溯
            used[i] = false;
        }
    }
    vector<vector<int>> permute(vector<int>& nums) {
        result.clear();
        path.clear();
        vector<bool> used(nums.size(),false);
        backtracking(nums,used);
        return result;

    }
};

47.全排列 II

https://leetcode.cn/problems/permutations-ii/submissions/559811665/

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 - 1] == true，同一树枝nums[i - 1]使用过
            // used[i - 1] == false，同一树层nums[i - 1]使用过
            // 如果同一树层nums[i - 1]使用过则直接跳过
            if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) {
                continue;
            }
            if (used[i] == false) {
                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) {
        result.clear();
        path.clear();
        sort(nums.begin(), nums.end()); // 排序
        vector<bool> used(nums.size(), false);
        backtracking(nums, used);
        return result;
    }
};