【leetcode 深度优先搜索 C++】695. Max Area of Island

最新推荐文章于 2024-10-16 00:00:43 发布

笨比master

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量99

点赞数

分类专栏： leetcode 文章标签： dfs 算法 leetcode

本文链接：https://blog.csdn.net/m0_37454852/article/details/113783726

版权

leetcode 专栏收录该内容

288 篇文章 0 订阅

订阅专栏

695. Max Area of Island

在这里插入图片描述

class Solution {
public:
    int H, W;
    int dfs(int y, int x, vector<vector<int>>& grid, vector<vector<bool>>& visited) {
        if(y < 0 || y >= H || x < 0 || x >= W || visited[y][x] || !grid[y][x]) return 0;
        visited[y][x] = true;
        return dfs(y-1, x, grid, visited) + dfs(y+1, x, grid, visited) + dfs(y, x-1, grid, visited) + dfs(y, x+1, grid, visited) + 1;
    }
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        H = grid.size(), W = grid[0].size();
        vector<vector<bool> > visited(H, vector<bool>(W, false));
        int maximum = 0;
        for(int y = 0; y < H; y++) {
            for(int x = 0; x < W; x++) {
                if(!visited[y][x] && grid[y][x]) maximum = max(maximum, dfs(y, x, grid, visited));
            }
        }
        return maximum;
    }
};