排序TreeMap java中的值

Question

编辑:解决了。我需要将定义的顺序转换为Integer，Action

我已经创建了一个一对一的TreeMap，其中键是Enum，值是整数。我想从最少循环到最大，我遇到了一些麻烦。

函数，该函数创建映射

public TreeMap<Action,Integer> mapMoves(int position, ArrayList<Action> directions){
    TreeMap<Action,Integer> map = new TreeMap<>();
    for(Action a : directions){
        switch(a){
            case UP:
                map.put(a,board.get(position-3));
                break;
            case DOWN:
                map.put(a,board.get(position+3));
                break;
            case LEFT:
                map.put(a,board.get(position-1));
                break;
            case RIGHT:
                map.put(a,board.get(position+1));
                break;
        }
    }
    return map;
}

当我运行下面的for循环时，它不会按升序打印值。

TreeMap<Action, Integer> map = current.hashMoves(emptyIndex, possibleMoves);
for (Map.Entry<Action, Integer> entry : map.entrySet()) {
    System.out.println(entry.getKey() + ": " + entry.getValue());
 }

Answer 1

我猜Action是Enum，Enum已经实现了类似的。

它使用定义枚举常量的顺序，但遗憾的是，您不能重写比较方法来实现字典排序，因为它被定义为final。

但是您可以将自定义比较器传递给TreeMap。

将映射切换到<Integer,Action>或使用

static <K, V extends Comparable<V>> Map<K, V> sortByValues(final Map<K, V> map) {
    Comparator<K> valueComparator = (k1, k2) -> {
        int compare = map.get(k2).compareTo(map.get(k1));
        if (compare == 0) return 1;
        else return compare;
    };
    Map<K, V> sortedByValues = new TreeMap<K, V>(valueComparator);
    sortedByValues.putAll(map);
    return sortedByValues;
}
static TreeMap<Action,Integer> mapMoves() {
    List<Action> directions = new ArrayList<>();
    directions.add(Action.DOWN);
    directions.add(Action.UP);
    directions.add(Action.UP);
    directions.add(Action.UP);
    directions.add(Action.LEFT);
    directions.add(Action.LEFT);
    directions.add(Action.RIGHT);
    directions.add(Action.RIGHT);
    TreeMap<Action,Integer> map = new TreeMap<>();
    for(Action a : directions){
        switch (a){
            case UP:
                map.put(a, 10);
                break;
            case DOWN:
                map.put(a, 2);
                break;
            case LEFT:
                map.put(a, 30);
                break;
            case RIGHT:
                map.put(a, 4);
                break;
        }
    }
    return map;
}

enum Action {
    UP, DOWN, LEFT, RIGHT
}

main

    TreeMap<Action, Integer> map = mapMoves();
    map.entrySet().stream().forEach(e -> System.out.println("e = " + e.getKey() + ": " + e.getValue()));
    System.out.println("- - -");
    Map<Action, Integer> sortedMapByValuesDescOrder = sortByValues(map);
    sortedMapByValuesDescOrder.entrySet().stream().forEach(e -> System.out.println("e = " + e.getKey() + ": " + e.getValue()));

输出将

e = UP: 10
e = DOWN: 2
e = LEFT: 30
e = RIGHT: 4
- - -
e = LEFT: 30
e = UP: 10
e = RIGHT: 4
e = DOWN: 2