Class Solution
java.lang.Object
g1301_1400.s1328_break_a_palindrome.Solution
1328 - Break a Palindrome.<p>Medium</p>
<p>Given a palindromic string of lowercase English letters <code>palindrome</code>, replace <strong>exactly one</strong> character with any lowercase English letter so that the resulting string is <strong>not</strong> a palindrome and that it is the <strong>lexicographically smallest</strong> one possible.</p>
<p>Return <em>the resulting string. If there is no way to replace a character to make it not a palindrome, return an <strong>empty string</strong>.</em></p>
<p>A string <code>a</code> is lexicographically smaller 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 smaller than the corresponding character in <code>b</code>. For example, <code>"abcc"</code> is lexicographically smaller than <code>"abcd"</code> because the first position they differ is at the fourth character, and <code>'c'</code> is smaller than <code>'d'</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> palindrome = “abccba”</p>
<p><strong>Output:</strong> “aaccba”</p>
<p><strong>Explanation:</strong> There are many ways to make “abccba” not a palindrome, such as “zbccba”, “aaccba”, and “abacba”. Of all the ways, “aaccba” is the lexicographically smallest.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> palindrome = “a”</p>
<p><strong>Output:</strong> ""</p>
<p><strong>Explanation:</strong> There is no way to replace a single character to make “a” not a palindrome, so return an empty string.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= palindrome.length <= 1000</code></li>
<li><code>palindrome</code> consists of only lowercase English letters.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
breakPalindrome
-