蓝桥杯【2019】迷宫 java

package javaa;

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

public class mg {
	public static int han = 30;
	public static int lie = 50;
	public static int tongdao = 0;
	public static int zhangai = 1;
	public static int[][] map = new int[han][lie];
	public static Queue<point> queue = new LinkedList<>();
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		for (int i = 0; i < han; i++) {
			String string = scanner.nextLine();
			for (int j = 0; j < lie; j++) {
				map[i][j] = string.charAt(j) - '0';
			}
		}
		point temPoint = null;
		point firstPoint = new point(0, 0, "", map);
		queue.add(firstPoint);
		while(!queue.isEmpty()) {
			temPoint = queue.poll();
			if (temPoint.x == han - 1 && temPoint.y == lie - 1) {
				break;
			}
			paidui(temPoint);
		}
		System.out.println(temPoint.luxianString);
	}
	
	public static void paidui(point p) {
		int x = p.x;
		int y = p.y;
		map[x][y] = zhangai;
		if (x + 1 < han && map[x + 1][y] == tongdao) {
			point jiaruPoint = new point(x + 1, y, p.luxianString + "D", map);
			queue.add(jiaruPoint);
		}
		if (y - 1 >= 0 && map[x][y - 1] == tongdao) {
			point jiaruPoint = new point(x, y - 1, p.luxianString + "L", map);
			queue.add(jiaruPoint);
		}
		if (y + 1 < lie && map[x][y + 1] == tongdao) {
			point jiaruPoint = new point(x, y + 1, p.luxianString + "R", map);
			queue.add(jiaruPoint);
		}
		if (x - 1 >= 0 && map[x - 1][y] == tongdao) {
			point jiaruPoint = new point(x - 1, y, p.luxianString + "U", map);
			queue.add(jiaruPoint);
		}
	}
}

class point {
	public static int han = 30;
	public static int lie = 50;
	int x;
	int y;
	String luxianString;
	int[][] map = new int[han][lie];
	public point(int x, int y, String luxianString, int[][] map) {
		// TODO Auto-generated constructor stub
		this.x = x;
		this.y = y;
		for (int i = 0; i < han; i++) {
			for (int j = 0; j < lie; j++) {
				this.map[i][j] = map[i][j];
			}
		}
		this.luxianString = String.valueOf(luxianString);
	}
}