Skip to content

Commit 6dca29d

Browse files
authored
Create number-of-closed-islands.cpp
1 parent 3394ebd commit 6dca29d

File tree

1 file changed

+40
-0
lines changed

1 file changed

+40
-0
lines changed

C++/number-of-closed-islands.cpp

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
// Time: O(m * n)
2+
// Space: O(1)
3+
4+
class Solution {
5+
public:
6+
int closedIsland(vector<vector<int>>& grid) {
7+
for (int j = 0; j < grid[0].size(); ++j) {
8+
fill(&grid, 0, j);
9+
fill(&grid, grid.size() - 1, j);
10+
}
11+
for (int i = 1; i + 1 < grid.size(); ++i) {
12+
fill(&grid, i, 0);
13+
fill(&grid, i, grid[0].size() - 1);
14+
}
15+
int result = 0;
16+
for (int i = 1; i + 1 < grid.size(); ++i) {
17+
for (int j = 1; j + 1 < grid[0].size(); ++j) {
18+
if (fill(&grid, i, j)) {
19+
++result;
20+
}
21+
}
22+
}
23+
return result;
24+
}
25+
26+
private:
27+
bool fill(vector<vector<int>> *grid, int i, int j) {
28+
static vector<pair<int, int>> directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
29+
if (i < 0 || j < 0 ||
30+
i >= grid->size() || j >= (*grid)[i].size() ||
31+
(*grid)[i][j]) {
32+
return false;
33+
}
34+
(*grid)[i][j] = 1;
35+
for (const auto& [dx, dy] : directions) {
36+
fill(grid, i + dx, j + dy);
37+
}
38+
return true;
39+
}
40+
};

0 commit comments

Comments
 (0)