Parlindrome-Partitioning

class Solution 
{
public:
    vector<vector<string>> partition(string s) 
    {
        vector<vector<string>> res;
        vector<string> cur;
        dfs(s,res,cur);
        return res;
    }
    bool isPalindrome(string s)
    {
        return s==string(s.rbegin(),s.rend());//反向迭代
    }
    void dfs(string s,vector<vector<string>>& res,vector<string>& cur)
    {
        if(s=="")
        {
            res.push_back(cur);
            return;
        }
        for(int i=1;i<=s.length();i++)
        {
            string sub=s.substr(0,i);
            if(isPalindrome(sub))
            {
                cur.push_back(sub);
                dfs(s.substr(i,s.length()-i),res,cur);
                cur.pop_back();
            }
        }
    }
};