【老鼠走迷宫二】

最新推荐文章于 2018-05-03 12:35:02 发布

CSDN认证用户

最新推荐文章于 2018-05-03 12:35:02 发布

阅读量185

点赞数 1

分类专栏：算法

本文链接：https://blog.csdn.net/Helloyongwei/article/details/80178294

版权

算法专栏收录该内容

13 篇文章 5 订阅

订阅专栏

/*
老鼠走迷宫二 
有问题 
*/ 

#include <stdio.h>
#include <stdlib.h>

void visit(int ,int); 

int maze[9][9] = {
    {2, 2, 2, 2, 2, 2, 2, 2, 2}, 
    {2, 0, 0, 0, 0, 0, 0, 0, 2}, 
    {2, 0, 2, 2, 0, 2, 2, 0, 2},
    {2, 0, 2, 0, 0, 2, 0, 0, 2},
    {2, 0, 2, 0, 2, 0, 2, 0, 2},
    {2, 0, 0, 0, 0, 0, 2, 0, 2},
    {2, 2, 0, 2, 2, 0, 2, 2, 2},
    {2, 0, 0, 0, 0, 0, 0, 0, 2},
    {2, 2, 2, 2, 2, 2, 2, 2, 2}
};

int startI = 1, startJ = 1;
int endI = 7, endJ = 7;

int main(void)
{
    int i, j;
    
    printf("显示迷宫: \n");
    for(i = 0; i < 9; i++)
    {
        for(j = 0; j < 9; j++)
        {
            if(maze[i][j] == 2)
                printf("#");
            else
                printf(" ");
        }
        printf("\n");
    }
    visit(startI, startJ);
    return 0;
}

void visit(int i, int j)
{
    int m, n;
    
    maze[i][j] = 1;
    
    if(i == endI && j == endJ)
    {
        printf("\n显示路径：\n");
        for(m = 0; m < 9; m++)
        {
            for(n = 0; n < 9; n++)
            {
                if(maze[m][n] == 2)
                    printf("#");
                else if(maze[m][n] == 1)
                    printf("$");
                else
                    printf(" ");
            }
            printf("\n");
        }
        
    }
    
    if(maze[i][j+1] == 0)
        visit(i, j+1); 
    if(maze[i+1][j] == 0)
        visit(i+1, j);
    if(maze[i][j-1] == 0)
        visit(i, j-1);
    if(maze[i-1][j] == 0)
        visit(i-1, j);
        
    maze[i][j] = 0; 
}