代码随想录算法训练营第五十一天 | 图论part02

99. 岛屿数量

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int dir[4][2] = {0, 1, 0, -1, -1, 0, 1, 0};

void dfs(const vector<vector<int>> &grid, 
    vector<vector<bool>> &visited, int x, int y) {
        for (int i = 0; i < 4; ++i) {
            int nextx = x + dir[i][1];
            int nexty = y + dir[i][0];
            if (nextx < 0 || nextx >= grid.size()
            || nexty < 0 || nexty >= grid[0].size())  continue;
            if (!visited[nextx][nexty] && grid[nextx][nexty] == 1) {
                visited[nextx][nexty] = true;
                dfs(grid, visited, nextx, nexty);
            }
        }
}

void bfs(const vector<vector<int>> &grid, 
    vector<vector<bool>> &visited, int x, int y) {
        queue<pair<int, int>> que;
        que.push({x, y});
        visited[x][y] = true;
        while (!que.empty()) {
            pair<int,int> cur = que.front(); que.pop();
            int curx = cur.first;
            int cury = cur.second;
            for (int i = 0; i < 4; ++i) {
                int nextx = curx + dir[i][1];
                int nexty = cury + dir[i][0];
                if (nextx < 0 || nextx >= grid.size()
                || nexty < 0 || nexty >= grid[0].size())  continue;
                if (!visited[nextx][nexty] && grid[nextx][nexty] == 1) {
                    visited[nextx][nexty] = true;
                    que.push({nextx, nexty});
                }
            }
        }
    }

int main() {
    int n, m, result = 0;
    cin >> n >> m;
    vector<vector<int>> grid(n, vector<int>(m, 0));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> grid[i][j];
        }
    }
    
    
    vector<vector<bool>> visited(n, vector<bool>(m, false));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (grid[i][j] == 1 && visited[i][j] == false) {
                result++;
                bfs(grid, visited, i, j);
            }
        }
    }
    cout << result;
}

100. 岛屿的最大面积

#include <vector>
#include <iostream>

using namespace std;

int dir[4][2] = {0, 1, 0, -1, -1, 0, 1, 0};
void dfs(const vector<vector<int>> &grid, 
    vector<vector<bool>> &visited, int x, int y, int &square) {
        for (int i = 0; i < 4; ++i) {
            int nextx = x + dir[i][1];
            int nexty = y + dir[i][0];
            if (nextx < 0 || nextx >= grid.size()
            || nexty < 0 || nexty >= grid[0].size())  continue;
            if (!visited[nextx][nexty] && grid[nextx][nexty] == 1) {
                visited[nextx][nexty] = true;
                square++;
                dfs(grid, visited, nextx, nexty, square);
            }
        }
}

int main() {
    int n, m, result = 0;
    cin >> n >> m;
    vector<vector<int>> grid(n, vector<int>(m, 0));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> grid[i][j];
        }
    }
    
    
    vector<vector<bool>> visited(n, vector<bool>(m, false));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (grid[i][j] == 1 && visited[i][j] == false) {
                int square = 1;
                visited[i][j] = true;
                dfs(grid, visited, i, j, square);
                result = max(result, square);
            }
        }
    }
    cout << result;
}