Lake Counting POJ - 2386 JAVA

I - Lake Counting

 POJ - 2386 

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

Hint

OUTPUT DETAILS: 

There are three ponds: one in the upper left, one in the lower left,and one along the right side.

45' 并查集 方向dir扩展  搜索（应该也可以BFS）
二维并查集降维更好用
初始p[i]=i好用

对每个w只需要遍历一次

注意要考虑单独一个W的情况，也是一个池塘！

结果联系并查集输出即可

import java.util.Scanner;

public class Main{
	static int p[];
	static int find(int x) {
		if(p[x]==x) return x;
		return p[x] = find(p[x]);
	}
	static void link(int x,int y) {
		int xx = find(x);
		int yy = find(y);
		if(xx>yy)	p[xx] = yy;
		else 	p[yy] = xx;
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		sc.nextLine();
		char[][] c = new char[n][m];
		String s = null;
		for (int i = 0; i < n; i++) {
			s = sc.nextLine();
			c[i] = s.toCharArray();
		}
		p = new int[n*m+5];
		for (int i = 0; i < p.length; i++) {
			p[i] = i;
		}
		int[][] dir = {{-1,0},{1,0},{0,1},{0,-1},{1,1},{-1,-1},{-1,1},{1,-1}};
		boolean vis[][] = new boolean[n][m];
		int ans[] = new int[n*m+5];
		int res=0;
		
		for (int i = 0; i < c.length; i++) {
			for (int j = 0; j < c[i].length; j++) {
				if(c[i][j]=='W') {
					vis[i][j]=true;
					boolean arround = false;	//一个单独池塘的情况
					for (int k = 0; k < dir.length; k++) {
						int xx = i+dir[k][0];
						int yy = j+dir[k][1];
						if(xx>=0&&xx<n&&yy>=0&&yy<m&&c[xx][yy]=='W') {
							arround = true;
							if(!vis[xx][yy])
								link(i*m+j,xx*m+yy);
						}
					}
					if(!arround) res++;
				}
			}
		}
		
		for (int i = 0; i < p.length; i++) {
			ans[find(p[i])]++;
		}
		for (int i = 0; i < ans.length; i++) {
			if(ans[i]>1) res++;
		}
		System.out.println(res);
	}
}