Leetcode--Palindrome Partitioning

Given a string s, partition s such that every substring of the partition is a palindrome.

Return all possible palindrome partitioning of s.

For example, given s = "aab",
Return

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

Have you been asked this question in an interview?

思路：
一个布尔型的二维数组arr[i][j]记录s的i至j位是否是回文

如果存在一条从0到s.size()-1的true路径，则就是要求的结果，将它插入到集合中

class Solution {
public:
    vector<vector<string>> res;
    bool isvalid(string s)
    {
        if(s.size()<=1)
            return true;
        int l=0;
        int r=s.size()-1;
        while(l<r)
        {
            if(s[l]!=s[r])
                return false;
            else
            {
                l++;
                r--;
            }
        }
        
        return true;
    }
    void traceback(string s,bool **arr,vector<string> ve,int i)
    {
        if(i>=s.size())
            res.push_back(ve);
        else{
            for(int j=i;j<s.size();j++)
            {
                if(arr[i][j])
                {
                    string stmp=s.substr(i,j-i+1);
                    vector<string> vtmp(ve);
                    vtmp.push_back(stmp);
                    traceback(s,arr,vtmp,j+1);
                }
            }
        }
    }
    vector<vector<string>> partition(string s) {
        if(s.size()<=0)
            return res;
        bool **arr=new bool*[s.size()];
        for(int i=0;i<s.size();i++){
            arr[i]=new bool[s.size()];
            for(int j=0;j<s.size();j++)
                arr[i][j]=false;
        }
        //memset(arr,false,sizeof(bool)*(s.size()+1));
        for(int i=0;i<s.size();i++)
            for(int j=0;j<s.size();j++)
            {
                arr[i][j]=isvalid(s.substr(i,j-i+1));
            }
        vector<string> ve;
        traceback(s,arr,ve,0);
        return res;
    }
};