39. 组合总和
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:带你学透回溯算法-组合总和(对应「leetcode」力扣题目:39.组合总和)| 回溯法精讲!_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
private:
vector<int> path;
vector<vector<int>> result;
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++){
path.push_back(candidates[i]);
sum += candidates[i];
backTracking(candidates, target, sum, i);
path.pop_back();
sum -= candidates[i];
}
};
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
result.clear();
path.clear();
backTracking(candidates, target, 0, 0);
return result;
}
};
40.组合总和II
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:回溯算法中的去重,树层去重树枝去重,你弄清楚了没?| LeetCode:40.组合总和II_哔哩哔哩_bilibili
状态:未通过
代码实现:
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){
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);
path.pop_back();
sum -= candidates[i];
used[i] = false;
}
}
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<bool> used(candidates.size(), false);
result.clear();
path.clear();
sort(candidates.begin(), candidates.end());
backTracking(candidates, target, 0, 0, used);
return result;
}
};
131.分割回文串
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:带你学透回溯算法-分割回文串(对应力扣题目:131.分割回文串)| 回溯法精讲!_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
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 sub = s.substr(startIndex, i - startIndex + 1);
path.push_back(sub);
}
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 <= end && j >= start; i++, j--){
if(s[i] != s[j]){
return false;
}
}
return true;
};
public:
vector<vector<string>> partition(string s) {
result.clear();
path.clear();
backtracking(s, 0);
return result;
}
};