leetcode::surrounded_regions::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static void	dfs (vector< vector< char > > &board, int x, int y)
static void	solve (vector< vector< char > > &board)

详细描述

在文件 leetcode.h 第 2381 行定义.

成员函数说明

dfs()

void leetcode::surrounded_regions::Solution::dfs ( vector< vector< char > > &  board, int  x, int  y  )

static

在文件 leetcode.cpp 第 6393 行定义.

                                                                    {
            board[x][y]             = 'D';
            const int m             = board.size();
            const int n             = board[0].size();
            pair<int, int> nexts[4] = {{x - 1, y}, {x + 1, y}, {x, y - 1}, {x, y + 1}};
            for(auto [next_x, next_y]: nexts) {
                if(next_x >= 0 && next_x < m && next_y >= 0 && next_y < n && board[next_x][next_y] == 'O') {
                    dfs(board, next_x, next_y);
                }
            }
        }

引用了 dfs().

被这些函数引用 dfs() , 以及 solve().

solve()

void leetcode::surrounded_regions::Solution::solve ( vector< vector< char > > &  board )

static

在文件 leetcode.cpp 第 6362 行定义.

                                                        {
            const int m = board.size();
            const int n = board[0].size();
            for(int i = 0; i < n; i++) {
                if(board[0][i] == 'O') {
                    dfs(board, 0, i);
                }
                if(board[m - 1][i] == 'O') {
                    dfs(board, m - 1, i);
                }
            }
            for(int j = 0; j < m; j++) {
                if(board[j][0] == 'O') {
                    dfs(board, j, 0);
                }
                if(board[j][n - 1] == 'O') {
                    dfs(board, j, n - 1);
                }
            }
            for(int i = 0; i < m; i++) {
                for(int j = 0; j < n; j++) {
                    if(board[i][j] == 'O') {
                        board[i][j] = 'X';
                    }
                    if(board[i][j] == 'D') {
                        board[i][j] = 'O';
                    }
                }
            }
        }

引用了 dfs().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp