我想基于它的值排序LinkedHashMap。我不明白的是结果。它似乎只需要两个键进行排序。任何指向我缺少什么?LinkedHashMap排序
public class test {
public static void main(String[] args) {
// TODO Auto-generated method stub
LinkedHashMap<Integer, Integer> sorting = new LinkedHashMap<Integer, Integer>();
sorting.put(1, 100);
sorting.put(10, 100);
sorting.put(20, 200);
sorting.put(30, 100);
sorting.put(40, 100);
sorting.put(50, 200);
for (Entry<Integer, Integer> entry : sorting.entrySet()) {
Integer key = entry.getKey();
Integer value = entry.getValue();
System.out.println("LINKED UNSORTED === key: "+ key + '\t' + "Value: " + value);
// do stuff
}
Comparator<Integer> comparator = new ValueCom(sorting);
TreeMap<Integer, Integer> sortedMap =new TreeMap<Integer, Integer>(comparator);
sortedMap.putAll(sorting);
for (Entry<Integer, Integer> entry : sortedMap.entrySet()) {
Integer key = entry.getKey();
Integer value = entry.getValue();
System.out.println("SORTED === key: "+ key + '\t' + "Value: " + value);
// do stuff
}
}
}
class ValueCom implements Comparator<Integer> {
LinkedHashMap<Integer, Integer> map = new LinkedHashMap<Integer, Integer>();
public ValueCom(HashMap<Integer, Integer> map) {
this.map.putAll(map);
}
public int compare(Integer keyA, Integer keyB){
return map.get(keyB).compareTo(map.get(keyA));
}
}
输出的电流如上
LINKED UNSORTED === key: 1 Value: 100
LINKED UNSORTED === key: 10 Value: 100
LINKED UNSORTED === key: 20 Value: 200
LINKED UNSORTED === key: 30 Value: 100
LINKED UNSORTED === key: 40 Value: 100
LINKED UNSORTED === key: 50 Value: 200
SORTED === key: 20 Value: 200
SORTED === key: 1 Value: 100
像以前那样重新定义“地图”到“TreeMap的”产生相同的输出。 – Betafish
@Betafish你是什么意思“重新定义'Map'到'TreeMap'”,你为什么期望它有所作为? – Eran