<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 {
    vector<vector<string>> ans;
    bool Pali(string s, int i, int j){
        while(i<j){
            if(s[i]!=s[j])  return false;
            i++;
            j--;
        }
        return true;
    }
    void keepPartitioning(string s, int i, vector<string> cur){
        for(i; i<s.size(); i++){
            for(int j=i+1; j<s.size(); j++){
                if(Pali(s, i, j)){
                    cur.push_back(s.substr(i, j-i+1));
                    keepPartitioning(s, j+1, cur);
                    cur.pop_back();
                }
            }
            cur.push_back(string(1, s[i]));
        }
        ans.push_back(cur);
    }
public:
    vector<vector<string>> partition(string s) {
        vector<string> cur;
        keepPartitioning(s, 0, cur);
        return ans;
    }
};
126576