<p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "aab"
<strong>Output:</strong> [["a","a","b"],["aa","b"]]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "a"
<strong>Output:</strong> [["a"]]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 16</code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
</ul>

class Solution {
public:
    vector<vector<string>>ans;
    int n;
    bool check(int i,int j,string &s){
       while(i<=j){
          if(s[i]!=s[j]){
            return false;
          }
          i++;
          j--;
       }
       return true;
    }
    void func(int index,int last,vector<string>temp,string &s){
        if(index!=n-1){
          func(index+1,last,temp,s);
        }
        if(check(last+1,index,s)){
            temp.push_back(s.substr(last+1,index-(last+1)+1));
            if(index==n-1){
                ans.push_back(temp);
                return;
            }
            func(index+1,index,temp,s);
        }
        if(index==n-1)return;
    }
    vector<vector<string>> partition(string s) {
      n=s.size();
      vector<string>temp;
      func(0,-1,temp,s);
      return ans;
    }
};
260399