什么是实现扩展类计算的好方法？

Question

我有以下类:

public class Node {
    private int x;
    private int y;

}

public abstract class Map {
    protected Node[][] grid;
    
    public abstract Set<Node> findNeighbours(Node node);
}

public class SquareMap extends Map {
    private static final int VERTICAL_COST= 10;
    private static final int HORIZONTAL_COST= 10;
    private static final int DIAGONAL_COST = 14;

    @Override
    public Set<Node> findNeighbours(Node node) {
        //return the 8 adjacent nodes
    }
}

public class HexMap extends Map {
    private static final int MOVE_COST = 10;

    @Override
    public Set<Node> findNeighbours(Node node) {
        //return the 6 adjacent nodes
    }
}

我想创建一个类似

的方法

public int calculateMoveCost(Node current, Node target, <whatever else is needed>) {}

我只传入节点，方法、节点或地图中的逻辑可以识别我使用的地图类型。我当前的解决方案如下所示：

    private int calculateMoveCost(Node current, Node target, Map map) {
        int cost;
        if(isHexMap(map)) {
            cost = map.getMoveCost();
        } else {
            if(isSquareMap(map)) {
                if(verticalNeighbours(current, target)) {
                    cost = map.getVerticalMoveCost();
                } else {
                    cost = map.getHorizontalMoveCost();
                }
            }
        }
        return cost;
    }

当我查看这段代码时，我认为必须有更好的方法来实现它。你能推荐一个很好的面向对象的实现方式吗？我可以在任何对象中创建任何引用，目标是有一个很好的解决方案。谢谢！

Answer 1

我确实认为对此有一个正确的答案，只需在 Map 上有一个抽象的 getMoveCost 方法并在每个子类中实现它。然后你可以调用 map.getMoveCost(from, to).

public abstract class Map {
    protected Node[][] grid;
    
    public abstract int getMoveCost(Node current, Node target);
    public abstract Set<Node> findNeighbours(Node node);
}

public class SquareMap extends Map {
    private static final int VERTICAL_COST= 10;
    private static final int HORIZONTAL_COST= 10;
    private static final int DIAGONAL_COST = 14;

    @Override
    public Set<Node> findNeighbours(Node node) {
        //return the 8 adjacent nodes
    }

    @Override
    public int getMoveCost(Node current, Node target) {
        if(verticalNeighbours(current, target)) {            
            cost = getVerticalMoveCost();
        } else {
            cost = getHorizontalMoveCost();
        }
    }
}

什么是实现扩展类计算的好方法？

What is a good way to implement calculations for extended classes?

java

oop

structure

什么是实现扩展 类 计算的好方法？

What is a good way to implement calculations for extended classes?

java

oop

structure

什么是实现扩展类计算的好方法？