首页 > 代码库 > 409. Longest Palindrome
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:7Explanation:One longest palindrome that can be built is "dccaccd", whose length is 7.
public class Solution { public int longestPalindrome(String s) { HashMap<Character, Integer> map = new HashMap<>(); int res = 0; int odd = 0; for(int i = 0; i < s.length(); i++){ map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0)+1); } for(int i : map.values()){ if(i > 0 && i % 2 == 0) res += i; else{ res += i - 1; //是奇数的话要可取偶数个值！！！！ odd = 1; } } return res + odd; }}
409. Longest Palindrome
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。