啊哈添柴挑战Java1811. 走迷宫1-储存迷宫

啊哈添柴——挑战

1811. 走迷宫1-储存迷宫

/**
 * @author yinglongwu
 */
//1811. 走迷宫1-储存迷宫
public class Main {

	public static void main(String[] args) {
		char[][] map = new char[][]{
			{'#','#','#','#','#','#'},
			{'#','O',' ','#',' ','E'},
			{'#',' ','#','#',' ','#'},
			{'#',' ',' ','#',' ','#'},
			{'#','#',' ',' ',' ','#'},
			{'#','#','#','#','#','#'},
		};
		//char类型数组的输出比较神奇,可以直接用数组名打印
		for (int i = 0; i < map.length; i++) {
			System.out.println(map[i]);

		}
		
	}

}