695. 岛屿的最大面积

695. 岛屿的最大面积

代码

class Solution {
public:
    //运用递归进行深度遍历
    //1. 首先找出递归边界，超出矩阵边界，所在位置为0
    int dfs(vector<vector<int> >& grid, int m,int n){
        if((m>=0 && m<grid.size()) && (n>=0 && n<grid[0].size()))
           {
               if(grid[m][n]==0) return 0;
                grid[m][n]=0;
                return 1+dfs(grid,m-1,n)+dfs(grid,m+1,n)+dfs(grid,m,n-1)+dfs(grid,m,n+1);
           } 
        else{
            return 0;
        }
    }
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int max_island=0;
        for(int i=0;i<grid.size();i++){
            for(int j=0;j<grid[0].size();j++){
                if(grid[i][j]==1)
                    max_island = max (max_island,dfs(grid,i,j));
            }
        }
        return max_island;
    }
};