POJ - 2386：Lake Counting

最新推荐文章于 2019-09-06 19:25:48 发布

wingrez

最新推荐文章于 2019-09-06 19:25:48 发布

阅读量526

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/80467065

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

这是一道关于计算农场田野中由'W'表示的水形成的湖泊数量的问题。农田是一个100x100的网格，每个单元格是水或干燥的土地。湖泊是相连的水单元格，相邻定义为上下左右和对角线方向。给定输入样例，输出样例表明有3个湖泊。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Lake Counting

来源：POJ

标签：

参考资料：

相似题目：

题目

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.