leetcode409

最新推荐文章于 2022-05-02 12:17:58 发布

转载最新推荐文章于 2022-05-02 12:17:58 发布 · 208 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wylwyl/p/10720683.html

文章标签：

#java

package com.problem01;

import java.util.HashMap;


public class Main {

	public static void main(String[] args) {
		String s = "abcddbcaa";
		System.out.println(longestPalindrome(s));
	}
	
	 public static int longestPalindrome(String s) {
	        int maxlength=0;
	        int flag = 0;
	        
	        HashMap<Character, Integer> map = new HashMap<>();
	        
	        for(int i = 0; i < s.length(); i++) {
	        	if(map.containsKey(s.charAt(i))) {
	        		map.put(s.charAt(i), map.get(s.charAt(i))+1);
	        	} else {
	        		map.put(s.charAt(i), 1);
	        	}
	        }
	        
	        for(Character c : map.keySet()) {
	        	if(map.get(c) % 2 == 0) {
	        		maxlength = maxlength + map.get(c);
	        	} else {
	        		maxlength = maxlength + map.get(c) - 1;
	        		flag = 1;
	        	}
	        }
	
	        return maxlength+flag;
	}

}

转载于:https://www.cnblogs.com/wylwyl/p/10720683.html