LeetCode 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:

Example 2:


  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.


Supporting find and union operations, Union Find is the ideal data structure for this problem.

When (M[i][j] == 1 && i != j), simply use Union Find to merge two friend circles into one circle.

Video Tutorial

Java Solution

One Thought to “LeetCode 547. Friend Circles”

Leave a Reply

Your email address will not be published. Required fields are marked *