695岛屿最大面积leetcode深度优先搜索

遍历每个点&＃xff0c;在每个点就是使用深度优先搜索&＃xff0c;将自身变为0同时计算周围四个点&＃xff0c;方法做完后发现与题解1相同复杂度为

class Solution:def dfs_single(self,grid,cur_x,cur_y):if cur_x<0 or cur_y<0 or cur_x>len(grid)-1 or cur_y>len(grid[0])-1 or grid[cur_x][cur_y]&＃61;&＃61;0 :return 0ans&＃61;1grid[cur_x][cur_y]&＃61;0directon&＃61;[(1,0),(-1,0),(0,1),(0,-1)]for dx,dy in directon:next_x,next_y&＃61;cur_x&＃43;dx,cur_y&＃43;dyans&＃43;&＃61;self.dfs_single(grid,next_x,next_y)return ansdef maxAreaOfIsland(self, grid: List[List[int]]) -> int:max_island&＃61;0for i in range(len(grid)):for j in range(len(grid[0])):max_island&＃61;max(self.dfs_single(grid,i,j),max_island)return max_island