<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 {
    bool ispalindrome(string& s){
        
        int i = 0 , j = s.length()-1;
        while(i<j){
            if(s[i]!=s[j]){
                return false;
            }
            i++;
            j--;
        }
        return true;
    }
    void sol(vector<string> str,vector<vector<string>> & ans){
        if(str[str.size()-1].length()<1){
            return;
        }

        bool flag = true;

        for(auto s : str){
            if(!ispalindrome(s)){
                flag = false;
                break;
            }
        }
        
        if(flag == true){
            ans.push_back(str);
        }

        string last_string = str[str.size()-1];
        str.pop_back();
        for(int m = 1; m < last_string.length(); m++){
            vector<string> temp(str);
            temp.push_back(last_string.substr(0,m));
            temp.push_back(last_string.substr(m,last_string.length()-m));
            sol(temp,ans);
        }
    }
public:
    vector<vector<string>> partition(string s) {
        vector<vector<string>> ans;
        vector<string> str;
        str.push_back(s);
        sol(str,ans);

        return ans;
    }
};
132949