LeetCode:Friend Circles

题目链接：https://leetcode.com/problems/friend-circles/description/

解决方法：用递归方法去找一个朋友圈

代码如下：

     int findCircleNum(vector<vector<int>>& M) {
        vector<int> find, found;//find数组保存需要找的序号；found数组保存已经找过的序号；
        int circle = 0;
        for (int i = 0; i < M.size(); i++) {
            int isinfound = 0;
            if (found.size() > 0) { //查找还没找过的序号
                for (int j = 0; j < found.size(); j++) {
                    if (i == found[j]) {
                        isinfound = 1;
                    }
                }
            }
            if (!isinfound) {
                find.push_back(i);
                findCircle(M, find, found); //用递归查找一个朋友圈
                circle++;
            }
        }
        return circle;
    }

    void findCircle(vector<vector<int>>& M, vector<int>& find, vector<int>& found) {
        int num = find.back();
        found.push_back(num);
        find.pop_back();
        for (int i = 0; i < M.size(); i++) {
            if (M[num][i] == 1) {
                int isinfind = 0, isinfound = 0;
                for (int j = 0; j < find.size(); j++) {
                    if (i == find[j]) {
                        isinfind = 1;
                    }
                }
                for (int k = 0; k < found.size(); k++) {
                    if (i == found[k]) {
                        isinfound = 1;
                    }
                }
                if (!isinfind && !isinfound) {
                    find.push_back(i);
                }
            }
        }
        if (find.size() == 0) return;
        findCircle(M, find, found);
    }