leetcode/algorithms/cpp/minesweeper/minesweeper.cpp at main · MichelleZ/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
// Source: https://leetcode.com/problems/minesweeper/
// Author: Miao Zhang
// Date:   2021-02-20

class Solution {
public:
    vector<vector<char>> updateBoard(vector<vector<char>>& board, vector<int>& click) {
        int r = click[0];
        int c = click[1];
        int m = board.size();
        int n = board[0].size();
        vector<vector<int>> dirs{{0, 1}, {0, -1}, {1, 0}, {-1, 0},
                                 {1, 1}, {1,-1}, {-1, 1}, {-1, -1}};
        if (board[r][c] == 'M') {
            board[r][c] = 'X';
        } else if (board[r][c] == 'E') {
            int minecnt = 0;
            for (auto d: dirs) {
                int x = r + d[0];
                int y = c + d[1];
                if (x >= 0 && x < m && y >= 0 && y < n && board[x][y] == 'M') {
                    minecnt++;
                }
            }
            if (minecnt > 0) {
                board[r][c] = '0' + minecnt;
            } else {
                board[r][c] = 'B';
                for (auto d: dirs) {
                    int x = r + d[0];
                    int y = c + d[1];
                    if (x >= 0 && x < m && y >= 0 && y < n) {
                        vector<int> tmp{x, y};
                        updateBoard(board, tmp);
                    }
                }
            }
        }
        return board;
    }
};