poj java_POJ 2386 java实现

描述：

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.

1 importjava.util.Scanner;2 public classMain {3

4

5 private static char filed[][]=new char[100][100];6 public static void search(int x,int y,int n,intm){7 filed[x][y]=‘.‘;8 for(int i=-1;i<2;i++)9 for(int j=-1;j<2;j++){10 int px=x+i,py=y+j;11 if(px>=0&&py>=0&&px

21 int n=0,m=0;22 int num=0; //池塘总数

23 String s;24 Scanner sc = newScanner(System.in);25 n=sc.nextInt();26 m=sc.nextInt();27 for(int i=0;i

28 s=sc.next();29 for(int j=0;j

31 }32 }33 sc.close();34 for(int i=0;i

43

44 }45 }

原文：http://www.cnblogs.com/duanqiong/p/4403453.html