POJ2386(DFS)

POJ2386(DFS)

---

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.

Sample Input

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

Sample Output

3

题意

八连通的’W’为一片水洼，问总共有多少片水洼。

思路

深度优先搜索(DFS)

代码

import java.util.Scanner;

public class LakeCounting {

    int[][] map = new int[105][105];

    int[] xs = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
    int[] ys = {-1, -1, -1, 0, 0, 0, 1, 1, 1};

    int count = 0;

    public void dfs(int x, int y) {
        if (this.map[x][y] == 1) {
            this.map[x][y] = 0;
        }

        for (int i = 0; i < this.xs.length; i++) {
            if (this.map[x + xs[i]][y + ys[i]] == 1) {
                dfs(x + xs[i], y + ys[i]);
            }
        }

    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        LakeCounting lc = new LakeCounting();
        int n = sc.nextInt();
        int m = sc.nextInt();
        for (int i = 1; i <= n; i++) {
            String str = sc.next();
            for (int j = 1; j <= m; j++) {
                if (str.charAt(j - 1) == 'W') {
                    lc.map[i][j] = 1;
                }
            }
        }
        sc.close();

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (lc.map[i][j] == 1) {
                    lc.count++;
                    lc.dfs(i,j);
                }
            }
        }
        System.out.println(lc.count);
    }
}