[leetcode]Increasing Subsequences
链接:https://leetcode.com/problems/increasing-subsequences/description/
Question
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]]
- 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.
Solution
class Solution {
public:
vector<vector<int> > res;
set<vector<int> > myset;
vector<vector<int>> findSubsequences(vector<int>& nums) {
// 记得把成员变量清空
res.clear();
vector<int> midvec;
dfs(nums, 0, midvec);
for (auto it = myset.begin(); it != myset.end(); it++)
res.push_back(*it);
return res;
}
void dfs(vector<int> nums, int iend, vector<int> midvec) {
if (iend == nums.size()) {
if (midvec.size() > 1) myset.insert(midvec);
return;
}
// 不加入iend元素
dfs(nums, iend+1, midvec);
bool canAdd = true;
for (int i = 0; i < midvec.size(); i++) {
if (nums[iend] < midvec[i]) {
canAdd = false;
break;
}
}
if (canAdd) {
midvec.push_back(nums[iend]);
dfs(nums, iend+1, midvec);
}
}
};
思路:使用递归回溯,一种是不加如iend元素,另一种是经过判断之后发现可以加入iend元素。