leetcode题解-409. 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.
示例：Input: “abccccdd” Output: 7
Explanation: One longest palindrome that can be built is “dccaccd”, whose length is 7.

思路：通过题目我们可以看出要求的就是字符串s中有多少个字符出现了偶数次，多少个字符出现了奇数次。进一步可以简化为对每个字符每出现两次都加2，然后剩下的都是出现一次的，再加个一即可（思路二）。
接下来直接看代码即可。

这种方法击败了60%的用户

    public int longestPalindrome(String s) {
        int[] tmp = new int[128];
        int res = 0;
        boolean symbol = false;
        for(char c : s.toCharArray())
            tmp[(int)c] += 1;
        for(int a : tmp){
            if(a%2 == 0)
                res += a;
            else if(a>0){
                symbol = true;
                res += a-1;
            }
        }
        if(symbol == true)
            res += 1;
        return res;
    }

使用思路二可以省去对tmp数组的遍历，从而节省了很多时间。击败了93%的用户。

    public int longestPalindrome3(String s) {
        boolean[] map = new boolean[128];
        int len = 0;
        for (char c : s.toCharArray()) {
            map[c] = !map[c];         // flip on each occurrence, false when seen n*2 times
            if (!map[c]) len+=2;
        }
        if (len < s.length()) len++; // if more than len, atleast one single is present
        return len;
    }