mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
33 lines
1.1 KiB
HTML
33 lines
1.1 KiB
HTML
<p>给定一个字符串 <code>s</code> ，验证 <code>s</code> 是否是 <strong>回文串 </strong>，只考虑字母和数字字符，可以忽略字母的大小写。</p>
|
||
|
||
<p>本题中，将空字符串定义为有效的 <strong>回文串 </strong>。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入: </strong>s =<strong> </strong>"A man, a plan, a canal: Panama"
|
||
<strong>输出:</strong> true
|
||
<strong>解释：</strong>"amanaplanacanalpanama" 是回文串</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong> s = "race a car"
|
||
<strong>输出:</strong> false
|
||
<strong>解释：</strong>"raceacar" 不是回文串</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= s.length <= 2 * 10<sup>5</sup></code></li>
|
||
<li>字符串 <code>s</code> 由 ASCII 字符组成</li>
|
||
</ul>
|
||
|
||
<p> </p>
|
||
|
||
<p><meta charset="UTF-8" />注意：本题与主站 125 题相同： <a href="https://leetcode-cn.com/problems/valid-palindrome/">https://leetcode-cn.com/problems/valid-palindrome/</a></p>
|