Eatswap
/
leetcode-daily
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

feat: optimise ()

This commit is contained in:
Eatswap 2023-04-07 15:55:56 +08:00
parent 476514de0b
commit 1b168df890
Signed by: Eatswap
GPG Key ID: BE661106A1F3FA0B
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
cpp/2304/230407.cpp
View File

@ -21,12 +21,12 @@ public:
int Solution::numEnclaves(std::vector<std::vector<int>>& G) { int Solution::numEnclaves(std::vector<std::vector<int>>& G) {
const int m = G.size(), n = G.front().size(); const int m = G.size(), n = G.front().size();
std::vector<bool> vis(m * n);
auto setAs0 = [&](int x, int y) { auto setAs0 = [&](int x, int y) {
if (G[x][y] == 0) return 0; if (G[x][y] == 0) return 0;
std::queue<std::pair<int, int>> q; std::queue<std::pair<int, int>> q;
q.emplace(x, y); q.emplace(x, y);
int ret = 0; int ret = 0;
std::vector<bool> vis(m * n);
for (int nx, ny; !q.empty(); q.pop()) { for (int nx, ny; !q.empty(); q.pop()) {
auto&& [cx, cy] = q.front(); auto&& [cx, cy] = q.front();
G[cx][cy] = 0; G[cx][cy] = 0;