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) {
vector<vector<string> > res;
vector<string> tmp;
dfs(s, 0, tmp, res);
return res;
}
private:
void dfs(const string &s, int start, vector<string> &tmp, vector<vector<string> > &res) {
if (s.size() == start) {
res.push_back(tmp);
return ;
}
for (int i = start; i < s.size(); i++) {
if (isPalindrome(s,start,i)) {
tmp.push_back(s.substr(start, i - start + 1));
dfs(s, i+1, tmp, res);
tmp.pop_back();
}
}
}
bool isPalindrome(const string &s, int start, int end) {
while (start<end && s[start] == s[end]) {
start++;
end--;
}
return start>=end;
}
};