dfs扫描不同节点,有的话就设置为visited,注意dfs里面是dfs(i)
class Solution:
def findCircleNum(self, isConnected: List[List[int]]) -> int:
n=len(isConnected)
used=[0 for _ in range(n)]
ans=0
def dfs(index):
used[index]=1
for i in range(n):
if i!=index and used[i]==0 and isConnected[index][i]==1:
dfs(i)
for i in range(n):
if used[i]==0:
dfs(i)#注意这里是dfs(i),不是0
ans+=1
return ans