mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
41 lines
1.1 KiB
HTML
41 lines
1.1 KiB
HTML
|
<p>给你一个字符串 <code>s</code> ，每一次操作你都可以在字符串的任意位置插入任意字符。</p>
|
|||
|
|
|
|||
|
|
<p>请你返回让 <code>s</code> 成为回文串的 <strong>最少操作次数</strong> 。</p>
|
|||
|
|
|
|||
|
|
<p>「回文串」是正读和反读都相同的字符串。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "zzazz"
|
|||
|
|
<strong>输出：</strong>0
|
|||
|
|
<strong>解释：</strong>字符串 "zzazz" 已经是回文串了，所以不需要做任何插入操作。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "mbadm"
|
|||
|
|
<strong>输出：</strong>2
|
|||
|
|
<strong>解释：</strong>字符串可变为 "mbdadbm" 或者 "mdbabdm" 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "leetcode"
|
|||
|
|
<strong>输出：</strong>5
|
|||
|
|
<strong>解释：</strong>插入 5 个字符后字符串变为 "leetcodocteel" 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 500</code></li>
|
|||
|
|
<li><code>s</code> 中所有字符都是小写字母。</li>
|
|||
|
|
</ul>
|