岛屿的个数
给一个01矩阵,求不同的岛屿的个数。
0代表海,1代表岛,如果两个1相邻,那么这两个1属于同一个岛。我们只考虑上下左右为相邻。
class Solution {
public:
/**
* @param grid a boolean 2D matrix
* @return an integer
*/
void solve(vector<vector<bool>> &grid,vector<vector<int>> &visit,int row,int col,int x,int y)
{
visit[x][y] = 1;
if(grid[x][y] == 0)
return;
if(x+1<row && visit[x+1][y] == 0)
solve(grid,visit,row,col,x+1,y);
if(y+1<col && visit[x][y+1] == 0)
{
solve(grid,visit,row,col,x,y+1);
}
if(x-1>=0 && visit[x-1][y] == 0)
{
solve(grid,visit,row,col,x-1,y);
}
if(y-1>=0 && visit[x][y-1] == 0)
{
solve(grid,visit,row,col,x,y-1);
}
}
int numIslands(vector<vector<bool>>& grid) {
// Write your code here
int row = grid.size();
if(row == 0)
return 0;
int col = grid[0].size();
vector<int> v(col,0);
vector<vector<int>> visit(row,v);
int count = 0;
for(int i=0;i<row;i++)
{
for(int j=0;j<col;j++)
{
if(grid[i][j] == 1 && visit[i][j] == 0)
{
solve(grid,visit,row,col,i,j);
count ++;
}
}
}
return count;
}
};