[自我记录]随想录刷题第二十五天 | 491. 递增子序列, 46. 全排列, 47. 全排列 II

最新推荐文章于 2024-09-12 19:02:20 发布

快毕业的中狗

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量74

点赞数

文章标签：算法 c++ leetcode

本文链接：https://blog.csdn.net/GM819658820/article/details/131161534

版权

代码随想录算法打卡第二十五天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

491. 递增子序列

class Solution {
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        path.clear();
        result.clear();
        backtracking(nums, 0);
        return result;
    }
private:
    vector<int> path;
    vector<vector<int>> result;
    void backtracking(vector<int>& nums, int startIndex) {
        if (path.size() > 1) {
            result.push_back(path);
        }

        unordered_set<int> uset;
        for (int i = startIndex; i < nums.size(); ++i) {
            if (uset.find(nums[i]) != uset.end()) {
                continue;
            }
            if (!path.empty() && nums[i] < path.back()) {
                continue; 
            }
            uset.insert(nums[i]);
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }        
    }
};

46. 全排列

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        result.clear();
        path.clear();
        vector<bool> used(nums.size());
        if (nums.size() >= 1)
            backtracking(nums, used);
        return result;
    }
private:
    vector<int> path;
    vector<vector<int>> result;
    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;
            used[i] = true;
            path.push_back(nums[i]);
            backtracking(nums, used);
            used[i] = false;
            path.pop_back();
        }
    }
};

47. 全排列 II

class Solution {
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;
    }
private:
    vector<int> path;
    vector<vector<int>> result;
    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;
            if (i > 0 && used[i - 1] == false && nums[i] == nums[i - 1]) continue;
            used[i] = true;
            path.push_back(nums[i]);
            backtracking(nums, used);
            used[i] = false;
            path.pop_back();
        }
    }
};

希望再坚持一天!