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 08:51:41 +08:00
parent 4bfff21cdf
commit 476514de0b
Signed by: Eatswap
GPG Key ID: BE661106A1F3FA0B
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
cpp/2304/230406.cpp
View File

@ -20,6 +20,7 @@ public:
int Solution::closedIsland(std::vector<std::vector<int>>& G) {
const int m = G.size(), n = G.front().size();
std::vector<bool> vis(m * n);
auto setAs1 = [&](int x, int y) {
if (G[x][y]) return 0;
std::queue<std::pair<int, int>> q;
@ -30,8 +31,10 @@ int Solution::closedIsland(std::vector<std::vector<int>>& G) {
for (int i = 0; i < 4; ++i) {
nx = cx + dX[i];
ny = cy + dY[i];
if (nx >= 0 && nx < m && ny >= 0 && ny < n && G[nx][ny] == 0)
if (nx >= 0 && nx < m && ny >= 0 && ny < n && G[nx][ny] == 0 && !vis[nx * n + ny]) {
q.emplace(nx, ny);
vis[nx * n + ny] = true;
}
}
}
return 1;