Java TreeMap 小例子

// wordcount

public static void mapTest() {
      String text = "Constructs a list containing the elements of the specified" 
          + "collection, in the order they are returned by the collection's iterator."
          + "c the collection whose elements are to be placed into this list"
          + " NullPointerException if the specified collection is null ";
      
      TreeMap<String, Integer> map = new TreeMap<String, Integer>();
      String[] words = text.split("[ \n\t\r.,;:!?(){]");
      
      for (int i = 0; i < words.length; i++) {
        String key = words[i].toLowerCase();
        if (key.length() > 0) {
          if (map.get(key) == null)
            map.put(key, 1);
          else {
            int value = map.get(key).intValue();
            value++;
            map.put(key, value);
          }
        }
      }
      Set<Map.Entry<String, Integer>> entrySet = map.entrySet();
      for (Map.Entry<String, Integer> entry: entrySet)
        System.out.println(entry.getValue() + "\t" + entry.getKey());
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值