Description
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John's field, determine how many ponds he has.
Input
Line 1: Two space-separated integers: N and M
Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.
Output
Line 1: The number of ponds in Farmer John's field.
Sample Input
10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.ample Output
3
Hint
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
一.DFS(深度优先搜索算法)-用递归实现
#include<stdio.h>
int N,M;
int a[101][101];
int judge(int x,int y)
{
int k[8]={0,0,-1,1,-1,1,-1,1};
int l[8]={1,-1,0,0,-1,-1,1,1};
a[x][y]='.';
for(int n=0;n<8;n++){
int nx=x+k[n];
int ny=y+l[n];
if(nx>=0&&nx<N&&ny>=0&&ny<M&&a[nx][ny]=='w'){
judge(nx,ny);
}
}
return 0;
}
int main()
{
int i,j,x,y;
int sum=0;
scanf("%d %d",&N,&M);
for(i=0;i<N;i++){
for(j=0;j<M;j++){
scanf("%s",&a[i][j]);
}
}
for(x=0;x<N;x++){
for(y=0;y<M;y++){
if(a[x][y]=='w'){
judge(x,y);
sum++;
}
}
}
printf("%d",sum);
return 0;
}
(未完待续。。。)