省份的数量

class Solution {public:int find(vectorint father,int x){if(father[x]!x)father[x] find(father,father[x]);//如果father[x]不是源头继续往前找return father[x];}void un(vectorint father,int x,int y){father[find(father,x)]find(father,y);//y的源头等于x的源头}int findCircleNum(vectorvectorint isConnected) {int nisConnected.size(),misConnected[0].size();vectorintfather(n);for(int i0;in;i){father[i]i;}for(int i0;in;i){for(int j0;jm;j){if(isConnected[i][j]1)un(father,i,j);//合并}}int res0;for(int i0;in;i)if(father[i]i)res;return res;}};