List<LinkedHashMap<String,String>>排序

xiaoxiao2021-02-28  71

package com.test; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.LinkedHashMap; import java.util.List; import java.util.Map; public class TestMapSortByValue { public static void main(String[] args) { Map<String, Integer> map = new LinkedHashMap<String, Integer>(); map.put("d", 4); map.put("a", 1); map.put("c", 3); map.put("e", 5); map.put("b", 2); // 排序前 System.out.println("before sort"); for (Map.Entry<String, Integer> entry : map.entrySet()) { System.out.println(entry.getKey() + "->" + entry.getValue()); } System.out.println(); // 将map转成list List<Map.Entry<String, Integer>> infos = new ArrayList<Map.Entry<String, Integer>>( map.entrySet()); // 对list排序,实现新的比较器 Collections.sort(infos, new Comparator<Map.Entry<String, Integer>>() { @Override public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) { return o1.getValue() - o2.getValue(); } }); // 申明新的有序 map,根据放入的数序排序 Map<String, Integer> lhm = new LinkedHashMap<String, Integer>(); // 遍历比较过后的map,将结果放到LinkedHashMap System.out.println("after sort"); for (Map.Entry<String, Integer> entry : infos) { // lhm.put(entry.getKey(), entry.getValue()); System.out.println(entry.getKey() + "->" + entry.getValue()); } // 遍历LinkedHashMap,打印值 /* System.out.println("after sort"); for (Map.Entry<String, Integer> entry : lhm.entrySet()) { System.out.println(entry.getKey() + "->" + entry.getValue()); }*/ } }

------------------------------------------------

例如,链表 treelist 声明如下:

LinkedList<TreeNode> treelist = new LinkedList<TreeNode>();

其中 TreeNode 是自己定义的一个类,类中有一个 int 类型的 value 属性,若要以 TreeNode 中的 value 属性排序,可以如下实现:

        1 、添加一个类,实现 Comparator 接口

public class TreeNodeComparator implements Comparator<TreeNode> {

 

  @Override

  public int compare(TreeNode o1, TreeNode o2 ) {

          return (o2 . value -o1. value ); ///?????

  }

}

2 、在要排序的地方,只需这样的一句话即可:

Collections.sort (treelist, new TreeNodeComparator()); // 排序

这样就实现了对treelist中的对象用value属性从非递减排序

--------------------------------------------------------------------------------------------

package com.test; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; public class $ { public static void main(String[] args) { List<Map<String, String>> list = new ArrayList<Map<String, String>>(); list.add(getData(0)); list.add(getData(3)); list.add(getData(05)); list.add(getData(6)); list.add(getData(2)); System.out.println("排序前" + list); Collections.sort(list, new Comparator<Map<String, String>>() { public int compare(Map<String, String> o1, Map<String, String> o2) { return o1.get("countScore").compareTo(o2.get("countScore")); } }); System.out.println("排序后" + list); } private static Map<String, String> getData(int num) { Map<String, String> map = new HashMap<String, String>(); map.put("countScore", String.valueOf(num)); return map; } }

转载请注明原文地址: https://www.6miu.com/read-66278.html

最新回复(0)