LeetCode[409] Longest Palindrome

来源:互联网 发布:阳岛线选股公式源码 编辑:程序博客网 时间:2024/04/30 15:51

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.

class Solution {public:int longestPalindrome(string s) {unordered_map<char, int> hash;for (auto it = s.begin(); it != s.end(); ++it) {hash[*it]++;}int oddCount = 0;int ans = 0;for (auto i : hash) {if (i.second & 1) {++oddCount;ans += i.second - 1;}elseans += i.second;}if (oddCount > 0)++ans;return ans;}};

0 0