409.最长回文串

Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.

Letters are case sensitive, for example, “Aa” is not considered a palindrome here.

Example 1:

Input: s = “abccccdd”
Output: 7
Explanation:
One longest palindrome that can be built is “dccaccd”, whose length is 7.
Example 2:

Input: s = “a”
Output: 1
Example 3:

Input: s = “bb”
Output: 2

Constraints:

1 <= s.length <= 2000
s consists of lowercase and/or uppercase English letters only.

class Solution {
public:
    int longestPalindrome(string s) {
        int sSize=s.size();
        int len=0;
        vector<int> up(26,0),low(26,0);

        for(int i=0;i<sSize;i++)
        {
            if(s[i]>='a'&&s[i]<='z')
            {
                if(low[s[i]-'a']==0)
                    low[s[i]-'a']=1;
                else
                {
                    len+=2;
                    low[s[i]-'a']=0;
                }
            }
            if(s[i]>='A'&&s[i]<='Z')
            {
                if(up[s[i]-'A']==0)
                {
                    up[s[i]-'A']=1;
                }
                else
                {
                    len+=2;
                    up[s[i]-'A']=0;
                }
            }
        }
        
        sSize==len?len:len++;
        return len;
    }
};