分割回文串

给定一个字符串s，将s分割成一些子串，使每个子串都是回文串。

返回s所有可能的回文串分割方案。

您在真实的面试中是否遇到过这个题？

Yes

样例

给出 s = "aab"，返回

[
  ["aa", "b"],
  ["a", "a", "b"]
]

class Solution {
public:
    /*
     * @param s: A string
     * @return: A list of lists of string
     */
    vector<vector<string>> partition(string &s) {
        // write your code here
        vector<vector<string>> solutions;
        vector<string> paths;
        DoPartition(s, 0, solutions, paths);
        return solutions;
    }
    /*
     * @param s: A string
     * return: bool, is string is recursive string
     */
    bool IsTarget(string s) {
        for (int i = 0, j = s.size() - 1; i <= j; i++, j--) {
            if (s[i] != s[j]) {
                return false;
            }
        }
        return true;
    }
    /*
     * @param s: A string
     * @param start: int
     * @param solutions: vector<vector<string>>
     * @param paths: one solution
     */
    void DoPartition(string &s, int start, vector<vector<string>>& solutions, vector<string>& paths) {
        if (start == s.size()) {
            solutions.push_back(paths);
        }
        for (int i = start + 1; i <= s.size(); i++) {
            string sub_str = s.substr(start, i - start);
            if (IsTarget(sub_str)) {
                paths.push_back(sub_str);
                DoPartition(s, i, solutions, paths);
                paths.pop_back();
            }
        }
    }
};