再上两天班休陪产假!!加油,要使劲努力啦
39. 组合总和
递归稍微卡了一下,不过剪枝可以理解。
class Solution {
public:
vector<vector<int>> result;
vector<int>path;
void backtracking(int target, vector<int>& candidates,int sum,int index){
if(sum > target){
return;
}
if(sum == target){
result.push_back(path);
return;
}
for(int i = index;i < candidates.size();i++){
sum += candidates[i];
if(sum > target)continue;
path.push_back(candidates[i]);
backtracking(target,candidates,sum,i);
sum -= candidates[i];
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target){
result.clear();
path.clear();
sort(candidates.begin(),candidates.end());
backtracking(target,candidates,0,0);
return result;
}
};
40.组合总和II
首先used[]的写法要学会,其次是used[i - 1]的用法也很巧妙,要理解。
class Solution {
private:
vector<vector<int>> result;
vector<int>path;
void back(vector<int>& candidates, int target,int index,int sum,vector<bool>& used){
if(sum > target)return;
if(sum == target){
result.push_back(path);
return;
}
for(int i = index;i < candidates.size() && sum + candidates[i] <= target;i++){
//used[i - 1] = 1,说明在树枝上,在下一层
//used[i - 1] = 0,说明已经把这个树枝完成了,那么candidates[i] == candidates[i-1]再相等其实就是同一树层
if(i > 0 && candidates[i] == candidates[i-1] && used[i - 1] == false){
continue;
}
used[i] = 1;
sum += candidates[i];
path.push_back(candidates[i]);
back(candidates,target,i + 1,sum,used);
path.pop_back();
sum -= candidates[i];
used[i] = 0;
}
}
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
result.clear();
path.clear();
vector<bool>used(candidates.size(),false);
used.resize(candidates.size());
sort(candidates.begin(),candidates.end());
back(candidates,target,0,0,used);
return result;
}
};
131.分割回文串
调试用:打印vector<vector<string>>的方法
vector<vector<string>>数组输出_vector<string>输出-CSDN博客
substr的用法卡了很久
C++中的substr()函数详解_c++ substr-CSDN博客
class Solution {
public:
vector<vector<string>>result;
vector<string>path;
void back(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);//substr的用法是(pos,pos+len)
path.push_back(str);
}
else continue;
back(s,i+1);
path.pop_back();
}
}
bool isPalindrome(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) {
result.clear();
path.clear();
back(s,0);
return result;
}
};
动态规划的想法先收一收,不过感觉和A星那个表格有点像了,把难点记一下,这东西第一次真写不出来啊。
随想录列出如下几个难点:
- 切割问题可以抽象为组合问题
- 如何模拟那些切割线
- 切割问题中递归如何终止
- 在递归循环中如何截取子串
- 如何判断回文
歇了歇了。。。