zoukankan      html  css  js  c++  java
  • 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.


    public class Solution {
        public int longestPalindrome(String s) {
          HashMap<Character, Integer> map = new HashMap<>();
          int res = 0;
          int odd = 0;
          for(int i = 0; i < s.length(); i++){
              map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0)+1);
          }
          for(int i : map.values()){
              if(i > 0 &&  i % 2 == 0)
                res += i;
              else{
                res += i - 1;  //是奇数的话要可取偶数个值!!!!
                odd = 1;
              }
          }
          return res + odd;
        }
    }
  • 相关阅读:
    hdu2037 经典贪心入门
    hdu1045 dfs
    poj2243 bfs
    poj2488 dfs
    poj1111 DFS
    单词统计
    冲刺第五天
    七周总结学习笔记
    冲刺第四天
    冲刺第三天
  • 原文地址:https://www.cnblogs.com/joannacode/p/5965862.html
Copyright © 2011-2022 走看看