遍历字符串,对于对称位置不对的情况,由于需要字典序要小,所以就把字典序大的替换成小的
class Solution:
def makeSmallestPalindrome(self, s: str) -> str:
s = list(s)
for i in range(len(s) // 2):
if s[i] > s[-1 - i]:
s[i] = s[-1 - i]
elif s[i] < s[-1 - i]:
s[-1 - i] = s[i]
return ''.join(s)