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"]
]
思路:先用dict[i][j]保存string的下标从i到j是否是回文。可用DFS方法求解。
class Solution {
public:
void partitionHelper(int start, int pos, vector<vector<bool> > &dict, vector<vector<string> >&res, vector<string>&p......
阅读全文