Day28| 491 递增子序列 46 全排列 47 全排列 II

最新推荐文章于 2024-09-15 08:16:50 发布

蝶海梦花、

最新推荐文章于 2024-09-15 08:16:50 发布

阅读量1k

点赞数 2

文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/m0_74082772/article/details/136309119

版权

491 递增子序列

46 全排列

47 全排列 II

491 递增子序列

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;

     void backtracking(vector<int>& nums, int startindex){
        if(path.size() >= 2){
            result.push_back(path);
        }
        unordered_set<int> reSet;
        for(int i = startindex; i < nums.size(); i++){
            if(!path.empty() && nums[i] < path.back() || reSet.find(nums[i]) != reSet.end()){
                continue;
            }
            reSet.insert(nums[i]);
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
           
        }
    }

    vector<vector<int>> findSubsequences(vector<int>& nums) {
        result.clear();
        path.clear();
        backtracking(nums, 0);
        return result;
    }
};

46 全排列

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] == false){
                path.push_back(nums[i]);
                used[i] = true;
                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

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);
        }
        for(int i = 0; i < nums.size(); i++){
            if(i > 0 && nums[i] == nums[i-1] && used[i-1]){
                continue;
            }
            set.insert(nums[i]);
            if(used[i] == false){
                path.push_back(nums[i]);
                used[i] = true;
                backtracking(nums, used);
                path.pop_back();
                used[i] = false;
            }
        }
    }

    vector<vector<int>> permuteUnique(vector<int>& nums) {
        result.clear();
        path.clear();
        vector<bool> used(nums.size(), false);
        sort(nums.begin(), nums.end());
        backtracking(nums, used);
        return result;
    }
};