LeetCode in Python 547. Friend Circles

There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, then A is an indirect friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.

Given a N*N matrix M representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are direct friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.

Example 1:

Input: 
[[1,1,0],
 [1,1,0],
 [0,0,1]]
Output: 2
Explanation:The 0th and 1st students are direct friends, so they are in a friend circle. 
The 2nd student himself is in a friend circle. So return 2.

 

Example 2:

Input: 
[[1,1,0],
 [1,1,1],
 [0,1,1]]
Output: 1
Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends, 
so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.

 

Note:

1. N is in range [1,200].
2. M[i][i] = 1 for all students.
3. If M[i][j] = 1, then M[j][i] = 1.

Solution:

class Solution(object):
    def findCircleNum(self, M):
        """
        :type M: List[List[int]]
        :rtype: int
        """
        #map: key:# value:group#
        #list[i] => i-th element's group#
        rows = len(M)
        groupMap = [i for i in range(rows)]
        
        def dfs(group, index):
            groupMap[index] = group
            for col, friend in enumerate(M[index]):
                if col != index and friend and groupMap[col] == col:
                    dfs(group, col)
            
        for row in range(rows):
            if groupMap[row] != row: continue
            dfs(row, row)
                    
        return len(set(groupMap))

很有名的dfs题朋友圈，直接朋友指M[i][j]=1，间接朋友指M[i][j]=0但是可以i和j可连通。思路是序号从0开始，找到它可达的所有朋友（类似连通图），这些人为同一group，以list代替map表示第i个元素对应的group number，到最后以它取set，其长度即朋友圈的个数。注意需要判断groupMap[col]==col，因为标记的过程只有一次，找到对应的group之后不再更新。比如j=5时，所有的M[0-4][j]=0，但M[5][0]=1时，不用再更新groupMap[0]

转载于:https://www.cnblogs.com/lowkeysingsing/p/11204467.html