409. Longest Palindrome

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.

• Example:

Input:
“abccccdd”

Output:
7

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

• 题目大意：给定一个string字符串，找出该string字符串可以组成的最大回文串的长度

• 思路：hashset，新建一个set,遍历数组，对于在set中不存在的字符，添加到set中，对于set中存在的字符，移除set字符，当前count加1，最后判断set是否为空，如果为空，数组中的所有数都可以组成回文串，回文数个数为count*2,否则为count*2+1。

• 代码

  package HashTable;
  
  import java.util.HashSet;
  import java.util.Set;
  
  /**
  * @author OovEver
  * 2018/1/8 23:19
  */
  public class LeetCode409 {
    public int longestPalindrome(String s) {
        if (s == null || s.length() == 0) {
            return 0;
        }
        int count = 0;
        Set<Character> set = new HashSet<>();
        for(int i=0;i<s.length();i++) {
            if (set.contains(s.charAt(i))) {
                count++;
                set.remove(s.charAt(i));
            } else {
                set.add(s.charAt(i));
            }
        }
        if (set.isEmpty()) {
            return 2 * count;
        } else {
            return 2 * count + 1;
        }
  
    }
  }