leetcode 200. 岛屿数量(并查集)

	class findunion{
  public:
  vectorfather;
  findunion(const int &num)
  {
    for(int i=0;i>& grid) {
       if(!grid.size()||!grid[0].size())return 0;
       n=grid.size(),m=grid[0].size();
       findunion F(n*m);
       int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
       
     
      for(int i=0;i=0&&a=0&&b