方法一:深度优先搜索
class Solution:
def dfs(self, grid, cur_i, cur_j):
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
ans = 1
for di, dj in [[1