计算二维数组JAVA中单元格周围的雷数

public class MineSweeper {
    public static void main(String[] args) {
        int[][] board = {
            {0, 1, 0},
            {1, 0, 1},
            {0, 1, 0}
        };
        
        int[][] result = calculateMineCount(board);
        
        // 打印结果
        for (int i = 0; i < result.length; i++) {
            for (int j = 0; j < result[i].length; j++) {
                System.out.print(result[i][j] + " ");
            }
            System.out.println();
        }
    }
    
    public static int[][] calculateMineCount(int[][] board) {
        int[][] result = new int[board.length][board[0].length];
        
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[i].length; j++) {
                if (board[i][j] == 1) {
                    result[i][j] = -1; // 雷的标识
                    continue;
                }
                
                int count = 0;
                
                // 遍历周围8个方向的单元格
                for (int row = i - 1; row <= i + 1; row++) {
                    for (int col = j - 1; col <= j + 1; col++) {
                        if (row >= 0 && row < board.length && col >= 0 && col < board[i].length && board[row][col] == 1) {
                            count++;
                        }
                    }
                }
                
                result[i][j] = count;
            }
        }
        
        return result;
    }
}