迷宫问题

最新推荐文章于 2024-04-27 13:41:46 发布

lsfreda

最新推荐文章于 2024-04-27 13:41:46 发布

阅读量249

点赞数

分类专栏： C 语言学习文章标签：数组地图

本文链接：https://blog.csdn.net/u010358868/article/details/48933219

版权

C 语言学习专栏收录该内容

16 篇文章 0 订阅

订阅专栏

main.cpp
    #include "function.h"
    char map[10][10] =
    {
        //10行10列的数组地图
        {'#','#','#','#','#','#','#','#','#','#'},//0
        {'#','0',' ',' ',' ','#',' ','#',' ',' '},//1
        {'#','#',' ','#','#','#',' ','#',' ','#'},//2
        {'#','#',' ',' ',' ',' ',' ','#',' ','#'},//3
        {'#','#','#',' ','#','#',' ','#',' ','#'},//4
        {'#',' ','#',' ',' ','#',' ','#',' ','#'},//5
        {'#',' ','#',' ',' ','#',' ','#',' ','#'},//6
        {'#',' ','#',' ',' ','#',' ','#',' ','#'},//7
        {'#',' ',' ',' ',' ','#',' ',' ',' ','#'},//8
        {'#','#','#','#','#','#','#','#','#','#'},//9
        //0   1   2   3   4   5   6   7   8   9
    };
    int startX = 1;
    int startY = 1;
    int endX = 1;
    int endY = 9;
    char direction = '0';
    while (map[endX][endY] != '0') {
        printMap(map);
        scanf("\n%c", &direction);
        switch (direction) {
            case 'w':
                if (map[startX - 1][startY] == ' ') {
                    map[startX - 1][startY] = '0';
                    map[startX][startY] = ' ';
                    startX = startX - 1;
                } else {
                    printf("此路不通\n");
                }
                break;
            case 's':
                if (map[startX + 1][startY] == ' ') {
                    map[startX + 1][startY] = '0';
                    map[startX][startY] = ' ';
                    startX = startX + 1;
                } else {
                    printf("此路不通\n");
                }
                break;
            case 'a':
                if (map[startX][startY - 1] == ' ') {
                    map[startX][startY - 1] = '0';
                    map[startX][startY] = ' ';
                    startY = startY - 1;
                } else {
                    printf("此路不通\n");
                }
                break;
            case 'd':
                if (map[startX][startY + 1] == ' ') {
                    map[startX][startY + 1] = '0';
                    map[startX][startY] = ' ';
                    startY = startY + 1;
                } else {
                    printf("此路不通\n");
                }
                break;
            default:
                printf("请输入正确方向!!!");
                break;
        }

    }
    printf("恭喜,成功通过迷宫!!!\n");

function.cpp
void printMap( char ( *map)[10] ) {
    for (int i = 0; i < 10; i++) {
        for (int j = 0 ; j < 10; j++) {
            printf("%c", map[i][j]);
        }
        printf("\n");
    }
    printf("请按 wsad 进行上下左右方向的移动:\n");
}