二维数组迷宫趣题

import java.util.Scanner;

/**
 *  A代表人物
 *  核心思路,交换元素下标位置,走出迷宫
 */
public class TwoDimensionalMap {
    public static void main(String[] args) {
        char[][] map={
                {'*','*','*','*','*','*','*','*','*','*','*','*','*','*','*','*','*','*','*','*','*',},
                {'*','|','|','|','|','|','|','*','|','|','|','|','|','|','|','|','*','|','|','|','*',},
                {'*','|','*','*','*','*','|','*','*','*','*','*','*','|','|','|','*','|','*','|','*',},
                {'*','|','*','*','|','|','|','|','|','*','*','*','*','*','*','|','*','|','*','|','*',},
                {'*','|','*','*','|','*','|','*','*','*','|','|','|','|','|','|','|','*','*','|','*',},
                {'*','|','*','*','|','*','|','*','*','*','*','*','*','*','*','*','|','*','*','|','*',},
                {'*','|','*','*','|','*','|','*','|','|','|','|','|','|','|','*','|','*','*','|','*',},
                {'*','|','*','|','|','*','|','*','|','*','*','*','*','*','|','*','|','*','*','|','*',},
                {'*','|','*','|','*','*','|','*','|','*','*','*','*','*','|','*','|','*','*','|','*',},
                {'*','|','*','|','*','*','|','*','|','|','|','|','*','*','|','*','|','*','*','|','*',},
                {'*','|','*','|','*','*','|','*','*','*','*','|','*','*','|','*','|','|','*','|','*',},
                {'*','|','*','|','*','*','|','*','*','*','*','|','*','*','|','*','|','|','*','|','*',},
                {'*','|','*','|','|','|','|','|','|','|','|','|','*','*','|','*','*','|','*','|','*',},
                {'*','|','*','*','*','*','|','*','*','*','*','*','*','*','|','*','*','|','*','|','*',},
                {'*','|','*','*','*','*','|','*','*','*','*','*','*','*','|','*','|','|','*','|','*',},
                {'*','|','|','|','*','*','|','*','*','*','*','|','|','|','|','*','|','|','|','|','*',},
                {'*','*','*','|','*','*','*','*','*','*','*','|','*','*','|','|','|','|','*','|','*',},
                {'*','*','*','|','|','|','|','|','|','*','*','|','*','*','*','*','*','|','*','|','*',},
                {'*','*','*','*','*','*','*','*','|','*','*','|','*','*','*','*','*','|','*','|','*',},
                {'*','*','*','|','|','|','|','|','|','*','*','|','*','*','*','*','*','|','*','|','*',},
                {'*','*','*','|','*','*','*','*','*','*','|','|','|','|','|','*','*','|','*','|','*',},
                {'*','*','*','|','*','|','|','|','|','|','|','*','*','*','|','|','|','|','*','|','*',},
                {'*','*','*','|','*','*','*','*','*','*','*','*','*','*','*','*','*','*','*','A','*',}
        };
//        System.out.println(map.length);   // 行 23
//        System.out.println(map[0].length); // 列 21列
//        人物A的索引
        char userA;
        int startX = 22;
        int startY = 19;
//        System.out.println("人物" + map[startX][startY]);
//        出口索引
        int endX = 22;
        int endY = 3;
//        遍历地图
        for (int i = 0; i < map.length ; i++) {
            for (int j = 0; j < map[i].length; j++) {
                System.out.print(map[i][j] + " ");
            }
            System.out.println();
        }
        while (true){
        Scanner scanner = new Scanner(System.in);
        System.out.println("请通过WASD键位,移动人物走出迷宫");
//        返回 char指定索引处的值。 意为用户输入的首字母
        char user = scanner.next().charAt(0);
            switch (user){
                // 向上
                case 'w': case 'W':
                /*
                    人物A往上则startX-1,判断是否为*(墙)
                    交换数组下标位置,完成移动
                */
                    if (map[startX-1][startY] != '*'){
                        userA = map[startX][startY];
                        map[startX][startY] = map[startX-1][startY];
                        map[startX-1][startY] = userA;
                        startX--;
                    }
                    break;
                case 'a': case 'A':
                    // 向左
                    if (map[startX][startY-1] != '*'){
                        userA = map[startX][startY];
                        map[startX][startY] = map[startX][startY-1];
                        map[startX][startY-1] = userA;
                        startY--;
                    }
                    break;
                case 's': case 'S':
                    // 向下
                /*
                    人物A往上则startX+1,往下有下标越界的风险,需要对其进行控制
                    startX+1 < map.length ,不能大于数组列数
                    交换数组下标位置,完成移动
                */
                    if ((startX+1) < map.length && map[startX+1][startY] != '*'){
                        userA = map[startX][startY];
                        map[startX][startY] = map[startX+1][startY];
                        map[startX+1][startY] = userA;
                        startX++;
                    }
                    break;
                case 'd': case 'D':
                    // 向左
                    if (map[startX][startY+1] != '*'){
                        userA = map[startX][startY];
                        map[startX][startY] = map[startX][startY+1];
                        map[startX][startY+1] = userA;
                        startY++;
                    }
                    break;
            }
            //用户操作遍历地图,刷新地图显示人物当前位置
            for (int i = 0; i < map.length ; i++) {
                for (int j = 0; j < map[i].length ; j++) {
                    System.out.print(map[i][j] + " ");
                }
                System.out.println();
            }
            // 人物索引下标等于出口下标时,跳出循环,结束
            if (startX == endX && startY == endY){
                System.out.println("恭喜通过,即将进入下一关卡...");
                break;
            }
        }
    }
}

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 2
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值