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"] ]
Solution:
class Solution {
public:
vector<vector<string>> partition(string s) {
vector<string> v;
vector<vector<string> > res;
dfs(s, v, res);
return res;
}
void dfs(string s, vector<string> &v, vector<vector<string> > &res)
{
if(!s.length()) return ;
for(int i = 1; i <= s.length(); ++i)
{
if(isP(s.substr(0, i)))
{
v.push_back(s.substr(0, i));
if(i == s.length())
{
res.push_back(v);
v.pop_back();
return ;
}
else dfs(s.substr(i), v, res);
v.pop_back();
}
}
}
bool isP(string s)
{
int len = s.length();
if(!len) return true;
for(int i = 0; i < len / 2; ++i)
{
if(s[i] != s[len-1-i]) return false;
}
return true;
}
};