该博客讨论了如何在给定包含小写和大写字母的字符串中找到可以构建的最长回文串的长度。题目要求区分大小写，例如'Aa'不算回文。一种解决方案是使用HashSet记录出现的字符，遇到重复字符时更新长度。如果字符出现偶数次，最后HashSet应为空；若出现奇数次，会在HashSet中保留一个，且每出现两次已计入长度。
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.
public class Solution {
public int longestPalindrome(String s) {
订阅专栏 解锁全文
扫一扫
226
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
