LeetCode 全排列

最新推荐文章于 2024-10-17 19:06:39 发布

Hanknet

最新推荐文章于 2024-10-17 19:06:39 发布

阅读量132

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/Hanknet/article/details/130477283

版权

491. 递增子序列

方法：递归

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;
    void solve(vector<int>& nums, int idx) {
        if (path.size() > 1) res.push_back(path);
        unordered_set<int> vis;

        for (int i = idx; i < nums.size(); ++i) {
            if (!path.empty() && path.back() > nums[i] || vis.find(nums[i]) != vis.end()) continue;
            path.push_back(nums[i]);
            vis.insert(nums[i]);
            solve(nums, i + 1);
            path.pop_back();
        }
    }
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        res.clear();
        solve(nums, 0);
        return res;
    }
};

$时间复杂度O( $2^n$ *n),空间复杂度O(n)

46. 全排列

方法：递归·

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;
    void solve(vector<int>& nums, vector<bool>& vis) {
        if (path.size() == nums.size()) {
            res.push_back(path);
            return ;
        }
        for (int i = 0; i < nums.size(); ++i) {
            if (!vis[i]) {
                vis[i] = true;
                path.push_back(nums[i]);
                solve(nums, vis);
                path.pop_back();
                vis[i] = false;
            }
        }
    }
public:
    vector<vector<int>> permute(vector<int>& nums) {
        res.clear();
        int n = nums.size();
        vector<bool> vis(n, false);
        solve(nums, vis);
        return res;
    }
};

$时间复杂度O( $n*n!$ ),空间复杂度O(n)

47. 全排列 II

方法:递归

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;
    void solve(vector<int>& nums, vector<bool>& vis) {
        if (path.size() == nums.size()) {
            res.push_back(path);
            return ;
        }

        for (int i = 0; i < nums.size(); ++i) {
            if (i && nums[i] == nums[i-1] && vis[i-1] == false) continue;
            if (!vis[i]) {
                path.push_back(nums[i]); 
                vis[i] = true;
                solve(nums, vis);
                path.pop_back();
                vis[i] = false;
            }
        }
    }
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        int n = nums.size();
        vector<bool> vis(n, false);
        res.clear();
        sort(nums.begin(), nums.end());
        solve(nums, vis);
        return res;
    }
};

$时间复杂度O( $n*n!$ ),空间复杂度O(n)