题目部分
39.组合总和
基本自己写的,跟之前的差不多,比较简单
class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
result.clear();
path.clear();
sort(candidates.begin(),candidates.end());
traceback(candidates,target,0,0);
return result;
}
void traceback(vector<int>& candidates,int target,int sum,int startIndex){
if(sum==target){
result.push_back(path);
return;
}else if(sum>target){
return;
}
for(int i=startIndex;i<candidates.size()&&(sum+candidates[i])<=target;i++){
path.push_back(candidates[i]);
sum+=candidates[i];
traceback(candidates,target,sum,i);
sum-=candidates[i];
path.pop_back();
}
}
private:
vector<vector<int>> result;
vector<int> path;
};
40.组合综合2
这个要求和之前的不一样一些,数字有重复,允许树枝重复但不允许树层重复,用到了used数组
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
result.clear();
path.clear();
vector<bool> used(candidates.size(), false);
sort(candidates.begin(),candidates.end());
traceback(candidates,target,0,0,used);
return result;
}
void traceback(vector<int>& candidates,int target,int sum,int startIndex,vector<bool>& used){
if(sum==target){
result.push_back(path);
return;
}else if(sum>target) return;
for(int i=startIndex;i<candidates.size()&& sum + candidates[i] <= target;i++){
if(i>0&&candidates[i]==candidates[i-1]&&used[i-1]==0)continue;
path.push_back(candidates[i]);
sum+=candidates[i];
used[i]=true;
traceback(candidates,target,sum,i+1,used);
path.pop_back();
sum-=candidates[i];
used[i]=false;
}
return;
}
private:
vector<vector<int>> result;
vector<int> path;
};
131.分割回文字符串
比较难的一道题目
class Solution {
public:
vector<vector<string>> partition(string s) {
backtracking(s,0);
return result;
}
private:
vector<vector<string>> result;
vector<string> path;
void backtracking(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();
}
return;
}
bool isPalindrome(string s,int startIndex,int end){
for(;startIndex<end;startIndex++,end--){
if(s[startIndex]!=s[end]){
return false;
}
}
return true;
}
};