39.组合总和
class Solution {
public:
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); // 不用i+1了,表示可以重复读取当前的数
sum -= candidates[i];
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
backtracking(candidates,target,0,0);
return result;
}
};
40.组合总和II
此题相较于上题主要就是不能包含重复的集合(这是由于candidates中存在重复元素带来的)。解决方法是:使用一个used数组,在同一条路线中如果使用过就置为true;在回溯时,再相应的置为false。
class Solution {
public:
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();
}
}
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;
}
};
131.分割回文串
class Solution {
public:
vector<vector<string>> result;
vector<string> path;
void backtracking(const string& s,int startIndex){
if(startIndex >= s.size()){//此处只把符合条件的path放入,条件判断放在下面进行
result.push_back(path);
return;
}
for(int i =startIndex;i<s.size();i++){
if(isPalindrome(s,startIndex,i)){//判断[startIndex,i]中是否符合回文子串
path.push_back(s.substr(startIndex,i - startIndex +1));
}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;
}
vector<vector<string>> partition(string s) {
backtracking(s,0);
return result;
}
};