Leetcode #131 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"]
  ]

Difficulty:Medium

class Solution {
public:
    vector<vector<string> > ans;
    
    bool isPalindrome(string s) {
     int len = s.length();
     string s2;
     if(len==0||len==1)
        return true;
     for(int i = len-1;i>=0;i--)
        s2.push_back(s[i]);
     if(s2==s)
        return true;
     return false;
    }
    
    void gen(int start,int end,string s, vector<string>& nums){
        int len = s.length();
        if(start>end){
            ans.push_back(nums);
            return;
        }
        else if(start==end){
            nums.push_back(s.substr(start,1));
            ans.push_back(nums);
            return;
        }
        
        for(int i = start;i<len;i++)
        {
            string s1 = s.substr(start,i-start+1);
            if(isPalindrome(s1))
            {
                vector<string> nums1 = nums;
                nums1.push_back(s1);
                gen(i+1,len-1,s,nums1);
            }
        }
        return;
        
    }
    
    vector<vector<string>> partition(string s) {
        int len = s.length();
        if(len==0)
           return ans;
        for(int i = 0;i<len;i++){
            string s1 = s.substr(0,i+1);
            if(isPalindrome(s1))
            {
                vector<string> nums;
                nums.push_back(s1);
                gen(i+1,len-1,s,nums);
            }
        }
        
        return ans;
    }
};