leettcode--最长回文串

1 \ 题目描述

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

2、 解题思路

对于这种固定数组的，我们可以建立一个数组，用来存储每个字母对应的个数记录下来，然后循环数组，当出现第一个奇数个的时候，多出来的一个可以放在中间的位置，而剩下的多出来的就不能在算，也就是要取偶数个。

 

3、 代码（CPP）

class Solution {
public:
    int longestPalindrome(string s) {
            int strlen=s.length();
    int ans=0;
    bool flag=false;
    // doublt pointer??
    int nums[52]={0}; //分别对应了ａ-z A-Ｚ

    for(int i=0;i<s.length();i++){
        if (s[i]>='a' and s[i]<='z'){
                nums[s[i]-'a']+=1;
        }else if (s[i]>='A' and s[i]<='Z'){
                nums[s[i]-'A'+26]+= 1;


        }

    }
    for(int i =0;i<52;i++){
        if(nums[i]%2==0){
            ans += nums[i];
        }else if(!flag){
            if (nums[i]==1){
                ans += 1;
            }else{
            ans += nums[i];
            }
            flag = true;
        }else{
            ans += nums[i]-1;
        }
 


    }
    return ans;
    }
};