【代码随想录】day29

最新推荐文章于 2024-07-25 21:13:04 发布

weixin_47041555

最新推荐文章于 2024-07-25 21:13:04 发布

阅读量218

点赞数 2

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

本文链接：https://blog.csdn.net/weixin_47041555/article/details/137039080

版权

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

文章目录

一、491递增子序列
二、46全排列
三、47全排列 II

一、491递增子序列

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    void backtracking(vector<int>& nums, int startIndex) {
        if (path.size() > 1) {
            res.push_back(path);
        }
        unordered_set<int> set;
        for (int i = startIndex; i < nums.size(); i ++) {
            if (set.find(nums[i])!= set.end()) {
                continue;
            }
            if (path.size() > 0 && nums[i] < path.back()) {
                continue;
            }
            set.insert(nums[i]);
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }

    vector<vector<int>> findSubsequences(vector<int>& nums) {
        backtracking(nums, 0);
        return res;
    }
};

二、46全排列

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    vector<int> seen;
    void backtracking(vector<int>& nums) {
        if (path.size() == nums.size()) {
            res.push_back(path);
            return;
        }
        for (int i = 0; i < nums.size(); i ++) {
            if (seen[i] == 1) {
                continue;
            }
            path.push_back(nums[i]);
            seen[i] = 1;
            backtracking(nums);
            path.pop_back();
            seen[i] = 0;
        }
    }

    vector<vector<int>> permute(vector<int>& nums) {
        seen.resize(nums.size());
        backtracking(nums);
        return res;
    }
};

三、47全排列 II

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    void backtracking(vector<int>& nums, vector<int>& seen) {
        if (path.size() == nums.size()) {
            res.push_back(path);
            return;
        }
        unordered_set<int> set;
        for (int i = 0; i < nums.size(); i ++) {
            if (set.find(nums[i]) != set.end()) {
                continue;
            }
            if (seen[i] == 1) {
                continue;
            }
            set.insert(nums[i]);
            path.push_back(nums[i]);
            seen[i] = 1;
            backtracking(nums, seen);
            path.pop_back();
            seen[i] = 0;
        }

    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<int> seen(10);
        backtracking(nums, seen);
        return res;
    }
};