Map查表法练习

import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;

public class MapDemo7 {

	public static void main(String[] args) {
		//Map查表法练习
		//"asdfjsifudcbsdcnncn"
		//获取字符串中每一个字母出现的次数，要求结果格式：a(2)b(1)c(3)....
		
		String str = "asdfjsifudcbsdcnncn";
		
		String char_count = getCharCount(str);
		
		System.out.println(char_count);
		
	}

	private static String getCharCount(String str) {
		
		char[] chs = str.toCharArray();
		
		Map<Character,Integer> map = new TreeMap<Character,Integer>();
		
		for (int i = 0; i < chs.length; i++) {
			if(!(chs[i]>='a'&&chs[i]<='z'||chs[i]>='A'&&chs[i]<='Z'))
				continue;
				
			
			
			Integer value = map.get(chs[i]);
			int count = 0;
			if(value!=null){
				count=value;
			}
			count++;
			map.pu