map按值排序

package com.zhilei.test;

import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;

public class mapValueCompareSort {
public static void main(String[] args) {

HashMap<String, Double> mapDesc = new HashMap<String, Double>();
ValueComparator bvcDESC = new ValueComparator(mapDesc);
TreeMap<String, Double> sorted_map_Desc = new TreeMap<String, Double>(bvcDESC);

mapDesc.put("A", 99.5);
mapDesc.put("B", 67.4);
mapDesc.put("C", 67.4);
mapDesc.put("D", 67.3);
mapDesc.put("E", 11.0);
mapDesc.put("F", -0.1);
mapDesc.put("G", 0.1);
mapDesc.put("H", -99.1);


sorted_map_Desc.putAll(mapDesc);

System.out.println("降序=====results: " + sorted_map_Desc);

HashMap<String, Double> mapAsc = new HashMap<String, Double>();
ValueComparatorAsc bvcAsc = new ValueComparatorAsc(mapAsc);
TreeMap<String, Double> sorted_mapAsc = new TreeMap<String, Double>(bvcAsc);

mapAsc.put("宽", 99.5);
mapAsc.put("B", 67.4);
mapAsc.put("C", 67.4);
mapAsc.put("D", 67.3);
mapAsc.put("r", 11.0);
mapAsc.put("rt", -0.1);
mapAsc.put("ee", 0.1);
mapAsc.put("cc", -99.1);

System.out.println("升序====unsorted map: " + mapAsc);

sorted_mapAsc.putAll(mapAsc);

System.out.println("升序====results: " + sorted_mapAsc);

}
}

class ValueComparator implements Comparator<String> {
Map<String, Double> base;

public ValueComparator(Map<String, Double> base) {
this.base = base;
}

public int compare(String a, String b) {
if (base.get(a) >= base.get(b)) {
return -1;
} else {
return 1;
}
}
}

class ValueComparatorAsc implements Comparator<String> {
Map<String, Double> base;

public ValueComparatorAsc(Map<String, Double> base) {
this.base = base;
}

public int compare(String a, String b) {
if (base.get(a) <= base.get(b)) {
return -1;
} else {
return 1;
}
}

}

转载于:https://www.cnblogs.com/leigepython/p/10118946.html

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值