题目:
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"] ]
思路:
从0开始dfs。然后回溯到i,从i开始再dfs。每一个深度优先遍历既是一个结果。
需要注意的是push->dfs(i+1)->pop ,这个pop是非常重要的。需要好好理解。
代码:16ms AC
class Solution {
public:
vector<vector<string>> partition(string s) {
vector<string> path;
vector<vector<string>> res;
//int n = s.size();
dfs(0, s, path, res);
return res;
}
void dfs(int index, string &s, vector<string> &path, vector<vector<string>> &res )
{
if(index == s.size())
{
res.push_back(path);
return;
}
else
{
for(int i = index; i < s.size(); i++)
if(isPalindrome(s, index, i))
{
path.push_back(s.substr(index, i - index +1));
dfs(i + 1, s, path, res);
path.pop_back();
}
}
}
bool isPalindrome(string s, int start, int end)
{
//end >= start
while(end >= start)
{
if(s[end--] != s[start++])
return false;
//end--;start++;
}
return true;
}
};