回溯
77、组合
回溯法解决组合问题。和排序问题不同的是，在组合问题中元素的顺序不考虑，只需要从当前位置向后寻找。排序问题每次都需要从头寻找，需要用visited数组记录访问过的元素。
class Solution {
private:
vector<vector<int>> result;
vector<int>path;
void backtracking(int n,int k,int startIndex){
if(path.size()==k){
result.push_back(path);
return;
}
for(int i=startIndex;i<=n;i++){
path.push_back(i);
backtracking(n,k,i+1);
path.pop_back();
}
}
public:
vector<vector<int>> combine(int n, int k) {
backtracking(n,k,1);
return result;
}
};
剪枝
class Solution {
private:
vector<vector<int>> result;
vector<int>path;
void backtracking(int n,int k,int startIndex){
if(path.size()==k){
result.push_back(path);
return;
}
for(int i=startIndex; i <= n - (k - path.size()) + 1;i++){
path.push_back(i);
backtracking(n,k,i+1);
path.pop_back();
}
}
public:
vector<vector<int>> combine(int n, int k) {
backtracking(n,k,1);
return result;
}
};
216、组合总和III
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(int targetSum,int k,int sum,int startIndex){
if(path.size()==k){
if(sum==targetSum)result.push_back(path);
return;
}
for(int i=startIndex;i<=9;i++){
sum+=i;
path.push_back(i);
backtracking(targetSum,k,sum,i+1);
sum-=i;
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(n,k,0,1);
return result;
}
};
剪枝
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(int targetSum,int k,int sum,int startIndex){
if (sum > targetSum) {
// 剪枝操作
return;
// 如果path.size() == k 但sum != targetSum 直接返回
}
if(path.size()==k){
if(sum==targetSum)result.push_back(path);
return;
}
for(int i=startIndex;i <= 9 - (k - path.size()) + 1;i++){
sum+=i;
path.push_back(i);
backtracking(targetSum,k,sum,i+1);
sum-=i;
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(n,k,0,1);
return result;
}
};
17、电话号码的字母组合
class Solution {
private:
const string letterMap[10]={
"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
public:
vector<string>result;
string s;
void backtracking(const string& digits,int index){
if(index==digits.size()){
result.push_back(s);
return;
}
int digit=digits[index]-'0';
string letters=letterMap[digit];
for(int i=0;i<letters.size();i++){
s.push_back(letters[i]);
backtracking(digits,index+1);
s.pop_back();
}
}
vector<string> letterCombinations(string digits) {
if(digits.size()==0){
return result;
}
backtracking(digits,0);
return result;
}
};
39、组合总数（无重复元素）
可以重复选取体现在递归时，标号不用加一
而只要是同一个集合的组合问题都要有startIndex
什么时候需要startIndex
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& candidates,int target,int sum,int startIndex){
if(sum>target){
return;
}
if(sum==target){
result.push_back(path);
return;
}
for(int i=startIndex;i<candidates.size();i++){
sum+=candidates[i];
path.push_back(candidates[i]);
backtracking(candidates,target,sum,i);
sum-= candidates[i];
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
backtracking(candidates,target,0,0);
return result;
}
};
剪枝优化
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& candidates,int target,int sum,int startIndex){
// if (sum > target) {
// return;
// }
if(sum==target){
result.push_back(path);
return;
}
for(int i=startIndex; i < candidates.size() && sum + candidates[i]
<= target;i++){
sum+=candidates[i];
path.push_back(candidates[i]);
backtracking(candidates,target,sum,i);
sum-= candidates[i];
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end()); // 需要排序
backtracking(candidates,target,0,0);
return result;
}
};
40、组合总数II（有重复元素）
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& candidates,int target,int sum,int startIndex,vector<bool>& used){
if(sum==target){
result.push_back(path);
return;
}
for(int i=startIndex;i<candidates.size()&&sum+candidates[i]<=target;i++){
if(i>0&&candidates[i]==candidates[i-1]&&used[i-1]==false){
continue;
}
sum+=candidates[i];
path.push_back(candidates[i]);
used[i]=true;
backtracking(candidates,target,sum,i+1,used);
used[i]=false;
sum-=candidates[i];
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<bool>used(candidates.size(),false);
sort(candidates.begin(),candidates.end());
backtracking(candidates,target,0,0,used);
return result;
}
};
用set去重版
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& candidates, int target, int sum, int
startIndex) {
if (sum == target) {
result.push_back(path);
return;
}
unordered_set<int> uset; // 控制某⼀节点下的同⼀层元素不能重复
for (int i = startIndex; i < candidates.size() && sum + candidates[i]
<= target; i++) {
if (uset.find(candidates[i]) != uset.end()) {
continue;
}
uset.insert(candidates[i]); // 记录元素
sum += candidates[i];
path.push_back(candidates[i]);
backtracking(candidates, target, sum, i + 1);
sum -= candidates[i];
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
path.clear();
result.clear();
sort(candidates.begin(), candidates.end());
backtracking(candidates, target, 0, 0);
return result;
}
};
131、分割回文串
切割问题类似组合问题
class Solution {
private:
vector<vector<string>>result;
vector<string>path;
void backtracking(const string& s,int startIndex){
if(startIndex>=s.size()){
result.push_back(path);
return;
}
for(int i=startIndex;i<s.size();i++){
if(isPalindrome(s,startIndex,i)){
string str=s.substr(startIndex,i-startIndex+1);
path.push_back(str);
}else{
continue;
}
backtracking(s,i+1);
path.pop_back();
}
}
bool isPalindrome(const string& s,int start,int end){
for(int i=start,j=end;i<j;i++,j--){
if(s[i]!=s[j]){
return false;
}
}
return true;
}
public:
vector<vector<string>> partition(string s) {
backtracking(s,0);
return result;
}
};
93、复原IP地址（分割问题）
class Solution {
private:
vector<srting>result;
void backtracking(string& s,int startIndex,int pointNum){
if(pointNum==3){
if(isValid(s,startIndex,s.size()-1)){
result.push_back(s);
}
return;
}
for(int i=startIndex;i<s.size();i++){
if(isValid(s,startIndex,i)){
s.insert(s.begin()+i+1,'.');
pointNum++;
backtracking(s,i+2,pointNum);
pointNum--;
s.erase(s.begin()+i+1);
}else break;
}
}
bool isValid(const string& s,int start,int end){
if(start>end){
return false;
}
if(s[start]=='0'&&start!=end){
return false;
}
int num=0;
for(int i=start;i<=end;i++){
if(s[i]>'9'||s[i]<'0'){
return false;
}
}
return true;
}
public:
vector<string> restoreIpAddresses(string s) {
if(s.size()>12)return result;
backtracking(s,0,0);
return result;
}
};
78、子集（不包含重复元素）
如果把 ⼦集问题、组合问题、分割问题都抽象为⼀棵树的话，那么组合问题和分割问题都是收集树的叶⼦节点，⽽⼦集问题是找树的所有节点
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& nums,int startIndex){
result.push_back(path);
if(startIndex>=nums.size()){
return;
}
for(int i=startIndex;i<nums.size();i++){
path.push_back(nums[i]);
backtracking(nums,i+1);
path.pop_back();
}
}
public:
vector<vector<int>> subsets(vector<int>& nums) {
backtracking(nums,0);
return result;
}
};
90、子集II（包含重复元素）
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, int startIndex, vector<bool>& used) {
result.push_back(path);
for (int i = startIndex; i < nums.size(); i++) {
// used[i - 1] == true，说明同一树支candidates[i - 1]使用过
// used[i - 1] == false，说明同一树层candidates[i - 1]使用过
// 而我们要对同一树层使用过的元素进行跳过
if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) {
continue;
}
path.push_back(nums[i]);
used[i] = true;
backtracking(nums, i + 1, used);
used[i] = false;
path.pop_back();
}
}
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<bool> used(nums.size(), false);
sort(nums.begin(), nums.end()); // 去重需要排序
backtracking(nums, 0, used);
return result;
}
};
用set去重版本
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, int startIndex, vector<bool>& used) {
result.push_back(path);
unordered_set<int> uset; // 定义set对同⼀节点下的本层去重
for (int i = startIndex; i < nums.size(); i++) {
if (uset.find(nums[i]) != uset.end()) { // 如果发现出现过就pass
continue;
}
uset.insert(nums[i]); // set跟新元素
path.push_back(nums[i]);
backtracking(nums, i + 1, used);
path.pop_back();
}
}
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<bool> used(nums.size(), false);
sort(nums.begin(), nums.end()); // 去重需要排序
backtracking(nums, 0, used);
return result;
}
};
491、递增子序列
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& nums,int startIndex){
if(path.size()>1){
result.push_back(path);
}
unordered_set<int>uset;
for(int i=startIndex;i<nums.size();i++){
if((!path.empty()&&nums[i]<path.back())||uset.find(nums[i])!=uset.end()){
continue;
}
uset.insert(nums[i]);
path.push_back(nums[i]);
backtracking(nums,i+1);
path.pop_back();
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums,0);
return result;
}
};
优化
其实⽤数组来做哈希，效率就⾼了很多。
注意题⽬中说了，数值范围[-100,100]，所以完全可以⽤数组来做哈希。
程序运⾏的时候对unordered_set 频繁的insert，unordered_set需要做哈希映射（也就是把key通过hash function映射为唯⼀的哈希值）相对费时间，⽽且每次重新定义set，insert的时候其底层的符号表也要做相应的扩充，也是费事的。
数组，set，map都可以做哈希表，⽽且数组⼲的活，map和set都能⼲，但如何数值范围⼩的话能⽤数组尽量⽤数组。
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& nums,int startIndex){
if(path.size()>1){
result.push_back(path);
}
// unordered_set<int>uset;
int used[201] = {0};
for(int i=startIndex;i<nums.size();i++){
if((!path.empty()&&nums[i]<path.back())|| used[nums[i] + 100] == 1){
continue;
}
// uset.insert(nums[i]);
used[nums[i] + 100] = 1;
path.push_back(nums[i]);
backtracking(nums,i+1);
path.pop_back();
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums,0);
return result;
}
};
46、全排列（不包含重复数组）
处理排列问题就不⽤使⽤startIndex
class Solution {
public:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& nums,vector<bool>& used){
if(path.size()==nums.size()){
result.push_back(path);
return;
}
for(int i=0;i<nums.size();i++){
if(used[i]==true)continue;
used[i]=true;
path.push_back(nums[i]);
backtracking(nums,used);
path.pop_back();
used[i]=false;
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool>used(nums.size(),false);
backtracking(nums,used);
return result;
}
};
47、全排列II(包含重复数字）
去重涉及到排序
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& nums,vector<bool>& used){
if(path.size()==nums.size()){
result.push_back(path);
return;
}
for(int i=0;i<nums.size();i++){
if(i>0&&nums[i]==nums[i-1]&&used[i-1]==false){
continue;
}
if(used[i]==false){
used[i]=true;
path.push_back(nums[i]);
backtracking(nums,used);
path.pop_back();
used[i]=false;
}
}
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(),nums.end());
vector<bool>used(nums.size(),false);
backtracking(nums,used);
return result;
}
};
用set去重版本
class Solution {
private:
vector<vector<int>>result;
vector<int>path;
void backtracking(vector<int>& nums,vector<bool>& used){
if(path.size()==nums.size()){
result.push_back(path);
return;
}
unordered_set<int>uset;
for(int i=0;i<nums.size();i++){
if(uset.find(nums[i]!=uset.end()){
continue;
}
if(used[i]==false){
uset.insert(nums[i]);
used[i]=true;
path.push_back(nums[i]);
backtracking(nums,used);
path.pop_back();
used[i]=false;
}
}
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(),nums.end());
vector<bool>used(nums.size(),false);
backtracking(nums,used);
return result;
}
};
332、重新安排行程
136
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
