palindrome-partitioning

求个数一般用动态规划，求具体值用dfs

class Solution {
public:
    vector<vector<string>> partition(string s) {
        vector<vector<string>>res;
        vector<string>path;
        dfs(s,path,res);
        return res;
    }
    void dfs(string s,vector<string>&path,vector<vector<string>>&res)
    {
        if(s.size()==0)
        {
            res.push_back(path);
            return;
        }
        for(int i=0;i<s.size();i++)
        {
            int begin=0,end=i;
            while(s[begin]==s[end]&&begin<end)begin++,end--;
            if(begin>=end)
            {
                path.push_back(s.substr(0,i+1));
                dfs(s.substr(i+1),path,res);
                path.pop_back();
            }
        }
    }
};