coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-11 18:31:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
leetcode-cn/problem (Chinese)/最长回文串 [longest-palindrome].html
View File

@@ -1,10 +1,10 @@
<p>给定一个包含大写字母和小写字母的字符串<meta charset="UTF-8" />&nbsp;<code>s</code>&nbsp;，返回&nbsp;<em>通过这些字母构造成的 <strong>最长的回文串</strong></em>&nbsp;。</p>
<p>给定一个包含大写字母和小写字母的字符串<meta charset="UTF-8" />&nbsp;<code>s</code>&nbsp;，返回&nbsp;<em>通过这些字母构造成的 <strong>最长的 <span data-keyword="palindrome-string">回文串</span></strong></em>&nbsp;的长度。</p>
<p>在构造过程中，请注意 <strong>区分大小写</strong> 。比如&nbsp;<code>"Aa"</code>&nbsp;不能当做一个回文字符串。</p>
<p>&nbsp;</p>
<p><strong>示例 1: </strong></p>
<p><strong class="example">示例 1: </strong></p>
<pre>
<strong>输入:</strong>s = "abccccdd"
@@ -13,19 +13,14 @@
我们可以构造的最长的回文串是"dccaccd", 它的长度是 7。
</pre>
<p><strong>示例 2:</strong></p>
<p><strong class="example">示例 2:</strong></p>
<pre>
<strong>输入:</strong>s = "a"
<strong>输出:</strong>1
<strong>解释：</strong>可以构造的最长回文串是"a"，它的长度是 1。
</pre>
<p><strong>示例 3：</strong></p>
<pre>
<strong>输入:</strong>s = "aaaaaccc"
<strong>输出:</strong>7</pre>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>