mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-27 02:30:28 +08:00
36 lines
859 B
HTML
36 lines
859 B
HTML
|
<p>给你一个字符串 <code>s</code>，<strong>最多</strong> 可以从中删除一个字符。</p>
|
|||
|
|
|
|||
|
|
<p>请你判断 <code>s</code> 是否能成为回文字符串：如果能，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "aba"
|
|||
|
|
<strong>输出：</strong>true
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "abca"
|
|||
|
|
<strong>输出：</strong>true
|
|||
|
|
<strong>解释：</strong>你可以删除字符 'c' 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "abc"
|
|||
|
|
<strong>输出：</strong>false</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
|||
|
|
<li><code>s</code> 由小写英文字母组成</li>
|
|||
|
|
</ul>
|