dfs+染色法 每次搜索到的岛屿就将岛屿淹没 class Solution { public: const int dx[4]={0,0,1,-1}; const int dy[4]={1,-1,0,0}; int ma=0; void dfs(vector<vector<int> >& grid,int x,int y,int& s){ s+=1; ...