package Test1;
public class Huiwenzichuan {
public static void main(String[] args) {
getLongestPalindrome("aaaa");
}
public static int getLongestPalindrome(String s) {
int[] count = new int[128];
int length = s.length();
for (int i = 0; i < length; ++i) {
char c = s.charAt(i);
count[c] = count[c] + 1;
}
int ans = 0;
for (int v : count) {
ans += v / 2 * 2;
if (v % 2 == 1 && ans % 2 == 0) {
ans++;
}
}
return ans;
}
}
算法:最长回文串
最新推荐文章于 2024-09-12 19:02:20 发布