蓝桥杯迷宫题

##遇到了错误，不知道是哪里写错了，用的是DFS思路，图里面那个简单的用例

#include
using namespace std;
int tox[] = {1,0,0,-1};
int toy[] = {0,-1,1,0};
char dir[] = {'D','L','R','U'};

const int row = 4;
const int col = 6;
string maze[row]={
   "010000",
   "000100",
   "001001",
   "110000"
};
int mins[row+5][col+5];
int best = 1e8+5;
char a[row*col];
string ans;
string temp;

void dfs(int x , int y , int step){
   if(step > best) return;
   if(x == row - 1 && y == col - 1) {
       for(int i=1;itemp+=a[i];
       if(step < best)
           best = step;
           ans = temp;
       return;
   }
   else if(step==best && temptemp;
   for(int i = 0 ; i < 4 ; i++){
       int nextx = x + tox[i];
       int nexty = y + toy[i];
       if(nextx >= 0 && nextx <= row - 1 && nexty >= 0 && nexty <= col - 1 && maze[nextx][nexty]=='0' && step + 1 <= mins[nextx][nexty]){
           mins[nextx][nexty] = step +1;
           maze[nextx][nexty] = '1';
           a[step] = dir[i];
           dfs(nextx , nexty , step+1);
           maze[nextx][nexty] = '0';
       }
   }
}

int main(){
   memset(mins,1,sizeof(mins));
   maze[0][0] = '1';
   dfs(0, 0 ,0);
   cout<< best<return 0;
}

##正确答案应该是

不知道你这个问题是否已经解决, 如果还没有解决的话:

• 文章：蓝桥杯笔记：DFS（深度优先搜索）解决问题 中也许有你想要的答案，请看下吧

如果你已经解决了该问题, 非常希望你能够分享一下解决方案, 写成博客, 将相关链接放在评论区, 以帮助更多的人 ^-^

仅供参考：

/**
 * @Title  老鼠走迷宫的拓展探究
 * @Author 孙琨
 * @Date   2013-11-16
 * @At     XUST
 * @All Copyright by 孙琨
 *
 */

#include <iostream>
using namespace std;

int maze[9][9] = { // 初始化迷宫，英文maze为“迷宫”
    {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;     // 出口行列坐标

void visit(int i,int j)  // 自动搜寻路径
{
    int m,n;

    maze[i][j] = 1;

    if((i == endI) && (j == endJ))
    {
        cout << endl << "显示路径:" << endl;
        for(m=0; m<9; m++)
        {
            for(n=0; n<9; n++)
            {
                if(maze[m][n] == 2)
                    cout << "■";
                else if(maze[m][n] == 1)
                    cout << "♀";
                else
                    cout << "  ";
            }
            cout << endl;
        }
    }

    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;

}

int main(void)
{
    int i,j;

    cout << "显示迷宫: " << endl;
    for(i=0; i<9; i++)
    {
        for(j=0; j<9; j++)
        {
            if(maze[i][j] == 2)
                cout << "■" ;
            else
                cout << "  " ;
        }
        cout << endl;
    }

    visit(startI,startJ);

    return 0;
}