按TreeMap中的值进行排序，而不是键，代码出错了~~

2011-12-09 01:26:20 94 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

从零到一：基于STM8的125KHz RFID读卡器实现与曼彻斯特码解析实战本文详细介绍了基于STM8单片机的125KHz RFID读卡器实现过程，重点解析了曼彻斯特码的编码原理与解码算法。通过硬件电路设计、软件实现及性能优化，帮助开发者低成本构建稳定读取EM4100卡片的系统，适用于门禁、考勤等应用场景。阅读详情

http://topic.csdn.net/u/20110621/18/db4e6e64-da20-4933-8fa3-3b5a870d71ff.html?seed=35017025&r=76858240#r_76858240
首先，请看上面链接中的帖子。



package datastruct;



import java.util.*;

import java.util.Map.*;

public class CountOccurrenceOfWords1 {

	public static void main(String[] args){

		String text = "Having a good day. Have a good class." +

			"Having a good visit. Have fun!";



		Map<String,Integer> hashMap = new HashMap<String,Integer>();



		String[] words = text.split("[ .!?]");

		for(int i=0;i<words.length;++i){

			if(words[i].length()>1){

				if(hashMap.get(words[i]) != null){

					int value = hashMap.get(words[i]).intValue();

					value ++;

					hashMap.put(words[i],value);

				}else{

					hashMap.put(words[i],1);

				}

			}

		}

		Map<String,Integer> treeMap = new TreeMap<String,Integer> (new Comparator<Map.Entry<String, Integer>>() {   

  public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {   

	return (o2.getValue() - o1.getValue());  

  }

});

		treeMap.putAll(hashMap);		

		System.out.println("Display words and their count in"+" ascending order of the words1");

		System.out.println(treeMap); 

	}

}