Palindrome Partitioning

题目

"aab"

[
["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
int len = s.length();
vector<vector<string> > result;
if(len<1) return result;
vector<string> vec;
mypart(result, vec, 0, s);
return result;
}
void mypart(vector<vector<string>> &result, vector<string> &vec, int cur, string &S) {
if(cur==S.length()) {
result.push_back(vec);
return ;
}
for(int i=cur;i<S.length();i++) {
int len = i-cur+1;
string str = S.substr(cur,len);
if(ispalind(str)) {
vec.push_back(str);
mypart(result, vec, i+1, S);
vec.pop_back();
}
}
}

bool ispalind(string &S) {
if(S.empty())
return true;
int i=0, j=S.length()-1;
while(i<j) {
if(S[i]!=S[j])
return false;
i++;
j--;
}
return true;
}

};