LeetCode 409. Longest Palindrome

原题链接在这里：https://leetcode.com/problems/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.

Example:

Input:
"abccccdd"

Output:
7

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

题解：

Time Complexity: O(s.length()). Space: O(s.length()).

AC Java:

public class Solution {
    public int longestPalindrome(String s) {
        if(s == null || s.length() == 0){
            return 0;
        }
        
        int res = 0;
        HashSet<Character> hs = new HashSet<Character>();
        for(int i = 0; i<s.length(); i++){
            char c = s.charAt(i);
            if(hs.contains(c)){
                hs.remove(c);
                res++;
            }else{
                hs.add(c);
            }
        }
        return hs.isEmpty() ? res*2 : res*2+1;
    }
}

AC C++:

class Solution {
public:
    int longestPalindrome(string s) {
        unordered_set<char> set;
        int res = 0;
        for(char c : s){
            if(set.find(c) != set.end()){
                res += 2;
                set.erase(c);
            }else{
                set.insert(c);
            }
        }

        res += set.empty() ? 0 : 1;
        return res;
    }
};

类似Palindrome Permutation.