mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
29 lines
729 B
HTML
29 lines
729 B
HTML
<p>给你一个字符串 <code>s</code>，请你将<em> </em><code>s</code><em> </em>分割成一些子串，使每个子串都是 <strong>回文串</strong> 。返回 <code>s</code> 所有可能的分割方案。</p>
|
||
|
||
<p><strong>回文串</strong> 是正着读和反着读都一样的字符串。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>s = "aab"
|
||
<strong>输出：</strong>[["a","a","b"],["aa","b"]]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>s = "a"
|
||
<strong>输出：</strong>[["a"]]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= s.length <= 16</code></li>
|
||
<li><code>s</code> 仅由小写英文字母组成</li>
|
||
</ul>
|