409. Longest Palindrome

标签：out   tput   ret   回文   i++   lin   solution   字符   cas   

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.


从字符串中找出一些字母组成回文串，要求这个回文串最长

C++（9ms）：

 1 class Solution {
 2 public:
 3     int longestPalindrome(string s) {
 4         vector<int> Map(128,0) ;
 5         for(char c : s){
 6             Map[c - ‘A‘]++ ;
 7         }
 8         int res = 0 ;
 9         for(int i = 0 ; i < Map.size() ; i++){
10             res += Map[i]/2*2 ; 
11         }
12         return res == s.length()?res:res+1 ;
13     }
14 };

409. Longest Palindrome

标签：out   tput   ret   回文   i++   lin   solution   字符   cas   

原文地址：http://www.cnblogs.com/mengchunchen/p/7786813.html