Lintcode 627
Description
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.
Assume the length of given string will not exceed 1010
Example
Example 1:
Input : s = "abccccdd"
Output : 7
Explanation :
One longest palindrome that can be built is "dccaccd", whose length is `7`.
Description
给出一个包含大小写字母的字符串。求出由这些字母构成的最长的回文串的长度是多少。
数据是大小写敏感的，也就是说，"Aa" 并不会被认为是一个回文串。
假设字符串的长度不会超过 1010
样例 1:
输入 : s = "abccccdd" 输出 : 7 说明 : 一种可以构建出来的最长回文串方案是 "dccaccd"。
解答
https://blog.csdn.net/btujack/article/details/83040256
