Question

Java method that accepts (so you don't need to make an array for it) a 2d array.of unknown row and column length. it functions like minesweeper but a lot smaller scale. basically in this case the 0's in the array indicate nothing an 8's indicate a mine. So squares surrounding the 8 (mine) indicate how many mines are adjacent to it. So if there are two mines adjacent to one squre it will show two.so like this.

0 1 1 2 1 1

0 1 8 2 8 1

0 1 1 2 1 1

0 0 0 0 0 0

public static void findMinesweeper(int[][] array) {

Answer 1

public class MineSweeper {

    public static void findMinesweeper(int[][] array) {
        int r, c, count;
        for(int i = 0; i < array.length; ++i) {
            for(int j = 0; j < array[i].length; ++j) {
                if(array[i][j] != 8) {
                    count = 0;
                    r = i-1;
                    c = j-1;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    r = i-1;
                    c = j;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    r = i-1;
                    c = j+1;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    r = i;
                    c = j-1;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    r = i;
                    c = j+1;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    r = i+1;
                    c = j-1;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    r = i+1;
                    c = j;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    r = i+1;
                    c = j+1;
                    if(r < array.length && r >= 0 && c < array[r].length && c >= 0 && array[r][c] == 8) {
                        count++;
                    }
                    array[i][j] = count;
                }
            }
        }
    }

    public static void main(String[] args) {
        int[][] mines = {{0, 0, 0, 0, 0, 0}, {0, 0, 8, 0, 8, 0}, {0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0}};
        findMinesweeper(mines);
        for(int i = 0; i < mines.length; ++i) {
            for(int j = 0; j < mines[i].length; ++j) {
                System.out.print(mines[i][j] + "\t");
            }
            System.out.println();
        }
    }

}