LinkedHashMap排序

来源:互联网 发布:mac有风扇声音很大 编辑:程序博客网 时间:2024/05/21 10:05
LinkedHashMap<String, Float> map = new LinkedHashMap<>();//先转成ArrayList集合ArrayList<Entry<String, Float>> list =         new ArrayList<Map.Entry<String, Float>>(map.entrySet());//从小到大排序(从大到小将o1与o2交换即可)Collections.sort(list, new Comparator<Map.Entry<String, Float>>() {    @Override    public int compare(Entry<String, Float> o1, Entry<String, Float> o2) {        return ((o1.getValue() - o2.getValue() == 0) ?                 0: (o1.getValue() - o2.getValue() > 0) ? 1: -1);    }});//新建一个LinkedHashMap,把排序后的List放入LinkedHashMap<String, Float> map2 = new LinkedHashMap<>();for (Map.Entry<String, Float> entry : list) {    map2.put(entry.getKey(), entry.getValue());}//遍历输出for (Map.Entry<String, Float> entry : map2.entrySet()) {    System.out.println(entry.getKey() + ":" + entry.getValue());}
原创粉丝点击