代码拉取完成，页面将自动刷新
同步操作将从 doocs/leetcode 强制同步，此操作会覆盖自 Fork 仓库以来所做的任何修改，且无法恢复！！！
确定后同步将在后台操作，完成时将刷新页面，请耐心等待。
Given a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string is not a palindrome and that it is the lexicographically smallest one possible.
Return the resulting string. If there is no way to replace a character to make it not a palindrome, return an empty string.
A string a is lexicographically smaller than a string b (of the same length) if in the first position where a and b differ, a has a character strictly smaller than the corresponding character in b. For example, "abcc" is lexicographically smaller than "abcd" because the first position they differ is at the fourth character, and 'c' is smaller than 'd'.
Example 1:
Input: palindrome = "abccba" Output: "aaccba" Explanation: 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.
Example 2:
Input: palindrome = "a" Output: "" Explanation: There is no way to replace a single character to make "a" not a palindrome, so return an empty string.
Constraints:
1 <= palindrome.length <= 1000palindrome consists of only lowercase English letters.class Solution:
def breakPalindrome(self, palindrome: str) -> str:
n = len(palindrome)
if n == 1:
return ""
s = list(palindrome)
i = 0
while i < n // 2 and s[i] == "a":
i += 1
if i == n // 2:
s[-1] = "b"
else:
s[i] = "a"
return "".join(s)
class Solution {
public String breakPalindrome(String palindrome) {
int n = palindrome.length();
if (n == 1) {
return "";
}
char[] cs = palindrome.toCharArray();
int i = 0;
while (i < n / 2 && cs[i] == 'a') {
++i;
}
if (i == n / 2) {
cs[n - 1] = 'b';
} else {
cs[i] = 'a';
}
return String.valueOf(cs);
}
}
class Solution {
public:
string breakPalindrome(string palindrome) {
int n = palindrome.size();
if (n == 1) {
return "";
}
int i = 0;
while (i < n / 2 && palindrome[i] == 'a') {
++i;
}
if (i == n / 2) {
palindrome[n - 1] = 'b';
} else {
palindrome[i] = 'a';
}
return palindrome;
}
};
func breakPalindrome(palindrome string) string {
n := len(palindrome)
if n == 1 {
return ""
}
i := 0
s := []byte(palindrome)
for i < n/2 && s[i] == 'a' {
i++
}
if i == n/2 {
s[n-1] = 'b'
} else {
s[i] = 'a'
}
return string(s)
}
function breakPalindrome(palindrome: string): string {
const n = palindrome.length;
if (n === 1) {
return '';
}
const s = palindrome.split('');
let i = 0;
while (i < n >> 1 && s[i] === 'a') {
i++;
}
if (i == n >> 1) {
s[n - 1] = 'b';
} else {
s[i] = 'a';
}
return s.join('');
}
此处可能存在不合适展示的内容，页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容，可点击提交进行申诉，我们将尽快为您处理。
