文档讲解:代码随想录 (programmercarl.com)
视频讲解:代码随想录的个人空间-代码随想录个人主页-哔哩哔哩视频 (bilibili.com)
LeetCode 491.递增子序列
题目链接:491. 非递减子序列 - 力扣(LeetCode)
解题思路:用set或数组进行去重,不可以排序
代码如下:
class Solution {
public:
vector<vector<int>> res;
vector<int>path;
void backtracking(vector<int>& nums,int start){
if(start==nums.size())return;
int used[201] = {0}; // 这里使用数组来进行去重操作,题目说数值范围[-100, 100]
for(int i=start;i<nums.size();i++){
if((path.size()>0&&nums[i]<path.back())||(used[nums[i]+100]>=1))continue;
used[nums[i]+100]++;
path.push_back(nums[i]);
if(path.size()>=2)res.push_back(path);
backtracking(nums,i+1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums,0);
return res;
}
};
LeetCode 46.全排列
解题思路:AC.
解题代码如下(下面代码来自代码随想录 (programmercarl.com)):
class Solution {
public:
vector<vector<int>>res;
vector<int>path;
void backtracking(vector<int>&nums,vector<int>&used){
if(path.size()==nums.size()){
res.push_back(path);
return;
}
for(int i=0;i<nums.size();i++){
if(used[i]==1)continue;
path.push_back(nums[i]);
used[i]=1;
backtracking(nums,used);
used[i]=0;
path.pop_back();
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<int>used(nums.size(),0);
backtracking(nums,used);
return res;
}
};
LeetCode 47.全排列 II
题目链接:47. 全排列 II - 力扣(LeetCode)
解题思路:AC.
解题代码如下:
class Solution {
public:
vector<vector<int>>res;
vector<int>path;
void backtracking(vector<int>&nums,vector<int>&used1,vector<int>&used2){
if(path.size()==nums.size()){
res.push_back(path);
return;
}
for(int i=0;i<nums.size();i++){
if(used1[i]==1)continue;
if(i>0&&used2[i-1]==0&&nums[i-1]==nums[i])continue;
path.push_back(nums[i]);
used1[i]=1;
used2[i]=1;
backtracking(nums,used1,used2);
used1[i]=0;
used2[i]=0;
path.pop_back();
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<int>used1(nums.size(),0);
vector<int>used2(nums.size(),0);
sort(nums.begin(),nums.end());
backtracking(nums,used1,used2);
return res;
}
};