力扣 39.组合总和
题目链接:39. 组合总和 - 力扣(LeetCode)
思路:可以出现重复元素,单层递归startindex传入当前i即可。
C++代码:
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& candidates,int targetSum,int sum,int startindex){
if(sum>targetSum) return;
if(sum==targetSum){
result.push_back(path);
return;
}
for(int i=startindex;i<candidates.size() && sum+candidates[i]<=targetSum;i++){
sum+=candidates[i];
path.push_back(candidates[i]);
backtracking(candidates,targetSum,sum,i);
sum-=candidates[i];
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
path.clear();
result.clear();
sort(candidates.begin(),candidates.end());
backtracking(candidates,target,0,0);
return result;
}
};
力扣 40.组合总和2
题目链接:40. 组合总和 II - 力扣(LeetCode)
思路:条件used【i-1】==0,即前一个元素是未使用过的才进行去重
C++代码:
lass Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& candidates,int targetSum,int sum,int startindex,vector<bool>& used){
if(targetSum==sum){
result.push_back(path);
return;
}
for(int i=startindex;i<candidates.size() && sum+candidates[i]<=targetSum;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;
backtracking(candidates,targetSum,sum,i+1,used);
sum-=candidates[i];
path.pop_back();
used[i]=false;
}
}
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.分割回文串
题目链接:131. 分割回文串 - 力扣(LeetCode)
思路:
在for (int i = startIndex; i < s.size(); i++)
循环中,我们 定义了起始位置startIndex,那么 [startIndex, i] 就是要截取的子串。
首先判断这个子串是不是回文,如果是回文,就加入在vector<string> path
中,path用来记录切割过的回文子串。
C++代码:
class Solution {
public:
vector<string> path;
vector<vector<string>> result;
bool ishui(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;
}
void backtracking(const string& s,int startindex){
if(startindex>=s.size()){
result.push_back(path);
return;
}
for(int i=startindex;i<s.size();i++){
if(ishui(s,startindex,i)){
string str=s.substr(startindex,i-startindex+1);
path.push_back(str);
}
else continue;
backtracking(s,i+1);
path.pop_back();
}
}
vector<vector<string>> partition(string s) {
backtracking(s,0);
return result;
}
};