package algorithm_java;import java.util.Scanner;
import java.util.Stack;/*** 路径问题 可以走的最小路径*/class Node{public int x;public int y;Node(int x, int y){this.x = x;this.y = y;}
}public class Labyrinth_Path {public static void main(String[] args){Scanner scanner = new Scanner(System.in);int labyrinth[][] = new int[5][5];for (int i = 0; i < 5; i++) {for (int j = 0; j < 5; j++) {labyrinth[i][j] = scanner.nextInt();}}judge(labyrinth);}private static void judge(int[][] labyrinth_1) {int[][] dir = {{1, 0}, {0, 1}}; // 行走的方向Stack<Node> stack = new Stack<>(); // 设置一个栈来存储信息int [][] visited = new int[5][5]; // 标记是否被访问 和labyrinth大小一致Node start = new Node(0, 0); // 开始的节点信息Node end = new Node(4, 4); // 结束的位置visited[start.x][start.y] = 1; // 将起点信息标记为1stack.push(start); // 将起点信息压栈while (!stack.isEmpty()){ // 不为空没有找到解boolean flag = false; // 标记是否找了一个方向Node pek = stack.peek();if (pek.x == end.x && pek.y == end.y){break;} else {for (int i = 0; i < 2; i++) {Node nbr = new Node(pek.x + dir[i][0], pek.y + dir[i][1]);// 判断是否满足条件if (nbr.x >= 0 && nbr.x < 5 && nbr.y >= 0 && nbr.y < 5 && labyrinth_1[nbr.x][nbr.y] == 0 && visited[nbr.x][nbr.y] == 0){stack.push(nbr);visited[nbr.x][nbr.y] = 1;flag = true;break;}}if (flag){ // 找到了方向  就不用执行出栈 一直往下找continue;}stack.pop(); // 两个方向都不可以出栈
            }}Stack<Node> stackRev = new Stack<>(); // 调整栈的内容while (!stack.isEmpty()){stackRev.push(stack.pop());}while (!stackRev.isEmpty()){System.out.println("(" + stackRev.peek().x + "," + stackRev.peek().y + " )");stackRev.pop();}}
}