朋友圈问题

做了阿里的笔试，第一题是朋友圈问题，发现是leetcoed547。具体问题如下：

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 i_th and j_th 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

 

这是一道图连通性问题。具体思路是设置一个标志位数组，查看每个元素是否遍历过，然后遍历所有元素。过程如下：

1、遍历第n个元素，判断第n个元素和其他所有元素是否有关系

2、如果有关系，通过标志数组判断该元素是否之前遍历过。

3、如果遍历过则跳过，如果没有则标记该元素，再进入递归，查看该元素和其他元素的关系情况

4、一旦n返回，证明所有n元素的朋友圈都已经标记过

5、遍历第n+1个元素

 

具体代码如下：

1. public class Solution {  
2.     public void dfs(int[][] M, int[] visited, int i) {  
3.         for (int j = 0; j < M.length; j++) {  
4.             if (M[i][j] == 1 && visited[j] == 0) {  
5.                 visited[j] = 1;  
6.                 dfs(M, visited, j);  
7.             }  
8.         }  
9.     }  
10.     public int findCircleNum(int[][] M) {  
11.         int[] visited = new int[M.length];  
12.         int count = 0;  
13.         for (int i = 0; i < M.length; i++) {  
14.             if (visited[i] == 0) {  
15.                 dfs(M, visited, i);  
16.                 count++;  
17.             }  
18.         }  
19.         return count;  
20.     }  
21. }