Palindrome Partitioning
Feb 28
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"] ]
class Solution {
public:
vector<vector<string>> partition(string s) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
//check input
vector<vector<string> > res;
int sz = s.length();
if(sz<1)return res;
vector<bool> temp(sz, false);
vector<vector<bool>> d(sz, temp);
for(int i=0; i<sz; i++) {
d[i][i] = true;
}
for(int i=0; i<sz-1; i++) {
if(s[i]==s[i+1]) {
d[i][i+1] = true;
}
}
for(int len=3; len<=sz; len++) {
for(int i=0; i<=sz-len; i++) {
int j=i+len-1;
if(s[i]==s[j] && d[i+1][j-1]) {
d[i][j] = true;
}
}
}
vector<string> cur;
parRec(d, res, cur,s, 0);
return res;
}
private:
void parRec(vector<vector<bool>> & d, vector<vector<string>>& res, vector<string>& cur, string & s, int level){
if(level==s.length()) {
res.push_back(cur);
return;
}
for(int i=level; i<s.length(); i++) {
if(d[level][i]) {
cur.push_back( s.substr(level, i-level+1) );
parRec(d, res, cur, s, i+1);
cur.pop_back();
}
}
}
};