<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>

/*
 * @lc app=leetcode id=131 lang=cpp
 *
 * [131] Palindrome Partitioning
 */

// @lc code=start
class Solution
{
public:
    vector<vector<string>> ans;
    bool check(string &xd)
    {
        int start = 0, end = xd.size() - 1;
        while (start <= end)
        {
            if (xd[start] != xd[end])
                return false;
            start++, end--;
        }
        return true;
    }
    void generate(int j, vector<string> v, string &s)
    {
        if (j >= s.size())
        {
            ans.push_back(v);
            return;
        }
        string temp = "";
        for (int i = j; i < s.size(); i++)
        {
            temp += s[i];
            if (check(temp))
            {
                vector<string> t = v;
                t.push_back(temp);
                generate(i + 1, t, s);
            }
        }
    }
    vector<vector<string>> partition(string s)
    {
        generate(0, {}, s);
        return ans;
    }
};
// @lc code=end

241281