美文网首页LeetCode solutions
409. Longest Palindrome

409. Longest Palindrome

作者: 番茄晓蛋 | 来源:发表于2016-10-09 15:16 被阅读104次

    My Submissions

    Total Accepted: 5510
    Total Submissions: 12152
    Difficulty: Easy

    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:7Explanation:One longest palindrome that can be built is "dccaccd", whose length is 7.

    Hide Company Tags
    Google
    Hide Tags
    Hash Table
    Hide Similar Problems
    (E) Palindrome Permutation

      public int longestPalindrome(String s) {
            if(s == null || s.length() == 0 ) return 0;
    
            int count = 0;
            HashSet<Character> set = new HashSet<>();
            for (int i = 0; i < s.length(); i++) {
                if (set.contains(s.charAt(i))) {
                    set.remove(s.charAt(i));
                    count++;
                }  else {
                    set.add(s.charAt(i));
                }
            }
            
            if (!set.isEmpty()) return count*2  + 1;
            return count * 2;
        }
        // ref: https://discuss.leetcode.com/topic/61300/simple-hashset-solution-java
    

    相关文章

      网友评论

        本文标题:409. Longest Palindrome

        本文链接:https://www.haomeiwen.com/subject/dxopyttx.html