mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
20 lines
677 B
HTML
20 lines
677 B
HTML
<p>You are given a string <code>s</code>. You can convert <code>s</code> to a palindrome by adding characters in front of it.</p>
|
|
|
|
<p>Return <em>the shortest palindrome you can find by performing this transformation</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> s = "aacecaaa"
|
|
<strong>Output:</strong> "aaacecaaa"
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> s = "abcd"
|
|
<strong>Output:</strong> "dcbabcd"
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>0 <= s.length <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>s</code> consists of lowercase English letters only.</li>
|
|
</ul>
|