mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
45 lines
1.1 KiB
HTML
45 lines
1.1 KiB
HTML
|
<p>给定一个字符串 <code>s</code>，请将 <code>s</code> 分割成一些子串，使每个子串都是回文串。</p>
|
|||
|
|
|
|||
|
|
<p>返回符合要求的 <strong>最少分割次数</strong> 。</p>
|
|||
|
|
|
|||
|
|
<div class="original__bRMd">
|
|||
|
|
<div>
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "aab"
|
|||
|
|
<strong>输出：</strong>1
|
|||
|
|
<strong>解释：</strong>只需一次分割就可将 s<em> </em>分割成 ["aa","b"] 这样两个回文子串。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "a"
|
|||
|
|
<strong>输出：</strong>0
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "ab"
|
|||
|
|
<strong>输出：</strong>1
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 2000</code></li>
|
|||
|
|
<li><code>s</code> 仅由小写英文字母组成</li>
|
|||
|
|
</ul>
|
|||
|
|
</div>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><meta charset="UTF-8" />注意：本题与主站 132 题相同： <a href="https://leetcode-cn.com/problems/palindrome-partitioning-ii/">https://leetcode-cn.com/problems/palindrome-partitioning-ii/</a></p>
|