Friend Circle

LeetCode Q 547 - Friend Circle

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:
N is in range [1,200].
M[i][i] = 1 for all students.
If M[i][j] = 1, then M[j][i] = 1.

Solution

Solution 1 : DFS

We don’t need an addition array to record if we have visited a node, we can set M[i][i] = 2 to indiate that.

Code:

public int findCircleNum(int[][] M) {
	int count = 0;
	for (int i = 0; i < M.length; i++) {
		if (M[i][i] == 1) {
			count++;
			dfs(M, i);
		}
	}
	return count;
} 

private void dfs(int[][] M, int curr) {
	M[curr][curr] = 2;
	for (int i = 0; i < M.length; i++) {
		if (M[i][curr] == 1 && M[i][i] == 1)
			dfs(M, i);
	}
}

Solution 2 : BFS

Code:

public int findCircleNum(int[][] M) {
	int count = 0;
	for (int i = 0; i < M.length; i++) {
		if (M[i][i] == 1) {
			count++;
			bfs(M, i);
		}
	}
	return count;
} 

private void dfs(int[][] M, int student) {
	Queue<Integer> que = new LinkedList<>();
	que.offer(student);
	while (!que.isEmpty()) {
		int curr = que.poll();
		M[curr][curr] = 2;
		for (int i = 0; i < M.length; i++) {
			if (M[i][i] == 1 && M[i][curr] == 1)
				que.offer(i);
		}
	}
}

Solution 3 : Disjoint Set

Code:

class UnionFindSet {
	int[] parent;
	int count;

	public UnionFindSet (int size) {
		this.parent = new int[size];
		for (int i = 0; i < size; i++) 
			this.parent[i] = i;
	}

	public int find (int x) {
		if (parent[x] != x) 
			parent[x] = find(parent[x]);
		return parent[x];
	}

	public void union (int x, int y) {
		int px = find(x), py = find(y);
		if (px != py) {
			parent[px] = py;
			count--;
		}
	}
}

public int findCircleNum(int[][] M) {
	int N = M.length;
	UnionFindSet ufs = new UnionFindSet(N);
	ufs.count = N;

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < i; j++) {
			if (M[i][j] == 1) {
				if (ufs.find(i) != ufs.find(j))
					ufs.union(i, j);
			}
		}
	}

	return ufs.count;
}