(LeetCode) 491. Increasing Subsequences

最新推荐文章于 2026-02-23 04:25:38 发布

原创最新推荐文章于 2026-02-23 04:25:38 发布 · 319 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

算法

当前文章被收录于：

算法

21 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一种算法，用于找出给定整数数组中所有不同的递增子序列，且子序列长度至少为2。通过深度优先搜索实现，考虑了数组可能包含重复元素的情况。

491. Increasing Subsequences

Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .

Example:

Input: [4, 6, 7, 7]
Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]

Note:

The length of the given array will not exceed 15.
The range of integer in the given array is [-100,100].
The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.

代码

class Solution {
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>> res;
        vector<int> tmp;
        dfs(nums, 0, tmp, res);
        return res;
    }

    void dfs(vector<int>& nums, int begin, vector<int> &tmp, vector<vector<int>> &res){
        if(tmp.size()>=2){
            res.push_back(tmp);
        }
        unordered_set<int> cache;
        for(int i=begin; i<nums.size(); ++i){
            if(tmp.empty() || nums[i]>=tmp.back()){
                if(cache.count(nums[i])!=0) continue;
                cache.insert(nums[i]);
                tmp.push_back(nums[i]);
                dfs(nums, i+1, tmp, res);
                tmp.pop_back();
            }
        }
    }
};