# Count boundary edges for this cell dirs = [-1, 0, 1, 0, 0, -1, 0, 1] for k in range(0, 8, 2): newRow = row + dirs[k] newCol = col + dirs[k + 1] if newRow < 0 or newRow >= m or newCol < 0 or newCol >= n: # Out of bounds perim = perim + 1 elif grid[newRow][newCol] == 0: perim = perim + 1 elif not visited[newRow][newCol]: perim = perim + self.dfs(grid, visited, newRow, newCol, m, n) return perim1a:T65d,#include #include #include using namespace std; class Solution { public: int maxPerimeter(vector> grid) { int m = grid.size(); int n = grid[0].size(); vector> visited(m, vector(n, false)); int maxPerim = 0; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (grid[i][j] == 1 && !visited[i][j]) { int perim = dfs(grid, visited, i, j, m, n); if (perim > maxPerim) { maxPerim = perim; } } } } return maxPerim; } private: int dfs(vector>& grid, vector>& visited, int row, int col, int m, int n) { if (row < 0 || row >= m || col < 0 || col >= n || visited[row][col] || grid[row][col] == 0) { return 0; } visited[row][col] = true; int perim = 0; // Count boundary edges for this cell int dirs[] = {-1, 0, 1, 0, 0, -1, 0, 1}; for (int k = 0; k < 8; k = k + 2) { int newRow = row + dirs[k]; int newCol = col + dirs[k + 1]; if (newRow < 0 || newRow >= m || newCol < 0 || newCol >= n) { // Out of bounds perim = perim + 1; } else if (grid[newRow][newCol] == 0) { perim = perim + 1; } else if (!visited[newRow][

AI Assistant