josgjsjagwajsogiseafgjwsjgvoier转化成字符串 : a(字符的个数)b()c()..

练习题二: 1.josgjsjagwajsogiseafgjwsjgvoier

要求:转化成字符串 :  a(字符的个数)b()c()..

package com.qianfeng.test;

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

/**
 * 
 * @author lichangkun
 *
 */
/*
 * 练习题二: 1.josgjsjagwajsogiseafgjwsjgvoier
 * 要求:转化成字符串 :  a(字符的个数)b()c()..
 */
public class Test2 {
	public static void main(String[] args) {
		TreeMap<Character, Integer> map = new TreeMap<>();
		String string = "josgjsjagwajsogiseafgjwsjgvoier";
		char[] s = string.toCharArray();
		for(int i=0;i<s.length;i++){
			if(!map.containsKey(s[i])){
				map.put(s[i], 1);
			}
			else{
				map.put(s[i], map.get(s[i])+1);
			}
		}
		//通过Set<Map.Entry<K,V>> entrySet() 遍历方法二
		//先得到装着entry的set
		Set<Map.Entry<Character, Integer>> set2 = map.entrySet();
		Iterator<Entry<Character, Integer>> iterator2 = set2.iterator();
		while (iterator2.hasNext()) {
			Map.Entry<java.lang.Character, java.lang.Integer> entry2 = (Map.Entry<java.lang.Character, java.lang.Integer>) iterator2
					.next();
			System.out.print(entry2.getKey()+"("+entry2.getValue()+")");
		}
	}
}

 输出结果：a(3)e(2)f(1)g(5)i(2)j(6)o(3)r(1)s(5)v(1)w(2)