Lake Counting
题目描述
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.
样例输入
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
题目大意
给出N*M的矩形土地以及土地中的积水位置(用W表示),要求整块矩形土地中的连续积水的区域数量
解题思路
1.采用深度优先搜索,对于一块连续的积水区域用一次深度优先搜索就可以将所有的W区域置为.
2.记录总共要进行几次这样的深度优先搜索,就是矩形区域内的连续积水区域的数量
代码
1 |
|