Leetcode 695. 岛屿的最大面积

JehanRio

已于 2023-09-22 14:31:00 修改

阅读量68

点赞数

分类专栏： Leetcode专栏文章标签： leetcode 深度优先算法

于 2023-06-28 14:13:00 首次发布

本文链接：https://blog.csdn.net/weixin_51322383/article/details/131435779

版权

Leetcode专栏专栏收录该内容

278 篇文章 0 订阅

订阅专栏

文章目录

题目
代码（首刷自解）
代码（9.22 二刷自解）

题目

在这里插入图片描述
Leetcode 695. 岛屿的最大面积

代码（首刷自解）

class Solution {
public:
    static constexpr int dx[4] = {0, 0, 1, -1};
    static constexpr int dy[4] = {1, -1, 0, 0};
    int res;
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[0].size();
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(i < 0 || j < 0 || i >= m || j >= n || grid[i][j] == 0)
                    continue;
                res = max(res, dfs(grid, i, j));
            }
        }
        return res;
    }
    int dfs(vector<vector<int>>& grid, int x, int y) {
        int m = grid.size(), n = grid[0].size();
        grid[x][y] = 0; // 该单位变为0
        int ans = 1;
        for(int i = 0; i < 4; i++) {
            int nx = x+dx[i], ny = y+dy[i];
            if(nx < 0 || ny < 0 || nx >= m || ny >= n || grid[nx][ny] == 0)
                continue;
            ans += dfs(grid, nx, ny);
        }
        return ans;
    }
};

代码（9.22 二刷自解）

class Solution {
public:
    int ans, cur;
    vector<vector<int>> dirs = {{1,0},{-1,0},{0,1},{0,-1}};
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[0].size();
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(!grid[i][j]) continue;
                cur = 1;
                dfs(grid, i, j, m, n);
                ans = max(cur, ans);
            }
        }
        return ans;
    }
    void dfs(vector<vector<int>>& grid, int x, int y, int m, int n) {
        grid[x][y] = 0;
        for(auto& dir : dirs) {
            int nx = dir[0]+x, ny = dir[1]+y;
            if(nx < 0 || ny < 0 || nx >= m || ny >= n || !grid[nx][ny]) continue;
            cur++;
            dfs(grid, nx, ny, m, n);
        }
    }
};