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:
void getAllCases(string s, vector<string> ¤t, vector<vector<string>> &results) {
if(s.empty()) {
results.push_back(current);
return;
}
for(int ii = 0; ii < s.length(); ii ++) {
int begin = 0;
int end = ii;
while(begin <= end) {
if(s[begin] == s[end]) {
begin ++;
end --;
}
else {
break;
}
}
if(begin > end) {
current.push_back(s.substr(0, ii + 1));
getAllCases(s.substr(ii + 1, s.length() - ii - 1), current, results);
current.pop_back();
}
}
}
vector<vector<string>> partition(string s) {
vector<vector<string>> results;
vector<string> current;
getAllCases(s, current, results);
return results;
}
};