这篇博客介绍了一种解决农田湖塘计数问题的方法，通过深度优先搜索（DFS）来确定由水（'W'）组成的连通区域的数量。给定一个N x M的矩阵表示农田，其中'.'表示旱地，'W'表示水，任务是找出所有相连的水区域（即池塘）。博客提供了输入输出示例，并给出了具体的解题思路和代码实现。
Problem : Lake Counting
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.
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
