10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T45f,class Solution: def closedIsland(self, grid: List[List[int]]) -> int: m = len(grid) n = len(grid[0]) visit = [[False] * n for _ in range(m)] count = 0 for i in range(m): for j in range(n): if grid[i][j] == 0 and not visit[i][j] and self.bfs(i, j, m, n, grid, visit): count += 1 return count def bfs(self, x: int, y: int, m: int, n: int, grid: List[List[int]], visit: List[List[bool]]) -> bool: q = deque([(x, y)]) visit[x][y] = True is_closed = True dirx = [0, 1, 0, -1] diry = [-1, 0, 1, 0] while q: r, c = q.popleft() for i in range(4): nr, nc = r + dirx[i], c + diry[i] if nr < 0 or nr >= m or nc < 0 or nc >= n: is_closed = False elif grid[nr][nc] == 0 and not visit[nr][nc]: visit[nr][nc] = True q.append((nr, nc)) return is_closed13:T427,class Solution { public int closedIsland(int[][] grid) { int m = grid.length; int n = grid[0].length; boolean[][] visit = new boolean[m][n]; int count = 0; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (grid[i][j] == 0 && !visit[i][j] && dfs(i, j, m, n, grid, visit)) { count++; } } } return count; } private boolean dfs(int x, int y, int m, int n, int[][] grid, boolean[][] visit) { if (x < 0 || x >= m || y < 0 || y >= n) return false; if (grid[x][y] == 1 || visit[x][y]) return true; visit[x][y] = true; boolean isClosed = true; int[] dirx = {0, 1, 0, -1}; int[] diry = {-1, 0, 1, 0}; for (int i = 0; i < 4; i++) { int r = x + dirx[i]; int c = y + diry[i]; if (!dfs(r, c, m, n, grid, visit)) { isClosed = false; } } return isClosed; } }14:T45b,class Solution { public: int closedIsland(vector>& grid) { int m = grid.size(); int n = grid[0].size(); vector> visit(m, vector(n, false)); int count = 0; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (grid[i][j] == 0 && !visit[i][j] && dfs(i, j, m, n, grid, visit)) { count++; } } } return count; } bool dfs(int x, int y, int m, int n, vector>& grid, vector>& visit) { if (x < 0 || x >= m || y < 0 || y >= n) return false; if (grid[x][y] == 1 || visit[x][y]) return true; visit[x][y] = true; bool isClosed = true; vector dirx = {0, 1, 0, -1}; vector diry = {-1, 0, 1, 0}; for (int i = 0; i < 4; i++) { int r = x + dirx[i]; int c = y + diry[i]; if (!dfs(r, c, m, n, grid, visit)) { isClosed = false; } } return isClosed; } };

Time Complexity

Space Complexity