409. Longest Palindrome

static int wing=[]()
{
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();

class Solution 
{
public:
    int longestPalindrome(string s) 
    {
        vector<int> vi(256,0);
        for(char c:s)
            vi[c]++;
        int count=0;
        int sub=0;
        for(int i:vi)
        {
            if(i%2==0)
                count+=i;
            else
            {
                if(i>2)
                    count+=(i-1);
                sub=1;
            }
        }
            
        return count+sub;
    }
};

vector处理字符串，老司机，你值得拥有