啊哈添柴挑戰Java1812. 走迷宮2-向下移動

啊哈添柴——挑戰

1812. 走迷宮2-向下移動

import java.util.Scanner;

/**
 * @author yinglongwu
 */
//1812. 走迷宮2-向下移動
public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		char[][] map = new char[][]{
			{'#','#','#','#','#','#'},
			{'#','O',' ','#',' ','E'},
			{'#',' ','#','#',' ','#'},
			{'#',' ',' ','#',' ','#'},
			{'#','#',' ',' ',' ','#'},
			{'#','#','#','#','#','#'},
		};
		int Ox = 1,Oy = 1;
		String step = scanner.next();
		char[] stepArr = step.toCharArray();
		for (int i = 0; i < stepArr.length; i++) {
			switch (stepArr[i]) {
			case 's'://向下移動
				if (map[Ox+1][Oy]!='#') {
					map[Ox][Oy] = ' ';
					map[Ox+1][Oy] = 'O';
					Ox = Ox+1;
				}
				break;

			default:
				break;
			}
		}
		
		//char類型數組的輸出比較神奇,可以直接用數組名打印
		for (int i = 0; i < map.length; i++) {
			System.out.println(map[i]);
		}
	}

}