http://poj.org/problem?id=3984 迷宫问题

//JAVA

import java.util.*;
public class Main{
static Scanner inScanner=new Scanner(System.in);
static int[][] num=new int[5][5];
static Stack<Point> stack;
static void bfs(){
while(!stack.isEmpty()){
Point point=stack.pop();
int x=point.x;
int y=point.y;
if(point.x+1<=4&&num[point.x+1][point.y]==0){
point.x++;
}else if(point.y+1<=4&&num[point.x][point.y+1]==0){
point.y++;
}else if(point.x-1>=0&&num[point.x-1][point.y]==0){
point.x--;
}else if(point.y-1>=0&&num[point.x][point.y-1]==0){
point.y--;
}
if(num[point.x][point.y]==2)  continue;
num[point.x][point.y]=2;
stack.push(new Point(x, y));
stack.push(point);
if(point.x==4&&point.y==4){
break;
}
}
for(int i=0;i<stack.size();i++)
System.out.println(stack.elementAt(i));
}
public static void main(String[] args){
while(inScanner.hasNext()){
for(int i=0;i<5;i++)
for(int j=0;j<5;j++)
num[i][j]=inScanner.nextInt();
stack=new Stack<Point>();
stack.push(new Point(0, 0));
bfs();
}
}
}
class Point{
int x=0;
int y=0;
public Point(int x,int y){
this.x=x;
this.y=y;
}
public String toString() {
return "(" + this.x + ", " + this.y + ")";
}
}