题解

#include <iostream>
#include <vector>
#include <string>
using namespace std;

int main() {
int n, m;
cin >> n >> m;
vector<string> grid(n);
for (int i = 0; i < n; i++) {
cin >> grid[i];
}

// 8个方向的偏移量：上、下、左、右、左上、右上、左下、右下
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};

for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
        if (grid[i][j] == '*') {
            cout << '*';
        } else {
            int count = 0;
            for (int k = 0; k < 8; k++) {
                int ni = i + dx[k];
                int nj = j + dy[k];
                // 检查相邻格子是否在雷区范围内
                if (ni >= 0 && ni < n && nj >= 0 && nj < m) {
                    if (grid[ni][nj] == '*') {
                        count++;
                    }

                }
            }
            cout << char('0' + count);
        }
    }
    cout << endl;
}

return 0;

}