https://www.nowcoder.com/practice/71cde4dee669475f94d8d38832374ada?tpId=196&tqId=40411&ru=/exam/oj
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param m int整型vector<vector<>>
* @return int整型
*/
bool vis[201] = {false};// 用来标记当前位置是否已经搜索过
int n;
int citys(vector<vector<int> >& m) {
n = m.size();
int ret = 0;
for (int i = 0; i < n; ++i) {
if (!vis[i]) {
++ret;
dfs(m, i);
}
}
return ret;
}
void dfs(vector<vector<int> >& m, int pos) {
vis[pos] = true;
for (int i = 0; i < n; ++i) {
if (!vis[i] && m[i][pos]) {
dfs(m, i);
}
}
}
};