水洼数(Java)(dfs)

题解：

import java.util.Scanner;

public class Practice_水洼数 {
    static Scanner in = new Scanner(System.in);
    static int N;
    static int M;

    public static void main(String[] args) {
        N = in.nextInt();
        M = in.nextInt();
        char[][] arr = new char[N][M];
        for (int i = 0; i < N; i++) {
            arr[i] = in.next().toCharArray();
        }
        int cnt = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                if (arr[i][j] == 'W') {
                    dfs(arr, i, j);//处理完一个水洼数
                    cnt++;
                }
            }
        }
        System.out.println(cnt);
    }

    static void dfs(char[][] arr, int i, int j) {
        arr[i][j] = '.';
        for (int a = -1; a < 2; a++) {
            for (int b = -1; b < 2; b++) {
                if (a == 0 && b == 0) continue;
                if ((i + a) >= 0 && (i + a) <= N - 1 && (j + b) >= 0 && (j + b) <= M - 1) {
                    if (arr[i + a][j + b] == 'W') {
                        dfs(arr, i + a, j + b);
                    }
                }
            }
        }
    }

}
/*测试样例
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
*/