原题:
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.
其实考察的就是图的遍历而已。
代码如下:
int findCircleNum(int** M, int MRowSize, int MColSize) {
int* flag;
flag=(int*)malloc(sizeof(int)*MColSize);
memset(flag,0,sizeof(int)*MColSize);
int result=0;
void setCircle(int**,int ,int ,int* );
for(int n=0;n<MRowSize;n++)
{
if(*(flag+n)!=0)
continue;
setCircle(M,MColSize,n,flag);
result++;
}
return result;
}
void setCircle(int** M,int MColSize,int n,int* flag)
{
if(*(flag+n)==1)
return;
*(flag+n)=1;
for(int m=0;m<MColSize;m++)
{
if(*(*(M+n)+m)==1)
{
if(*(flag+m)==0)
setCircle(M,MColSize,m,flag);
}
}
}
开始在标注的问题上浪费了好多时间。。。
怎么选数据结构还是一门技巧啊。