39. 组合总和
思路: 本题与216.组合总和III相似,只不过本题元素可以重复选取,因此只需要在递归时注意参数条件,使它可以重复选取就可以得到结果。
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void bt(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]);
bt(candidates,target,sum,i);
sum -= candidates[i];
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
bt(candidates,target,0,0);
return result;
}
};
40.组合总和II
思路: 本题要在结果集中去除重复结果集,并且给定的数组中会出现相同的元素,必须在操作时去除重复元素。因此建立一个used数组,记录元素是否使用过。对candidates进行排序处理,此时数组中相同元素会紧挨着,在递归时,若candidates[i] == candidates[i - 1]且candidates[i - 1]是没处理过的元素,那么此时跳过。
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void bt(vector<int>& candidates, int target, int sum, int startindex,
vector<bool>& used) {
if (sum > target) {
return;
}
if (sum == target) {
result.push_back(path);
return;
}
for (int i = startindex; i < candidates.size(); 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;
bt(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());
bt(candidates, target, 0, 0, used);
return result;
}
};
131.分割回文串
思路: 本题同样是使用回溯三部曲,在递归时不断截取字符串判断是否为回文,是就存入结果数组,不是就继续进行下一部分。
class Solution {
public:
vector<vector<string>> result;
vector<string> path;
void bt(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;
}
bt(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) {
bt(s, 0);
return result;
}
};