代码随想录算法训练营Day27 | 39. 组合总和40.组合总和II 131.分割回文串
LeetCode 39. 组合总和
题目链接:LeetCode 39. 组合总和
思路:
收集元素,起点为i,而不是i+1
class Solution {
public:
vector<int> path;
vector<vector<int>> res;
void backtracking(vector<int>& candidates, int target, int sum, int startIndex){
if(sum >= target){
if(sum == target) res.push_back(path);
return;
}
for (int i = startIndex; i<candidates.size(); i++){
path.push_back(candidates[i]);
backtracking(candidates,target, sum+candidates[i], i);
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
path.clear();
res.clear();
backtracking(candidates,target, 0, 0);
return res;
}
};
注意 :
- 其余的条件不变。
LeetCode 40.组合总和II
题目链接:LeetCode 40.组合总和II
思路:
重点为去重
class Solution {
public:
vector<int> path;
vector<vector<int>> res;
void backtracking (vector<int>& candidates, int target, int sum, int startIndex, vector<bool>& used){
if(sum >= target){
if(sum == target) res.push_back(path);
}
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;
path.push_back(candidates[i]);
used[i] = true;
backtracking(candidates, target, sum+candidates[i], i+1, used);
path.pop_back();
used[i] = false;
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
res.clear();
path.clear();
vector<bool> used(candidates.size(), false);
sort(candidates.begin(),candidates.end());
backtracking(candidates, target, 0, 0, used);
return res;
}
};
注意 :
- used数组用于记录
- 如果candidates[i] == candidates[i - 1] 并且 used[i - 1] == false,就说明:前一个树枝,使用了candidates[i - 1],也就是说同一树层使用过candidates[i - 1]。
LeetCode 131.分割回文串
题目链接:LeetCode 131.分割回文串
思路:
1.用index代表切割点
class Solution {
public:
vector<vector<string>> res;
vector<string> path;
bool isPanlindrome(string& ss, int start, int end){
for(int i=start,j=end; i<j; i++,j-- ){
if(ss[i] != ss[j]) return false;
}
return true;
}
void backtracking(string s, int index){
if(index == s.size()){
res.push_back(path);
return;
}
for(int i=index; i<s.size();i++){
if(isPanlindrome(s, index, i)){
string str = s.substr(index, i-index+1);
path.push_back(str);
}
else{
continue;
}
backtracking(s, i+1);
path.pop_back();
}
}
vector<vector<string>> partition(string s) {
if(!s.size()) return res;
backtracking(s, 0);
return res;
}
};
注意 :
- 在push时判断是否满足条件,否则向后