Increasing Subsequences

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:

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

Subscribe to see which companies asked this question.

解析：

      求所有的递增序列，   dfs(vector<vector<int>>&ans,vector<int>&path,vector<int>nums,int begin)   表示从begin开始的所有递增序列，为了防止存在重复的子序列，定义一个vis表示前面相同的元素是否已经添加进去了。

代码：

class Solution {
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>>ans;
        vector<int>path;
        dfs(ans,path,nums,0);
        return ans;
    }
    
    void dfs(vector<vector<int>>&ans,vector<int>&path,vector<int>nums,int begin)
    {
        if (path.size()>=2)
        {
            ans.push_back(path);
        }
        
        
        vector<bool>vis(220,false);
        for (int i=begin; i<nums.size(); i++)
        {
            
            if (path.empty()||nums[i]>=(path[path.size()-1]))
            {
                if (vis[nums[i]+110])
                continue;
                vis[nums[i]+110]=true;
                
                path.push_back(nums[i]);
                dfs(ans,path,nums,i+1);
                path.pop_back();
            }
        }
        return ;
    }
    
};