Skip to content

Commit 18f0c75

Browse files
authored
Create find-friend-circle-number.py
1 parent f7c0522 commit 18f0c75

1 file changed

Lines changed: 23 additions & 0 deletions

File tree

find-friend-circle-number.py

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
class Solution:
2+
"""
3+
@param M: a matrix of integer
4+
@return: return an Integer
5+
"""
6+
def findCircleNum(self, M):
7+
# write your code here
8+
r = 0
9+
n = len(M)
10+
visited = [0] * n
11+
for i in range(n):
12+
if visited[i] == 0:
13+
r += 1
14+
self.dfs(M, i, visited)
15+
return r
16+
17+
def dfs(self, M, i, visited): # the ith student
18+
for j in range(len(M)):
19+
if (M[i][j] == 1) and (visited[j] == 0):
20+
visited[j] = 1
21+
self.dfs(M, j, visited)
22+
23+
# medium: https://www.lintcode.com/problem/1857

0 commit comments

Comments
 (0)