我正在尝试编写一种方法，该方法对数组中的相邻单元格求和，并使用获得的值填充第二个数组中的位置

Question

I am pretty new to java and am wondering how I would take anxn array with these values and sum the surrounding values and then insert it into secondArray perhaps using a for loop? I appreciate the help.

firstArray:

1 1 0 1 0 1

1 0 1 0 1 0

1 1 0 0 1 1

1 1 0 0 1 1

0 0 0 1 1 0

secondArray:

2 3 3 2 3 1

4 6 3 3 4 4

4 5 3 4 4 4

3 3 3 4 5 4

2 2 2 2 3 3

Answer 1

Here's the mechanics (added one last row to the matrix as you said the matrix is NxN):

int[][] matrix = new int[][]{
        { 1, 1, 0, 1, 0, 1 },
        { 1, 0, 1, 0, 1, 0 },
        { 1, 1, 0, 0, 1, 1 },
        { 1, 1, 0, 0, 1, 1 },
        { 0, 0, 0, 1, 1, 0 },
        { 0, 0, 0, 0, 0, 0 }
};

int[][] result = new int[ matrix.length ][ matrix.length ];

for (int i = 0; i < matrix.length; i++) {
    for (int j = 0; j < matrix.length; j++) {
        result[ i ][ j ] = sumOfSurrounding( matrix, i, j );
    }
}

for (int i = 0; i < matrix.length; i++) {
    for (int j = 0; j < matrix.length; j++) {
        System.out.print( result[ i ][ j ] + " " );
    }
    System.out.println();
}

Now, you just have to implement the static int sumOfSurrounding( int[][] matrix, int i, int j ) method.