mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
44 lines
2.1 KiB
HTML
44 lines
2.1 KiB
HTML
|
<p>A string is <strong>beautiful</strong> if:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>It consists of the first <code>k</code> letters of the English lowercase alphabet.</li>
|
||
|
|
<li>It does not contain any substring of length <code>2</code> or more which is a palindrome.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>You are given a beautiful string <code>s</code> of length <code>n</code> and a positive integer <code>k</code>.</p>
|
||
|
|
|
||
|
|
<p>Return <em>the lexicographically smallest string of length </em><code>n</code><em>, which is larger than </em><code>s</code><em> and is <strong>beautiful</strong></em>. If there is no such string, return an empty string.</p>
|
||
|
|
|
||
|
|
<p>A string <code>a</code> is lexicographically larger than a string <code>b</code> (of the same length) if in the first position where <code>a</code> and <code>b</code> differ, <code>a</code> has a character strictly larger than the corresponding character in <code>b</code>.</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>For example, <code>"abcd"</code> is lexicographically larger than <code>"abcc"</code> because the first position they differ is at the fourth character, and <code>d</code> is greater than <code>c</code>.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "abcz", k = 26
|
||
|
|
<strong>Output:</strong> "abda"
|
||
|
|
<strong>Explanation:</strong> The string "abda" is beautiful and lexicographically larger than the string "abcz".
|
||
|
|
It can be proven that there is no string that is lexicographically larger than the string "abcz", beautiful, and lexicographically smaller than the string "abda".
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "dc", k = 4
|
||
|
|
<strong>Output:</strong> ""
|
||
|
|
<strong>Explanation:</strong> It can be proven that there is no string that is lexicographically larger than the string "dc" and is beautiful.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= n == s.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>4 <= k <= 26</code></li>
|
||
|
|
<li><code>s</code> is a beautiful string.</li>
|
||
|
|
</ul>
|