zoukankan      html  css  js  c++  java
  • LeetCode_409. Longest Palindrome

    409. Longest Palindrome

    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:
    7
    
    Explanation:
    One longest palindrome that can be built is "dccaccd", whose length is 7.
    package leetcode.easy;
    
    public class LongestPalindrome {
    	public int longestPalindrome(String s) {
    		int[] count = new int[128];
    		for (char c : s.toCharArray()) {
    			count[c]++;
    		}
    
    		int ans = 0;
    		for (int v : count) {
    			ans += v / 2 * 2;
    			if (ans % 2 == 0 && v % 2 == 1) {
    				ans++;
    			}
    		}
    		return ans;
    	}
    
    	@org.junit.Test
    	public void test() {
    		System.out.println(longestPalindrome("abccccdd"));
    	}
    }
    
  • 相关阅读:
    web应用程序的状态管理
    web学习笔记二
    java Web 学习笔记一
    简述Bootstrap栅格布局方式
    CSS3笔记
    CSS 笔记
    初识HTML流水笔记
    数据库初识
    java流的操作
    Java 套接字使用
  • 原文地址:https://www.cnblogs.com/denggelin/p/11928148.html
Copyright © 2011-2022 走看看