mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
37
leetcode/problem/valid-palindrome.html
Normal file
37
leetcode/problem/valid-palindrome.html
Normal file
@@ -0,0 +1,37 @@
|
||||
<p>A phrase is a <strong>palindrome</strong> if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.</p>
|
||||
|
||||
<p>Given a string <code>s</code>, return <code>true</code><em> if it is a <strong>palindrome</strong>, or </em><code>false</code><em> otherwise</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "A man, a plan, a canal: Panama"
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> "amanaplanacanalpanama" is a palindrome.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "race a car"
|
||||
<strong>Output:</strong> false
|
||||
<strong>Explanation:</strong> "raceacar" is not a palindrome.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = " "
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> s is an empty string "" after removing non-alphanumeric characters.
|
||||
Since an empty string reads the same forward and backward, it is a palindrome.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= s.length <= 2 * 10<sup>5</sup></code></li>
|
||||
<li><code>s</code> consists only of printable ASCII characters.</li>
|
||||
</ul>
|
Reference in New Issue
Block a user