在这个二维数组中找到最大的区域

def findMaxArea(grid):
    if not grid or not grid[0]:
        return 0
    
    rows = len(grid)
    cols = len(grid[0])
    maxArea = 0
    
    def dfs(i, j):
        if i < 0 or i >= rows or j < 0 or j >= cols or grid[i][j] != 1:
            return 0
        
        grid[i][j] = 0
        area = 1
        area += dfs(i-1, j)
        area += dfs(i+1, j)
        area += dfs(i, j-1)
        area += dfs(i, j+1)
        
        return area
    
    for i in range(rows):
        for j in range(cols):
            if grid[i][j] == 1:
                maxArea = max(maxArea, dfs(i, j))
    
    return maxArea