mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
20 lines
738 B
HTML
20 lines
738 B
HTML
<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> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> s = "aab"
|
|
<strong>Output:</strong> [["a","a","b"],["aa","b"]]
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> s = "a"
|
|
<strong>Output:</strong> [["a"]]
|
|
</pre>
|
|
<p> </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>
|