695. 岛屿的最大面积

DFS

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
    if (grid.empty() || grid[0].empty()) {
        return 0;
    }

    int res = 0;
    for (int r = 0; r < grid.size(); r++) {
        for (int c = 0; c < grid[0].size(); c++) {
            if (grid[r][c] == 1) {
                int a = area(grid, r, c);
                res = max(res, a);
            }
        }
    }
    return res;
}

int area(vector<vector<int>>& grid, int r, int c) {
    if (!(0 <= r && r < grid.size()
          && 0 <= c && c < grid[0].size())) {
        return 0;
    }
    if (grid[r][c] != 1) {
        return 0;
    }
    grid[r][c] = 2;
    return 1
        + area(grid, r - 1, c)
        + area(grid, r + 1, c)
        + area(grid, r, c - 1)
        + area(grid, r, c + 1);
}

};

BFS

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int rows = grid.size();
        if(rows == 0){
            return 0;
        }
        int lists = grid[0].size();

        int res = 0;
        int tmp = 0;
        for(int i=0;i<rows;i++){
            for(int j=0;j<lists;j++){
                if(grid[i][j]==1){
                    tmp = 0;
                    grid[i][j]=0;
                    queue<pair<int,int>> q;
                    q.push({i,j});
                    while(!q.empty()){
                        tmp++;
                        auto cur = q.front();
                        q.pop();
                        int x = cur.first;
                        int y = cur.second;
                        if(x>=1 && grid[x-1][y]==1){
                            q.push({x-1,y});
                            grid[x-1][y]=0;
                        }
                        if(x<rows-1 && grid[x+1][y]==1){
                            q.push({x+1,y});
                            grid[x+1][y]=0;
                        }
                        if(y>=1 && grid[x][y-1]==1){
                            q.push({x,y-1});
                            grid[x][y-1]=0;
                        }
                        if(y<lists-1 && grid[x][y+1]==1){
                            q.push({x,y+1});
                            grid[x][y+1]=0;
                        }
                    }
                }
                res = max(res,tmp);
            }
        }
        return res;
    }
};

作者：gedanke
链接：https://leetcode-cn.com/problems/max-area-of-island/solution/bfsyu-dfs-by-gedanke/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。