mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-14 11:51:42 +08:00
add leetcode problem-cn part6
This commit is contained in:
37
算法题(国内版)/problem (Chinese)/最长回文串 [longest-palindrome].html
Normal file
37
算法题(国内版)/problem (Chinese)/最长回文串 [longest-palindrome].html
Normal file
@@ -0,0 +1,37 @@
|
||||
<p>给定一个包含大写字母和小写字母的字符串<meta charset="UTF-8" /> <code>s</code> ,返回 <em>通过这些字母构造成的 <strong>最长的回文串</strong></em> 。</p>
|
||||
|
||||
<p>在构造过程中,请注意 <strong>区分大小写</strong> 。比如 <code>"Aa"</code> 不能当做一个回文字符串。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1: </strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong>s = "abccccdd"
|
||||
<strong>输出:</strong>7
|
||||
<strong>解释:</strong>
|
||||
我们可以构造的最长的回文串是"dccaccd", 它的长度是 7。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong>s = "a"
|
||||
<strong>输入:</strong>1
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong>s = "bb"
|
||||
<strong>输入:</strong> 2
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= s.length <= 2000</code></li>
|
||||
<li><code>s</code> 只能由小写和/或大写英文字母组成</li>
|
||||
</ul>
|
Reference in New Issue
Block a user