39. 组合总和
class Solution {
private:
vector<vector<int>> results;
vector<int> path;
//基本模版,注意可以重复选取
void backTracing(vector<int> & candidates, int target, int sum, int startIndex) {
if (sum > target) return;
if (sum == target) {
results.push_back(path);
return;
}
for (int i = startIndex; i < candidates.size(); i++) {
//注意加入path
sum += candidates[i];
path.push_back(candidates[i]);
//这里细节代表可以重复选取: 不用 i + 1
backTracing(candidates, target, sum, i);
sum -= candidates[i];
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
results.clear();
path.clear();
int sum = 0;
backTracing(candidates, target, sum, 0);
return results;
}
};
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) return;
if (sum == target) {
//对结果进行排序
sort(path.begin(), path.end());
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;
path.push_back(candidates[i]);
sum += candidates[i];
used[i] = true;
backtracking(candidates, target, sum, i+1, used);
//因为已经排序,所以pop的可能不是刚刚插入的那个元素
path.pop_back();
sum -= candidates[i];
used[i] = false;
}
}
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
//去重处理,要先进行排序,在排序后的每一层遍历,若当前层遍历中,path中的第一个元素与上一层遍历的第一个元素相同,可能回造成重复,则跳过该层次遍历
sort(candidates.begin(), candidates.end());
//这里的used数组用于去重操作
vector<bool> used(candidates.size(), false);
backtracking(candidates, target, 0, 0, used);
return result;
}
};
131. 分割回文串
//难点: 1、 回文判断
class Solution {
private:
vector<vector<string>> result;
vector<string> path; //存放已经是回文的子串
// 判断字符串是否为回文字符串
bool isPalindrome(const string& s, int startIndex, int endIndex) {
for (int i = startIndex, j = endIndex; i <= j; i++, j--) {
if (s[i] != s[j]) return false;
}
return true;
}
void backtracking(const string& s, int startIndex) {
//如果起始位置已经大于s的大小,说明已经找到了一组分割方案了
if (startIndex >= s.size()) {
result.push_back(path);
return;
}
for (int i = startIndex; i < s.size(); i++) {
//如果是回文子串,则将该子串放入path中
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();
}
}
public:
vector<vector<string>> partition(string s) {
backtracking(s, 0);
return result;
}
};