TreeMap的使用

//统计kfasdjvgirngdadsaab这段字符所有字母出现的次数，并打印出来。

package test;

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

public class TreeMapDemo {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根
		String str = "kfasdjvgirngdadsaab";
		countStr(str);
	}
	public static void countStr(String str){
		TreeMap<Character,Integer> tm = new TreeMap<Character,Integer>();
		char ch[] = str.toCharArray();
		int count = 0;
		for(int i = 0;i<ch.length;i++){
			
			if(ch[i]>='a'&&ch[i]<='z'||ch[i]>='A'&&ch[i]<='Z'){
				Integer value = tm.get(ch[i]);
				if(value != null){
					count = value;
				}
				count++;
				tm.put(ch[i],count);
			}
			count = 0;
		}
		Set<Map.Entry<Character,Integer>> entrySet = tm.entrySet();
		Iterator<Map.Entry<Character, Integer>> it = entrySet.iterator();
		while(it.hasNext()){
			Map.Entry<Character, Integer> entry = it.next();
			StringBuilder sb = new StringBuilder();
			sb.append(entry.getKey() + "出现的次数为：" + entry.getValue());
			System.out.println(sb.toString());
		}
	}
}

输出结果为：