class Solution
{
public:
bool used[15] = { 0 };
vector<int> path;
vector<vector<int>> res;
void backtrack(vector<int>& nums, int startIndex)
{
if (path.size() > 1)
res.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;
path.push_back(nums[i]);
uset.insert(nums[i]);
backtrack(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums)
{
backtrack(nums, 0);
return res;
}
};
LeetCode491. 非递减子序列
最新推荐文章于 2024-07-13 13:36:16 发布