csharp
展开代码
from typing import List
class Solution:
    def dfs(self, grid, cur_i, cur_j) -> int:
        # 超出边界 or 不是陆地  程序靠此结束
        if cur_i < 0 or cur_j < 0 or cur_i == len(grid) or cur_j == len(grid[0]) or grid[cur_i][cur_j] != 1:
            return 0
        grid[cur_i][cur_j] = 0  # 访问过的设置为0,全局的
        ans = 1  # 访问过的陆地，1块
        for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0]]: # 四个方向
            next_i, next_j = cur_i + di, cur_j + dj
            ans += self.dfs(grid, next_i, next_j) # 这个位置dfs
        return ans
    def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
        ans = 0
        for i, l in enumerate(grid):
            for j, n in enumerate(l): # i,j 遍历每一个位置,在每个位置dfs搜索最大面积
                ans = max(self.dfs(grid, i, j), ans)
        return ans
s=Solution()
print(s.maxAreaOfIsland([[0,0,1,0,0,0,0,1,0,0,0,0,0],
 [0,0,0,0,0,0,0,1,1,1,0,0,0],
 [0,1,1,0,1,0,0,0,0,0,0,0,0],
 [0,1,0,0,1,1,0,0,1,0,1,0,0],
 [0,1,0,0,1,1,0,0,1,1,1,0,0],
 [0,0,0,0,0,0,0,0,0,0,1,0,0],
 [0,0,0,0,0,0,0,1,1,1,0,0,0],
 [0,0,0,0,0,0,0,1,1,0,0,0,0]]))