Minesweeper Neighbor Counts

Annotate a rectangular board. A star (*) is a mine and a dot (.) is a safe cell. For each safe cell, count mines in the eight surrounding cells, including diagonals. Replace it with the count from 1 to 8, or keep a dot if the count is zero. Preserve every mine. Cells outside the board do not exist.

Implement minesweeper_neighbor_counts(board).

Input

board: The rows from top to bottom; characters run left to right.

Output

Return the annotated rows in the same order and dimensions.

Restrições

1 ≤ rows, columns ≤ 200. Every row has the same nonzero length and contains only * and . .

Exemplos

Entrada:
board = ["*..", "...", "..*"]

Saída esperada:
expected = ["*1.", "121", ".1*"]

Entrada:
std::vector<std::string> board = {"*..", "...", "..*"};

Saída esperada:
std::vector<std::string> expected = {"*1.", "121", ".1*"};

Entrada:
string[] board = new string[] {"*..", "...", "..*"};

Saída esperada:
string[] expected = new string[] {"*1.", "121", ".1*"};

Entrada:
board = ["..."]

Saída esperada:
expected = ["..."]

Entrada:
std::vector<std::string> board = {"..."};

Saída esperada:
std::vector<std::string> expected = {"..."};

Entrada:
string[] board = new string[] {"..."};

Saída esperada:
string[] expected = new string[] {"..."};

Referências

Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.

• Exercism: Minesweeper