<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>> partition(string s) {
        std::vector<std::vector<std::vector<std::string>>> table;
        table.resize(s.size() + 1);

        std::vector<std::string> last_component_vec;
        table.back().push_back(std::move(last_component_vec));

        for (int i = s.size() - 1; i >= 0; --i) {
            for (int len = 1; i + len <= s.size(); ++len) {
                bool is_palindrome = true;
                for (int k = 0; k < len; ++k)
                    is_palindrome &= s[i + k] == s[i + len - 1 - k];

                if (is_palindrome) {
                    const std::string subcomponent = s.substr(i, len);
                    std::cout << subcomponent << " ";
                    for (const std::vector<std::string>& postfix :
                         table[i + len]) {
                        std::vector<std::string> res;
                        res.reserve(1 + postfix.size());
                        res.push_back(subcomponent);
                        res.insert(res.end(), postfix.begin(), postfix.end());
                        table[i].push_back(std::move(res));
                    }
                }
            }
        }

        /*
        std::cout << std::endl;

        for (const auto& table_value : table) {
            std::cout << "S: ";
            for (const auto& sequence : table_value) {
                std::cout << "[";
                for (const std::string& component : sequence)
                    std::cout << component << ", ";
                std::cout << "], ";
            }
            std::cout << std::endl;
        }
        */

        return table.front();
    }
};
104273