题目描述
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.
输入格式
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.
输出格式
Line 1: The number of ponds in Farmer John's field.
题意翻译
由于近期的降雨,雨水汇集在农民约翰的田地不同的地方。我们用一个 N\times M(1\times N\times 100, 1\leq M\leq 100)N×M(1×N×100,1≤M≤100) 的网格图表示。每个网格中有水(W
) 或是旱地(.
)。一个网格与其周围的八个网格相连,而一组相连的网格视为一个水坑。约翰想弄清楚他的田地已经形成了多少水坑。给出约翰田地的示意图,确定当中有多少水坑。
输入第 11 行:两个空格隔开的整数:NN 和 MM。
第 22 行到第 N+1N+1 行:每行 MM 个字符,每个字符是 W
或 .
,它们表示网格图中的一排。字符之间没有空格。
输出一行,表示水坑的数量。
输入输出样例
输入
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
说明/提示
OUTPUT DETAILS: There are three ponds: one in the upper left, one in the lower left, and one along the right side.
#include<stdio.h>
int n,m;
char a[1001][1001];
void dfs(int x, int y)//深度遍历
{
int i,j;
int dx = 0,dy = 0;
a[x][y] = '.';//用过就销毁
for(i = -1; i <= 1; i++)
{
for(j = -1; j <= 1; j++)
{
dx = x+i;
dy = y+j;
if(dx>=0 && dx<n && dy>=0 && dy<m && a[dx][dy]=='W')
{
dfs(dx,dy);//递归会帮你朝四面八方去变为'.',也就是帮你遍历
} //完这个水坑
}
}
}
int main()
{
int i,j;
scanf("%d %d",&n,&m);
int ans = 0;
for(i = 0; i < n; i++)//遍历输入行
{
scanf("%s",a[i]);
}
for(i = 0; i < n; i++)
{
for(j = 0; j < m; j++)
{
if(a[i][j]=='W')
{
dfs(i,j);
ans++;
}
}
}
printf("%d",ans);
return 0;
}