leetcode -- 695. Max Area of Island

最新推荐文章于 2022-06-12 10:27:55 发布

名字被猪吃掉了

最新推荐文章于 2022-06-12 10:27:55 发布

阅读量121

点赞数

分类专栏：反复看 leetCode 文章标签：深度优先搜索

本文链接：https://blog.csdn.net/hhuzxx/article/details/94827822

版权

反复看同时被 2 个专栏收录

110 篇文章 1 订阅

订阅专栏

leetCode

64 篇文章 0 订阅

订阅专栏

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/max-area-of-island
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

我的思路：

1、找连通块中的面积最大者

2、dfs深搜，vis标记已访问，当还未访问并且是岛屿1时进行深搜，探索连通块，找出面积

3、学到一点：加引用可以把area的值带着，不至于返回时回退到上一步的area

class Solution {
public:
    int maxArea = 0;
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int row = grid.size();  //行
        if(row == 0) return 0;
        int col = grid[0].size();  //列
        vector<vector<bool>> vis(row, vector<bool>(col, false)); //访问数组
        for(int i = 0; i < row; i++){
            for(int j = 0; j < col; j++){
                if(vis[i][j] == false && grid[i][j] == 1){
                    int sum = 0;
                    dfs(i,j,vis,grid,row, col, sum);
                }
            }
        }
        return maxArea;
    }
    
    void dfs(int x, int y, vector<vector<bool>>& vis, vector<vector<int>>& grid, int row, int col, int& area){
        
        if(x < 0 || x >= row || y < 0 || y >= col || vis[x][y] == true || grid[x][y] == 0){
            if(area > maxArea){
                maxArea = area;
            }
            return;
        }
        vis[x][y] = true;
        area += 1;
        dfs(x+1,y,vis,grid,row,col,area);
        dfs(x-1,y,vis,grid,row,col,area);
        dfs(x,y+1,vis,grid,row,col,area);
        dfs(x,y-1,vis,grid,row,col,area);
        
    }
};