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.

Contraintes

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

Exemples

Entrée :
board = ["*..", "...", "..*"]

Sortie attendue :
expected = ["*1.", "121", ".1*"]

Entrée :
std::vector<std::string> board = {"*..", "...", "..*"};

Sortie attendue :
std::vector<std::string> expected = {"*1.", "121", ".1*"};

Entrée :
string[] board = new string[] {"*..", "...", "..*"};

Sortie attendue :
string[] expected = new string[] {"*1.", "121", ".1*"};

Entrée :
board = ["..."]

Sortie attendue :
expected = ["..."]

Entrée :
std::vector<std::string> board = {"..."};

Sortie attendue :
std::vector<std::string> expected = {"..."};

Entrée :
string[] board = new string[] {"..."};

Sortie attendue :
string[] expected = new string[] {"..."};

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Exercism: Minesweeper