200. Number of Islands
Given a 2d grid map of '1’s (land) and '0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
Example 1:
11110
11010
11000
00000
Answer: 1
Example 2:
11000
11000
00100
00011
Answer: 3
给定’1’(陆地)和’0’(水)的二维网格图,计算岛的数量。一个岛被水包围,并且通过水平或垂直连接相邻的陆地而形成。你可以假设网格的所有四个边都被水包围。
解题思路:
这道题典型的Floodfill算法原型题
class Solution {
public:
vector<vector<bool> > visited;
int d[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
int n,m;
bool InArry(int x,int y){
//cout<<x<<":"<<y;
//cout<<"result:"<<x>=0&&y>=0&&x<n&&y<m;
return x>=0 && y>=0 && x<m && y<n;
}
void dfs(vector<vector<char> >& grid,int x,int y){
visited[x][y]=true;
for(int i=0;i<4;i++){
int newx=x+d[i][0];
int newy=y+d[i][1];
//cout<< x;
if(InArry(newx,newy)&&!visited[newx][newy]&&grid[newx][newy]=='1'){
//cout<<x<<':'<<y<<endl;
dfs(grid,newx,newy);
}
}
return;
}
int numIslands(vector<vector<char> >& grid) {
m=grid.size();//行
if(m==0)
return 0;
n=grid[0].size();//列
visited=vector<vector<bool> >(m,vector<bool>(n,false));
int res=0;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
if(grid[i][j]=='1'&& !visited[i][j]){
//visited[i][j]=true;
//cout<<1;
res++;
dfs(grid,i,j);
}
return res;
}
};
结果:14ms,效果还行