Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static int[][] countAdjacentMines(int grid[][], int row, int column){
- try{
- for(int i = 0; i < grid.length; i++){
- for(int j = 0; j < grid.length; j++){
- if(grid[i][j] >= 9){
- if((i > 0 && i < 9) && (j > 0 && j < 9)){
- grid[i-1][j-1] += 1;
- grid[i-1][j] += 1;
- grid[i-1][j+1] += 1;
- grid[i][j-1] += 1;
- grid[i][j+1] += 1;
- grid[i+1][j-1] += 1;
- grid[i+1][j] += 1;
- grid[i+1][j+1] += 1;
- } // Adds one for each mine inside board.
- if(i == 0 && j != 9 && j != 0){
- grid[i][j-1] += 1;
- grid[i][j+1] += 1;
- grid[i+1][j-1] += 1;
- grid[i+1][j] += 1;
- grid[i+1][j+1] += 1;
- } // Adds one for mines on top row.
- if(j == 0 && i != 9 && i != 0){
- grid[i-1][j] += 1;
- grid[i-1][j+1] += 1;
- grid[i][j+1] += 1;
- grid[i+1][j] += 1;
- grid[i+1][j+1] += 1;
- } // Adds one for mines on left-most column.
- if(i == 9 && j != 9 && j != 0){
- grid[i-1][j-1] += 1;
- grid[i-1][j] += 1;
- grid[i-1][j+1] += 1;
- grid[i][j-1] += 1;
- grid[i][j+1] += 1;
- } // Adds one for mines on bottom row.
- if(j == 9 && i != 9 && i != 0){
- grid[i-1][j-1] += 1;
- grid[i-1][j] += 1;
- grid[i][j-1] += 1;
- grid[i+1][j-1] += 1;
- grid[i+1][j] += 1;
- } // Adds one for mines on right-most column.
- if(i == 0 && j == 0){
- grid[i][j+1] += 1;
- grid[i+1][j+1] += 1;
- grid[i+1][j] += 1;
- } // Adds one for mines on top left corner.
- if(i == 0 && j == 9){
- grid[i][j-1] += 1;
- grid[i+1][j] += 1;
- grid[i+1][j-1] += 1;
- } // Adds one for mines on top right corner.
- if(i == 9 && j == 0){
- grid[i-1][j+1] += 1;
- grid[i-1][j] += 1;
- grid[i][j+1] += 1;
- } // Adds one for mines on bottom left corner.
- if(i == 9 && j == 9){
- grid[i-1][j-1] += 1;
- grid[i-1][j] += 1;
- grid[i][j-1] += 1;
- } // Adds one for mines on bottom right corner.
- }
- }
- }
- }
- catch(ArrayIndexOutOfBoundsException ex){
- System.out.println("\nbumbo");
- }
- return grid;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement