Lake Counting
Lake counting 问题
思路:深度优先遍历
举例:
输入:10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.
输出:3
#include <bits/stdc++.h>
using namespace std;
char field[1005][1005];
int N,M;
void dfs(int x,int y){
field[x][y]='.';//将其初始化为.排除它本身
for(int dx=-1;dx<=1;dx++){
for(int dy=-1;dy<=1;dy++){
int nx=x+dx , ny=y+dy;//八个方向依次进行深度遍历
if(0<=nx && nx<N &&0<=ny && ny<M && field[nx][ny]=='w') dfs(nx,ny);
}
}
}
int main ()
{int i,j,res=0;
scanf("%d %d",&N,&M)//输入几行几列
memset(field,'0',sizeof(field));//将数组清零
res=0;
for(i=0;i<N;i++){
scanf("%s",field[i]);
}
for(i=0;i<N;i++){
for(j=0;j<M;j++){
if(field[i][j]=='w'){
dfs(i,j);
res++;//每次遍历结束一次结果自加一次
}
}
cout<<res<<endl;
}
return 0;
}