代码随想录 100. 岛屿的最大面积

孩子不懂事乱写的

于 2024-10-04 15:46:56 发布

阅读量100

点赞数 1

文章标签：深度优先算法图论

本文链接：https://blog.csdn.net/qq_53524614/article/details/142703776

版权

100. 岛屿的最大面积

#include<bits/stdc++.h>
using namespace std;
 
int dfs(vector<vector<int>>& mp, vector<vector<int>>& visit, int y, int x, int s){
    if (mp[y][x] == 0 || visit[y][x] == 1) return s;
    if (mp[y][x] == 1 && visit[y][x] == 0){
        s++;
        visit[y][x] = 1;
    }
    if (y > 0) s = dfs(mp, visit, y - 1, x, s);
    if (x > 0) s = dfs(mp, visit, y, x - 1, s);
    if (y < mp.size() - 1) s = dfs(mp, visit, y + 1, x, s);
    if (x < mp[0].size() - 1) s = dfs(mp, visit, y, x + 1, s);
    return s;
}
 
int main(){
    int n, m;
    cin >> n >> m;
    vector<vector<int>> mp(n, vector<int>(m, 0));
    vector<vector<int>> visit(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            cin >> mp[i][j];
        }
    }
    int mx = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            if (visit[i][j] == 0 && mp[i][j] == 1){
                mx = max(mx, dfs(mp, visit, i, j, 0));
            }
        }
    }
    cout << mx;
    return 0;
}

dfs的版本，与求取岛屿个数的代码差不多，只是在回溯过程中多了一个需要传递的面积信息，在主函数遍历地图时需要取最大值。

#include<bits/stdc++.h>
using namespace std;
int bfs(vector<vector<int>>& mp, vector<vector<int>>& visit, int y, int x){
    queue<pair<int, int>> q;
    q.push({y, x});
    int result = 0;
    visit[y][x] = 1;
    result++;
    while(!q.empty()){
        pair<int, int> tmp = q.front();
        int tmpy = tmp.first, tmpx = tmp.second;
        q.pop();
        if (tmpy > 0){
            if (mp[tmpy - 1][tmpx] == 1 && visit[tmpy - 1][tmpx] == 0){
                q.push({tmpy - 1, tmpx});
                visit[tmpy - 1][tmpx] = 1;
                result++;
            }
        }
        if (tmpx > 0){
            if (mp[tmpy][tmpx - 1] == 1 && visit[tmpy][tmpx - 1] == 0){
                q.push({tmpy, tmpx - 1});
                visit[tmpy][tmpx - 1] = 1;
                result++;
            }
        }
        if (tmpy < mp.size() - 1){
            if (mp[tmpy + 1][tmpx] == 1 && visit[tmpy + 1][tmpx] == 0){
                q.push({tmpy + 1, tmpx});
                visit[tmpy + 1][tmpx] = 1;
                result++;
            }
        }
        if (tmpx < mp[0].size() - 1){
            if (mp[tmpy][tmpx + 1] == 1 && visit[tmpy][tmpx + 1] == 0){
                q.push({tmpy, tmpx + 1});
                visit[tmpy][tmpx + 1] = 1;
                result++;
            }
        }
    }
    return result;
}

int main(){
    int n, m;
    cin >> n >> m;
    vector<vector<int>> mp(n, vector<int>(m, 0));
    vector<vector<int>> visit(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            cin >> mp[i][j];
        }
    }
    int mx = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            if (visit[i][j] == 0 && mp[i][j] == 1){
                mx = max(mx, bfs(mp, visit, i, j));
            }
        }
    }
    cout << mx;
    return 0;
}

用bfs的就更加接近求取岛屿数量的代码了，只需要在修改visit的同时计数即可。

代码随想录 100. 岛屿的最大面积