刷题记录第九十天-分割回文串

class Solution {
public:
    vector<string> path;
    vector<vector<string>> result;
    vector<vector<string>> partition(string s) {
        traverse(s,0);
        return result;
    }
    void traverse(string s, int start_index){
        if(start_index==s.size()){
            result.push_back(path);
            return;
        }
        for(int i=start_index;i< s.size();i++){
            string sub_string = s.substr(start_index,i-start_index+1);
            if(huiwen(sub_string)) path.push_back(sub_string);
            else continue;
            traverse(s,i+1);
            path.pop_back();
        }
    }
    bool huiwen(string str){
        int i=0,j=str.size()-1;
        while(i<j){
            if(str[i]!=str[j])
                return false;
            i++;
            j--;
        }
        return true;
    }
};