C++简易扫雷游戏怎么做 二维数组与递归展开算法

const int ROW = 10;
const int COL = 10;

char mineMap[ROW][COL]; // 存储雷的位置
char showMap[ROW][COL]; // 显示给用户看的状态

void initMaps() {
    // 初始化为无雷和未揭开状态
    for (int i = 0; i < ROW; ++i)
        for (int j = 0; j < COL; ++j) {
            mineMap[i][j] = '0';
            showMap[i][j] = '#'; // '#' 表示未揭开
        }

    // 随机布雷（假设放10个雷）
    int count = 0;
    while (count < 10) {
        int x = rand() % ROW;
        int y = rand() % COL;
        if (mineMap[x][y] != 'M') {
            mineMap[x][y] = 'M';
            count++;
        }
    }
}

int countNearbyMines(int x, int y) {
    int count = 0;
    for (int dx = -1; dx <= 1; ++dx)
        for (int dy = -1; dy <= 1; ++dy) {
            int nx = x + dx;
            int ny = y + dy;
            if (nx >= 0 && nx < ROW && ny >= 0 && ny < COL)
                if (mineMap[nx][ny] == 'M')
                    count++;
        }
    return count;
}

void reveal(int x, int y) {
    // 如果已经被揭开或者超出边界，直接返回
    if (x < 0 || x >= ROW || y < 0 || y >= COL || showMap[x][y] != '#')
        return;

    int nearby = countNearbyMines(x, y);
    if (nearby > 0) {
        showMap[x][y] = '0' + nearby; // 显示数字
        return;
    }

    showMap[x][y] = ' '; // 空白格子

    // 四周展开
    for (int dx = -1; dx <= 1; ++dx)
        for (int dy = -1; dy <= 1; ++dy)
            if (!(dx == 0 && dy == 0)) // 跳过自己
                reveal(x + dx, y + dy);
}

void printMap() {
    for (int i = 0; i < ROW; ++i) {
        for (int j = 0; j < COL; ++j)
            cout << showMap[i][j] << " ";
        cout << endl;
    }
}