啊哈添柴——挑戰
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]);
}
}
}