Given a string s, partition s such that every substring of the partition is a palindrome.
Return all possible palindrome partitioning of s.
For example, given s = "aab"
,
Return
[ ["aa","b"], ["a","a","b"] ]
思路:
法一。从第0个字符为起点即start=0,end=0,都做两种 处理:1,不论是不是回文都直接跳过,不裁断,end加1
2,如果是回文,则暂时截取【start,end】存入path,并将以end+1为start,end+1为end 再继续
法二。以某个字符为前点,循环判断后面的每个位置是否可以裁断
class Solution {
public:
bool isPalindrome(string s){
int i=0;
int j=s.size()-1;
while(i<j){
if(s[i++]!=s[j--])
return false;
}
return true;
}
//[start,end]闭合区间,
void dfs(vector<vector<string> >&result,
string &s,
int start,
int end,
vector<string> &path){
if(end==s.size()-1){//[start,end]闭合区间,所以s.size()-1
if( isPalindrome(s.substr(start,end-start+1)) ){
path.push_back(s.substr(start,end-start+1));
result.push_back(path);
path.pop_back();
}
}
else{
//1.跳过,不在end处不裁剪
dfs(result,s,start,end+1,path);
//2.不跳过,在end处裁剪
string tmp=s.substr(start,end-start+1);
if(isPalindrome(tmp)){
path.push_back(tmp);
dfs(result,s,end+1,end+1,path);
path.pop_back();
}
}
}
vector<vector<string>> partition(string s) {
vector<vector<string>> ret;
if(s.size()==0)
return ret;
vector<string> path;
dfs(ret,s,0,0,path);
return ret;
}
};
class Solution {
public:
bool isPalindrome(string s){
int i=0;
int j=s.size()-1;
while(i<j){
if(s[i++]!=s[j--])
return false;
}
return true;
}
//start 为截取的起点
void dfs(vector<vector<string> >&result,
string &s,
int start,
vector<string> &path)
{
if(start==s.size())
{
result.push_back(path);
}
//在start后面的每个可能的位置都截取一下
for(int i=start;i<s.size();i++){
string tmp=s.substr(start,i-start+1);
if( isPalindrome( tmp ) )
{
path.push_back(tmp);
dfs(result,s,i+1,path);
path.pop_back();
}
}
}
vector<vector<string>> partition(string s) {
vector<vector<string>> ret;
if(s.size()==0)
return ret;
vector<string> path;
dfs(ret,s,0,path);
return ret;
}
};