LeetCode--695. Max Area of Island

Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.

Find the maximum area of an island in the given 2D array.(If there is no island, the maximum area is 0.)

Example 1:

[[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]]

Given the above grid, return 6.Note the answer is not 11, because the island must be connected 4-directionally.

Example 2:

[[0,0,0,0,0,0,0,0]]

Given the above grid, return 0.

Note:The length of each dimension in the given grid does not exceed 50.

---

题意：给一个二维矩阵表示一个岛屿，其中1表示陆地，0表示海水，问最大的连续陆地面积是多少，（只要上下左右有一个方向联通就定义为连续）。

思路：

1.使用DFS，先写一个统计单个连通网最大陆地面积的函数getSum，然后递归调用，最后输出最大值即可。

2.刚开始我单独定义一个bool型ht[]函数用来表示是否访问，但递归爆栈，内存超限，遂改为每访问完一个陆地点，就置为0，通过。

参考代码：

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int m=grid.size(),n=grid[0].size(),mx=0;
        for(int i=0;i<m;++i){
            for(int j=0;j<n;++j){
                int t=0;
                if(grid[i][j]){
                    getSum(i,j,m,n,t,grid);
                }
                mx=max(mx,t);
            }
        }
        return mx;
    }
    void getSum(int i,int j,int m,int n,int& cnt,vector<vector<int>>& grid){
        if(!(i>=0&&i<m)||!(j>=0&&j<n)||!grid[i][j]) return;
        cnt++;
        grid[i][j]=0;
        getSum(i-1,j,m,n,cnt,grid);
        getSum(i+1,j,m,n,cnt,grid);
        getSum(i,j-1,m,n,cnt,grid);
        getSum(i,j+1,m,n,cnt,grid);
    }
};