20240320-算法复习打卡day29||* 491.递增子序列* 46.全排列* 47.全排列 II

Shiki.

于 2024-03-22 01:27:26 发布

阅读量128

点赞数 3

CC 4.0 BY-SA版权

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

本文链接：https://blog.csdn.net/qq_52784762/article/details/136617603

491.递增子序列

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; 
        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;
    }
};