hdu 1241 java (dfs+bfs) 搜索

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class C1241 {
static int MAX = 100+2;
static int m;
static int n;
static char[][] map = new char[MAX][MAX];
static boolean vis[][] = new boolean[MAX][MAX];
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
while(scan.hasNext()) {
n = scan.nextInt();
m = scan.nextInt();
//把所有的输入全都读进来
if(m+n == 0 ) {break;}
scan.nextLine();
for(int i=0;i<n;i++) {
String str = scan.nextLine();
char str2[] = str.toCharArray();
for(int j=0;j<m;j++) {
map[i][j] = str2[j];
}
}
init();
int count = 0;
//对所有的分块进行遍历
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
if(!vis[i][j]&&map[i][j]==’@’) {
vis[i][j] = true;
//dfs(i,j);
bfs(i,j);
count++;
}
}
}
System.out.println(count);
}
}

static void init() {//所有的分块初始化为都没走过
for(int i=0;i<MAX;i++) {
for(int j=0;j<MAX;j++) vis[i][j] = false;
}
}

static void dfs(int x,int y) {//有走的方向类的以后这么求
int dir[][] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
for(int k=0;k<8;k++) {
int dx = x + dir[k][0];
int dy = y + dir[k][1];
if(dx>=0&&dx<n&&dy>=0&&dy<m) {
if((!vis[dx][dy])&&map[dx][dy]==’@’) {
vis[dx][dy] = true;
dfs(dx,dy);
}
}
}
}

static Queue queue = new LinkedList();
static void bfs(int x,int y) {
int dir[][] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
queue.offer(new Node(x,y));
vis[x][y] = true;
while(!queue.isEmpty()) {
Node current = queue.poll();

	for(int k=0;k<8;k++) {
		Node next = new Node(current.x + dir[k][0],current.y + dir[k][1]) ;
		 next.x = current.x + dir[k][0];
		next.y = current.y + dir[k][1];
		if(next.x>=0&&next.x<n&&next.y>=0&&next.y<m) {
			if((!vis[next.x][next.y])&&map[next.x][next.y]=='@') {
				vis[next.x][next.y] = true;
				queue.offer(next);
			}
		}
	}
}

}

}

class Node{
public int x;
public int y;
public Node(int x,int y) {
this.x = x;
this.y = y;
}
}