字节跳动笔试—组织优化

题目描述：

解题思路：图的深度优先遍历

#include<bits/stdc++.h>
using namespace std;

void dfs(vector<vector<int>>& v,int i, int j,int& n) {
    if (i<0 || i>=n || j<0 || j>=n || (v[i][j] == 0)) return;
    v[i][j] = 0;
    dfs(v, i - 1, j, n);
    dfs(v, i + 1, j, n);
    dfs(v, i, j-1, n);
    dfs(v, i, j+1, n);
}
int main()
{
    int n;
    cin >> n;
    vector<vector<int>> v(n, vector<int>(n));
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            cin >> v[i][j];
    int cnt = 0;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j) {
            if (v[i][j]) {
                ++cnt;
                dfs(v, i,  j, n);
            }       
        }
    cout << cnt << endl;
    return 0;
}