java数组位置查找_java-在2D数组中查找有效的邻居

对于任何二维数组,下面代码的(x,y)维的cellValues [] []可用于获取任何单元(i,j)的所有8个邻居.默认情况下,代码将返回0.

public static ArrayList getNeighbors(int i, int j, int x, int y, int[][] cellValues) {

ArrayList neighbors = new ArrayList<>();

if(isCabin(i, j, x, y)) {

if(isCabin(i + 1, j, x, y))

neighbors.add(cellValues[i+1][j]);

if(isCabin(i - 1, j, x, y))

neighbors.add(cellValues[i-1][j]);

if(isCabin(i, j + 1, x, y))

neighbors.add(cellValues[i][j+1]);

if(isCabin(i, j - 1, x, y))

neighbors.add(cellValues[i][j-1]);

if(isCabin(i - 1, j + 1, x, y))

neighbors.add(cellValues[i-1][j+1]);

if(isCabin(i + 1, j - 1, x, y))

neighbors.add(cellValues[i+1][j-1]);

if(isCabin(i + 1, j + 1, x, y))

neighbors.add(cellValues[i+1][j+1]);

if(isCabin(i - 1, j - 1, x, y))

neighbors.add(cellValues[i-1][j-1]);

}

return neighbors;

}

public static boolean isCabin(int i, int j, int x, int y) {

boolean flag = false;

if (i >= 0 && i <= x && j >= 0 && j <= y) {

flag = true;

}

return flag;

}