友情支持
如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜
|
|
有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。
公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。 |
409. Longest Palindrome
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
This is case sensitive, for example "Aa" is not considered a palindrome here.
Note:
Assume the length of given string will not exceed 1,010.
*Example: *
Input:
"abccccdd"
Output:
7
Explanation:
One longest palindrome that can be built is "dccaccd", whose length is 7.思路分析
-
一刷
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/**
* @author D瓜哥 · https://www.diguage.com
* @since 2024-09-18 17:32:17
*/
public int longestPalindrome(String s) {
Map<Character, Integer> charToCntMap = new HashMap<>();
for (char c : s.toCharArray()) {
Integer cnt = charToCntMap.getOrDefault(c, 0);
charToCntMap.put(c, cnt + 1);
}
int result = 0;
int odd = 0;
for (Integer value : charToCntMap.values()) {
result += (value / 2) * 2;
if (value % 2 == 1) {
odd = 1;
}
}
return result + odd;
}