39. 组合总和
class Solution {
vector<vector<int>> res;
vector<int> path;
void traversal(vector<int>& candidates, int target, int sum, int start)
{
if(sum>target) return;
else if( sum == target ){
res.push_back(path);
return;
}
for(int i=start; i<candidates.size()&& candidates[i]<=target;i++)
{
path.push_back(candidates[i]);
traversal(candidates, target, sum+candidates[i], i);
path.pop_back();
}
return;
}
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end());
res.clear();
path.clear();
if(candidates[0]>target) return res;
traversal(candidates, target, 0, 0);
return res;
}
};
40. 组合总和II
class Solution {
vector<vector<int>> result;
vector<int> path;
void traversal( vector<int>& candidates, int target, int sum, int start)
{
if(sum > target) return;
else if(sum==target){
result.push_back(path);
return;
}
for(int i=start; i<candidates.size()&& candidates[i]<=target; i++)
{
if(i>start && candidates[i]==candidates[i-1]) continue;
path.push_back(candidates[i]);
traversal(candidates, target, sum+candidates[i], i+1);
path.pop_back();
}
return;
}
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end());
result.clear();
path.clear();
if(candidates[0]>target) return result;
traversal(candidates, target, 0, 0);
return result;
}
};
131.分割回文串
```cpp
class Solution {
vector<vector<string>> res;
vector<string> path;
void traversal(string & s, int start)
{
if(start>=s.size()){
res.push_back(path);
return;
}
for(int i=start; i<s.size();i++)
{
if(isPalindrome(s, start, i))
{
path.push_back(s.substr(start, i-start+1));
traversal(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;
}
public:
vector<vector<string>> partition(string s) {
res.clear();
path.clear();
traversal(s, 0);
return res;
}
};