（Java实现）P1596 [USACO10OCT]Lake Counting S

题目描述
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.

由于近期的降雨，雨水汇集在农民约翰的田地不同的地方。我们用一个NxM(1<=N<=100;1<=M<=100)网格图表示。每个网格中有水(‘W’) 或是旱地(‘.’)。一个网格与其周围的八个网格相连，而一组相连的网格视为一个水坑。约翰想弄清楚他的田地已经形成了多少水坑。给出约翰田地的示意图，确定当中有多少水坑。

输入格式
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.

第1行：两个空格隔开的整数：N 和 M 第2行到第N+1行：每行M个字符，每个字符是’W’或’.'，它们表示网格图中的一排。字符之间没有空格。

输出格式
Line 1: The number of ponds in Farmer John’s field.

一行：水坑的数量

输入输出样例
输入 #1复制
10 12
W…WW.
.WWW…WWW
…WW…WW.
…WW.
…W…
…W…W…
.W.W…WW.
W.W.W…W.
.W.W…W.
…W…W.
输出 #1复制
3
说明/提示
OUTPUT DETAILS: There are three ponds: one in the upper left, one in the lower left, and one along the right side.
好多英文我也看不懂是啥，不过没事，不影响计划
看看思路，本题是一道典型的dfs或bfs题但因为我是菜鸡就只会了dfs一种方法，首先看这道题先要搞懂什么是水坑，题目的意思是只要这个坑上下左右等八个方向有一个跟另一个水坑相连，那么它们就算是一个整体，按一个计数，并且只有一个W的情况也算一个水坑，明白了这个接下来dfs的思路就清楚了话不多说上才艺（代码）

import java.util.*;
public class Main {
    static int n,m;
    static char[][] a=new char[101][101];//直接定义好范围
    static void dfs(int x,int y){
        a[x][y]='.';//路过了这个水坑后将它标记避免重复路径
        for(int i=-1;i<=1;i++){//这个我采用嵌套循环的方式模拟水坑的八个方向
            for(int j=-1;j<=1;j++){
                int dx=x+i;
                int dy=y+j;
                if(dx>n||dx<1||dy>m||dy<1||(a[dx][dy])=='.')//判断如果出界或者下一个字符不是水坑
                    continue;
                a[dx][dy]='.';
                    dfs(dx,dy);
            }
        }
    }
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int count=0;
        n=sc.nextInt();
        m=sc.nextInt();
        String s;

        for(int i=1;i<=n;i++) {
            s = sc.next();//用字符串直接读入
            for (int j = 1; j <= m; j++) {
                a[i][j] = s.charAt(j-1);//改下下标转成char类型的
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(a[i][j]=='W'){//判定只要是水坑就直接用dfs读完
                    dfs(i,j);
                    count++;
                }
            }
        }
        System.out.println(count);
    }
}