LongestPalindrome.md

##Longest Palindrome lintcode

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.

##Example Given s = "abccccdd" return 7

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

Notice
Assume the length of given string will not exceed 1010.

##思路

• 一开始用了map
• 后来用了数组就行
• 后来一想只需要set,每次put然后在遇到remove

public class Solution {
    /**
     * @param s: a string which consists of lowercase or uppercase letters
     * @return: the length of the longest palindromes that can be built
     */
    public int longestPalindrome(String s) {
        // write your code here
        if (s == null || s.equals("")) {
            return 0;
        }

        int[] chars = new int[58];
        int total = 0;

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            int index = c - 'A';

            if (chars[index] % 2 == 1) {
                total += 2;
                chars[index] = 0;
            } else {
                chars[index] = 1;
            }
        }

        for (int i = 0; i < 58; i++) {
            if (chars[i] == 1) {
                total++;
                break;
            }
        }

        return total;
    }
}

public class Solution {
    /**
     * @param s a string which consists of lowercase or uppercase letters
     * @return the length of the longest palindromes that can be built
     */
    public int longestPalindrome(String s) {
        // Write your code here
        Set<Character> set = new HashSet<>();
        for (char c : s.toCharArray()) {
            if (set.contains(c)) set.remove(c);
            else set.add(c);
        }

        int remove = set.size();
        if (remove > 0)
            remove -= 1;
        return s.length() - remove;
    }
}