只能向右向下移动的迷宫

最新推荐文章于 2022-06-24 10:59:43 发布

Yamada_

最新推荐文章于 2022-06-24 10:59:43 发布

阅读量1.2k

点赞数

分类专栏： c++ 文章标签： c++-面试题 c++

本文链接：https://blog.csdn.net/yang2014_11/article/details/77371768

版权

c++ 专栏收录该内容

3 篇文章

订阅专栏

迷宫

一个迷宫，只能向右向下移动，获得可以到达目标点的路径

#include<iostream>
using namespace std;

int mg[10][12] = {     //一个迷宫，其四周要加上均为1的外框

    { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 },

    { 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1 },

    { 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1 },

    { 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1 },

    { 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1 },

    { 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1 },

    { 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1 },

    { 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1 },

    { 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1 },

    { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }

};

struct Point{
    Point(){}
    Point(int x, int y) :x(x), y(y){}
    int x;
    int y;
}path[100];

void Go(Point point, int lenth){
    path[lenth] = point;
    if (point.x == 9 || point.y == 11 || mg[point.x][point.y] == 1)
        return;
    if (mg[point.x][point.y] == 2){
        printf("\n getPaht!!! \n");
        for (int i = 0; i <= lenth; i++){
            printf("(%d,%d) ,",path[i].x,path[i].y);
        }
        return;
    }
    if (mg[point.x + 1][point.y] != 1){
        Go(Point(point.x + 1, point.y), lenth + 1);
    }
    if (mg[point.x][point.y + 1] != 1){
        Go(Point(point.x, point.y + 1), lenth + 1);
    }
}


void main(){
    printf("\n     Bagin  !!!  %d  \n", mg[8][10]);
    Go(Point(1,1),0);
    system("pause");
}