岛屿695

695. 岛屿的最大面积
     给定一个包含了一些 0 和 1 的非空二维数组 grid 。

一个 岛屿 是由一些相邻的 1 (代表土地) 构成的组合，这里的「相邻」要求两个 1 必须在水平或者竖直方向上相邻。你可以假设 grid 的四个边缘都被 0（代表水）包围着。

找到给定的二维数组中最大的岛屿面积。(如果没有岛屿，则返回面积为 0 。)

示例 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]]
对于上面这个给定矩阵应返回 6。注意答案不应该是 11 ，因为岛屿只能包含水平或垂直的四个方向的 1 。

示例 2:

[[0,0,0,0,0,0,0,0]]
对于上面这个给定的矩阵, 返回 0。

• 非递归

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int m = grid.size();  int n = grid[0].size();
        int count = 0; int area = 0;
        for(int i = 0; i < m; ++i)
        {
            for(int j = 0; j < n; ++j)
            {
                if(grid[i][j])
                {
                    count = 1;
                    grid[i][j] = 0;
                    stack<pair<int,int>>s1;
                    s1.push({i,j});

                    while(!s1.empty())
                    {
                        auto [r,c] = s1.top();
                        s1.pop();

                        vector<int>vec{-1,0,1,0,-1};

                        for(int k = 0; k < 4; ++k)
                        {
                            int x = r + vec[k]; int y = c + vec[k+1];
                            if(x >= 0 && y >= 0 && x < m && y < n && grid[x][y] == 1)
                            {
                                grid[x][y] = 0;
                                count++;
                                s1.push({x,y});
                            }
                        }
                    }
                }
                area = max(area,count);
            }
        }
        return area;
    }
};

• 递归1

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int maxNum = 0;
        for(int i = 0; i < grid.size(); ++i)
        {
            for(int j = 0; j < grid[0].size(); ++j)
            {
                maxNum = max(maxNum,DFS(grid,i,j));
            }
        }
        return maxNum;
    }

    int DFS(vector<vector<int>>& grid,int i,int j)
    {
        if(i < 0 || i == grid.size() || j < 0 || j == grid[0].size() || grid[i][j] == 0)
        {
            return 0;
        }

        int count = 1;
        grid[i][j] = 0;
        vector<int>vec{-1,0,1,0,-1};

        for(int k = 0; k < 4; ++k)
        {
            int x = i + vec[k];  int y = j+vec[k+1];

            count += DFS(grid,x,y);
        }

        return count;
    }
};

• 递归2，很好的代码

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int maxNum = 0;
        for(int i = 0; i < grid.size(); ++i)
        {
            for(int j = 0; j < grid[0].size(); ++j)
            {
                maxNum = max(maxNum,DFS(grid,i,j));
            }
        }
        return maxNum;
    }

    int DFS(vector<vector<int>>& grid,int i,int j)
    {
        if(i < 0 || i == grid.size() || j < 0 || j == grid[0].size() || grid[i][j] == 0)
        {
            return 0;
        }
        grid[i][j] = 0;
        
        return 1 + DFS(grid,i-1,j) + DFS(grid,i,j-1) + DFS(grid,i+1,j) + DFS(grid,i,j+1);   
    }
};