Leetcode409: 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:
7

Explanation:
One longest palindrome that can be built is "dccaccd", whose length is 7.

题意：

给出一个string，求问这个串里面的元素最多能组成多长的回文串。题目给的串包含大小写的字母。

思路：

统计一下题目给的串中每个字符出现的次数，可以在串的前后添加n/2（下取整）个字符。同时最多可以在串的正中间添加一个字符，取决于原先串中是否含有奇数次的元素。

复杂度：

时间：O(n)；  空间：O(1)。

代码：

class Solution {
public:
    int a1[26]={0};
    int a2[26]={0};
    int longestPalindrome(string s) {
        int len=s.size();
        for(int i=0; i<len; i++){
            if(s[i]>='a' && s[i]<='z'){
                a1[s[i]-'a']++;
            }
            else{
                a2[s[i]-'A']++;
            }
        }
        int count=0;
        int num1=0;
        for(int i=0; i<26; i++){
            count+=(2*(a1[i]/2+a2[i]/2));
            if(a1[i]%2!=0 || a2[i]%2!=0)
            num1=1;
        }
        count+=num1;
        return count;
    }
};