题解 | 扫雷

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

int main() {
    int n, m, count = 0;
    cin >> n >> m;
    vector<vector<char>> arr(n, vector<char>(m));
    for (auto& row : arr) {
        for (auto& c : row) {
            cin >> c;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (arr[i][j] == '.') {
                for (int offset_i = -1; offset_i <= 1; offset_i++) {
                    for (int offset_j = -1; offset_j <= 1; offset_j++) {
                        if (offset_i == 0 && offset_j == 0) continue;

                        int res_i = i + offset_i, res_j = j + offset_j;
                        if (res_i >= 0 && res_i < n && res_j >= 0 &&
                                res_j < m && arr[res_i][res_j] == '*') {
                            count++;
                        }
                    }
                }
                arr[i][j] = count > 0 ? '0' + count : '0';
            }
            cout << arr[i][j];
        }
        // cout << endl;
        cout << '\n';
    }
    return 0;
}