중첩된 `for`문, 경계 검사를 단순하게 만드는 min/max의 영리한 활용, 함수형 파이프라인, 그리고 2차원 행렬 사용법을 살펴봐요.
Minesweeper is a popular game where the user has to find the mines using numeric hints that indicate how many mines are directly adjacent (horizontally, vertically, diagonally) to a square.
Your task is to add the mine counts to empty squares in a completed Minesweeper board.
The board itself is a rectangle composed of squares that are either empty (' ') or a mine ('*').
For each empty square, count the number of mines adjacent to it (horizontally, vertically, diagonally). If the empty square has no adjacent mines, leave it empty. Otherwise replace it with the adjacent mines count.
For example, you may receive a 5 x 4 board like this (empty spaces are represented here with the '·' character for display on screen):
·*·*·
··*··
··*··
·····
Which your code should transform into this:
1*3*1
13*31
·2*2·
·111·
아직 어떤 언어로도 완료하지 않았어요.