Skip to content

Commit 80d161a

Browse files
authored
Create 547. Number of Provinces LeetCode
1 parent c73d981 commit 80d161a

File tree

1 file changed

+45
-0
lines changed

1 file changed

+45
-0
lines changed
+45
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
class Solution {
2+
3+
private :
4+
void dfs(int node , vector<int> adjLs[] , vector<int> &visited)
5+
{
6+
visited[node] = 1 ;
7+
for(auto it : adjLs[node])
8+
{
9+
if(!visited[it])
10+
{
11+
dfs(it , adjLs ,visited );
12+
}
13+
}
14+
}
15+
public:
16+
int findCircleNum(vector<vector<int>>& isConnected) {
17+
int v = isConnected.size() ;
18+
vector<int> visited(v , 0);
19+
vector<int> adjLs[v];
20+
21+
// converting adjency matrix to list
22+
for(int i = 0 ; i < v ; i++)
23+
{
24+
for(int j = 0 ; j < v ; j++)
25+
{
26+
if(isConnected[i][j] == 1 && i != j)
27+
{
28+
adjLs[i].push_back(j);
29+
adjLs[j].push_back(i);
30+
}
31+
}
32+
}
33+
34+
int count = 0 ;
35+
for(int i = 0 ; i < v ; i++)
36+
{
37+
if(!visited[i])
38+
{
39+
count++;
40+
dfs(i , adjLs , visited);
41+
}
42+
}
43+
return count ;
44+
}
45+
};

0 commit comments

Comments
 (0)