132. Palindrome Partitioning II

class Solution {private:    vector<vector<string>> result;    vector<string> curlist;    bool judge(string &s,int start,int end)    {        if(end==start) return true;        while(end>start)        {            if(s[end]!=s[start]) return false;            end--;            start++;        }        return true;    }    void dfs(string &s,int start)    {        if(curlist.size()>0&&start>=s.size())        {            vector<string> r(curlist);            result.push_back(r);        }        for(int i=start;i<s.size();i++)        {            if(judge(s,start,i))            {                curlist.push_back(s.substr(start,i-start+1));                dfs(s,i+1);                curlist.pop_back();            }        }    }public:    vector<vector<string>> partition(string s) {        dfs(s,0);        return result;    }};