我是初学者所以请原谅我。我正在尝试制作一个基于文本的游戏。我在让玩家穿过阵列时遇到问题。0 = 空位 p = 玩家
[ 0, 0, 0, 0, 0]
[ 0, 0, 0, 0, 0]
[ 0, 0, 0, 0, 0]
[ 0, 0, 0, 0, 0]
[ 0, 0, p, 0, 0]
我想要的结果是,当我输入 1 时,玩家向上移动
[ 0, 0, 0, 0, 0]
[ 0, 0, 0, 0, 0]
[ 0, 0, 0, 0, 0]
[ 0, 0, p, 0, 0]
[ 0, 0, 0, 0, 0]
但我认为我的代码显示它是
[ 0, 0, 0, 0, 0]
[ 0, 0, 0, 0, 0]
[ 0, 0, 0, 0, 0]
[ 0, 0, p, 0, 0]
[ 0, 0, p, 0, 0]
公共静态无效主(字符串[] args){
//starting player position
int px = 4;
int py = 2;
String player = "P";
String map[][] = new String[5][5];
for(int i = 0; i < map.length; i++)
for (int j = 0; j < map.length; j++) {
map[px][py] = player;
System.out.println(map[i][j]);
int move;
Scanner scanner = new Scanner(System.in);
move = scanner.nextInt();
//up
if(move == 1) {
map[px][py + 1] = player;
printMap(map);
}
//right
if(move == 2) {
map[px + 1][py] = player;
printMap(map);
}
//left
if(move == 3) {
map[px - 1][py] = player;
printMap(map);
}
//down
if(move == 4) {
map[px][py - 1] = player;
printMap(map);
}
}
}
public static void printMap(String a[][]) {
for ( int i = 0; i < a.length; i++)
for( int j = 0; j < a[i].length; j++) {
System.out.println( a[i][j]);
}
慕丝7291255
相关分类