题解 | 扫雷

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

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> maps(n + 2, vector<int>(m + 2, 0));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            char x;
            cin >> x;
            if (x == '*') {
                maps[i][j] = 1;
            }
        }
    }
    vector<vector<int>> mines(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            mines[i][j] = maps[i][j] + maps[i + 1][j] + maps[i + 2][j] + maps[i][j + 1] +
                          maps[i + 2][j + 1] + maps[i][j + 2] + maps[i + 1][j + 2] + maps[i + 2][j + 2];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if(maps[i+1][j+1]==1){
                cout<<'*';
            }else{cout<<mines[i][j];}
        }
        cout<<endl;
    }
}

一个简单易懂，无需解析的做法。