题目:
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"]
]
解题:
先用dp记录回文串,dp[i][j]表示s串从i到j为回文,状态转移:如果s[i] == s[j],并且i == j || j == i + 1 || dp[i + 1][j - 1] == 1则标记dp[i][j]为1,表示是回文
然后暴力dfs。
代码如下:
class Solution {
public:
vector<vector<string> > p......
阅读全文