42 lines
963 B
Markdown
42 lines
963 B
Markdown
|
<p>给你一个字符串 <code>s</code>，找到 <code>s</code> 中最长的回文子串。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "babad"
|
|||
|
|
<strong>输出：</strong>"bab"
|
|||
|
|
<strong>解释：</strong>"aba" 同样是符合题意的答案。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "cbbd"
|
|||
|
|
<strong>输出：</strong>"bb"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "a"
|
|||
|
|
<strong>输出：</strong>"a"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 4：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>s = "ac"
|
|||
|
|
<strong>输出：</strong>"a"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= s.length <= 1000</code></li>
|
|||
|
|
<li><code>s</code> 仅由数字和英文字母（大写和/或小写）组成</li>
|
|||
|
|
</ul>
|
|||
|
|
<div><div>Related Topics</div><div><li>字符串</li><li>动态规划</li></div></div>\n<div><li>👍 3593</li><li>👎 0</li></div>
|