Kimi LeetCode 3518. 最小回文排列 II Python3实现
python
class Solution:MAX_K 1_000_001def smallestPalindrome(self, s: str, k: int) -> str:n len(s)half s[:n // 2]mid s[n // 2] if n % 2 1 else ""cnt [0] * 26for c in half:cnt[ord(c) - ord(a)] 1# 总排列数不足 kif self.count_arrangements(c…