I create a sapper on JS, there is a two-dimensional array filled with zeros and ones, 1 is a mine, you need to create an array filled with numbers, the number of mines around the cell, you can’t do because of the array boundaries.

var mineField = [ ['0', '0', '0', '1', '0'], ['0', '1', '0', '0', '0'], ['0', '0', '1', '0', '1'], ['1', '0', '0', '1', '0'], ['0', '0', '1', '0', '0'] ]; var markField=[]; for(var i = 0;i< mineField.length;i++){ markField[i] = []; for(var j = 0; j< mineField[i].length; j++){ if(field[i][j] == 1) markField[i][j] = "-1";//если мина то вносить -1 else{ var mineCounter = 0;//Количество мин вокруг ячейки if (field[i-1][j-1] === 1) mineCounter++; if (field[i-1][j] === 1) mineCounter++; if (field[i-1][j+1] === 1) mineCounter++; if (field[i][j-1] === 1) mineCounter++; if (field[i][j+1] === 1) mineCounter++; if (field[i+1][j-1] === 1) mineCounter++; if (field[i+1][j] === 1) mineCounter++; if (field[i+1][j+1] === 1) mineCounter++; markField[i][j] = mineCounter; } } }

    2 answers 2

    I changed my mind about closing as a duplicate. The mine counter around does not work , as this is another way that also has a right to exist.

     var field = [ [0, 0, 0, 1, 0], [0, 1, 0, 0, 0], [0, 0, 1, 0, 1], [1, 0, 0, 1, 0], [0, 0, 1, 0, 0] ]; var mark = []; for (var i = 0; i < field.length; i++) { mark[i] = []; for (var j = 0; j < field[i].length; j++) { if (field[i][j] == 1) mark[i][j] = 9; // для красоты вывода результата, 9 тоже не может быть else { var counter = 0; if (field[i - 1] && field[i - 1][j - 1] == 1) counter++; if (field[i - 1] && field[i - 1][j] == 1) counter++; if (field[i - 1] && field[i - 1][j + 1] == 1) counter++; if (field[i][j - 1] == 1) counter++; if (field[i][j + 1] == 1) counter++; if (field[i + 1] && field[i + 1][j - 1] == 1) counter++; if (field[i + 1] && field[i + 1][j] == 1) counter++; if (field[i + 1] && field[i + 1][j + 1] == 1) counter++; mark[i][j] = counter; } } } for (i = 0; i < mark.length; i++) console.log(JSON.stringify(mark[i]));

      Just check the boundaries of the matrix. If the field for summation is outside taking into account these boundaries, then ignore it. Otherwise, add to the amount.

       let mineField = [ [0, 0, 0, 1, 0], [0, 1, 0, 0, 0], [0, 0, 1, 0, 1], [1, 0, 0, 1, 0], [0, 0, 1, 0, 0], ]; let markField = []; for (let row = 0, h = mineField.length - 1; row <= h; row++) { markField.push([]); for (let col = 0, w = mineField[row].length - 1; col <= w; col++) { markField[row].push( 1 * (row > 0 && col > 0 && mineField[row - 1][col - 1]) + 1 * (row > 0 && mineField[row - 1][col ]) + 1 * (row > 0 && col < w && mineField[row - 1][col + 1]) + 1 * ( col > 0 && mineField[row ][col - 1]) + 1 * ( col < w && mineField[row ][col + 1]) + 1 * (row < h && col > 0 && mineField[row + 1][col - 1]) + 1 * (row < h && mineField[row + 1][col ]) + 1 * (row < h && col < w && mineField[row + 1][col + 1]) ); } console.log(markField[row].join()); }