Class Solution
java.lang.Object
g0101_0200.s0131_palindrome_partitioning.Solution
131 - Palindrome Partitioning.<p>Medium</p>
<p>Given a string <code>s</code>, partition <code>s</code> such that every substring of the partition is a <strong>palindrome</strong>. Return all possible palindrome partitioning of <code>s</code>.</p>
<p>A <strong>palindrome</strong> string is a string that reads the same backward as forward.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “aab”</p>
<p><strong>Output:</strong> [[“a”,“a”,“b”],[“aa”,“b”]]</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “a”</p>
<p><strong>Output:</strong> <a href=""a"">"a"</a></p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length <= 16</code></li>
<li><code>s</code> contains only lowercase English letters.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
partition
-