leetcode::number_of_enclaves::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	numEnclaves (vector< vector< int > > &grid)

详细描述

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

成员函数说明

numEnclaves()

int leetcode::number_of_enclaves::Solution::numEnclaves ( vector< vector< int > > &  grid )

static

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

                                                           {
            int sum     = 0;
            const int m = grid.size();
            const int n = grid[0].size();
            auto que    = queue<pair<int, int>>();
            for(int i = 0; i < m; i++) {
                for(int j = 0; j < n; j++) {
                    if(grid[i][j] == 1) {
                        sum++;
                        if(i == 0 || i == m - 1 || j == 0 || j == n - 1) {
                            que.push(make_pair(i, j));
                            grid[i][j] = 0;
                        }
                    }
                }
            }
            while(!que.empty()) {
                auto [x, y] = que.front();
                sum--;
                que.pop();
                pair<int, int> nexts[4] = {make_pair(x + 1, y), make_pair(x - 1, y), make_pair(x, y + 1), make_pair(x, y - 1)};
                for(auto next: nexts) {
                    auto [next_x, next_y] = next;
                    if(0 <= next_x && next_x < m && 0 <= next_y && next_y < n && grid[next_x][next_y] != 0) {
                        que.push(next);
                        grid[next_x][next_y] = 0;
                    }
                }
            }
            return sum;
        }

被这些函数引用 leetcode::number_of_enclaves::TEST().

---

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

• leetcode.h
• leetcode.cpp