迷宫问题

/*
8 6
1 1 1 1 1 1 1 1
1 0 0 1 0 0 1 1
1 1 0 0 0 0 0 1
1 0 0 1 0 1 0 1
1 0 0 0 0 0 0 1
1 1 1 1 1 1 1 1
*/
#include <iostream>           //////////-static-libgcc
#include <iomanip>
#include <ctime>
#include <stack>
#include<cstdio>
#include<windows.h>          //Sleep()头文件 
#include<cstring>
#include<mmsystem.h>         //播放MP3文件的头文件，工具编译选项编译器在连接器命令加入-lwinmm  
#include<conio.h>
using namespace std;

struct position{
    int row;                 // x
    int col;                 // y
    int option;              //下一步 
};
void Pos(int x, int y) {     //设置放置位置 
    COORD p;
    p.X = y;p.Y = x;
    SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), p);
}
void welcome();                                          //欢迎模块 
void play_mp3(char *ps);                                 //播放音乐 
void MazeGenerator(char **m, int row, int col);          //输入模块
bool findPath(stack<position> *&path, int **maze, int row, int col);       //寻找路径 
void outputPath(stack<position> *&path);                 //输出模块 

int **NewDArray(int row, int col)         //设置迷宫的大小 
{
    int **m = new int *[row];
    if (!m) {
        cout << "Out of Memory !"; return nullptr;
    }
    for (int i = 0; i < col; i++) {
        m[i] = new int [col];
        if (!m[i]) {
            cout << "Out of Memory
";
            for (int k = 0; k < i; k++) delete []m[i];
            delete []m; return nullptr;
        }
    }
    
//    for (int i = 0; i < row ; i++) {
//        for (int j = 0; j < col ; j++)
//            m[i][j] = 0;
//    }
//    for (int i = 0; i < row; i++) {
//        for (int j = 0; j < col; j++)
//            cout << m[i][j] << " ";
//        cout << endl;
//    }
//    cout << "row = " << row << ", col = " << col << endl;
    return m;
}

void DeleteDArray(int **m, int row)            //释放迷宫动态内存 
{
    for (int i = 0; i < row; i++)
        delete []m[i];
    delete []m;
}

void MazeGenerator(int **m, int row, int col)  //随机产生迷宫
{
    int i, j;
//    time_t t;
    int code;
    
//    srand((unsigned)time(&t));                 //设置随机种子
//    for (int i = 0; i < col; i++) {
//        m[0][i] = 1; 
//        m[row - 1][i] = 1;
//    }
//    cout << "Deubg !!";
//    for (int j = 1; j < row - 1; j++) m[j][0] = m[j][col - 1] = 1;
    
    for (i = 0; i < row ; i++) {
        Pos(10 + i, 22);
        for (j = 0; j < col ; j++)
        {
            cin >> code;                 
            m[i][j] = code;                
        }
    }
} 

void MazeDisplay(int **m, int row, int col)   //显示迷宫 
{
    system("cls");
    
    int i, j;
    
    HANDLE console;
    console = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleTextAttribute(console, 7);
    cout << endl;
    for (i = 0; i < row; i++)
    {   
        Pos(7+i, 30);
        for (j = 0; j < col; j++)
            cout << ' ' << m[i][j];
        cout << endl;
    }
    Pos(7+row, 0);
    cout << endl;
}

bool findPath(stack<position> *&path, int **maze, int row, int col)
{
    //寻找一条从入口(1,1), 到达出口(size, size)的路径
    //如果找到, 返回true, 否则返回false
    
    //初始化偏移量
    position offset[8];
    
//    offset[0].row = 0; offset[0].col = 1;     //右 
//    offset[1].row = 1; offset[1].col = 0;     //下
//    offset[2].row = 0; offset[2].col = -1;    //左
//    offset[3].row = -1;offset[3].col = 0;     //上
//    
//    offset[0].row = 1; offset[0].col = 0;     //下
//    offset[1].row = 0; offset[1].col = 1;     //右 
//    offset[2].row = -1;offset[2].col = 0;     //上
//    offset[3].row = 0; offset[3].col = -1;    //左

//
//    offset[0].row = 0; offset[0].col = -1;    //左        
//    offset[1].row = 1; offset[1].col = 0;     //下        
//    offset[2].row = 0; offset[2].col = 1;     //右 
//    offset[3].row = -1;offset[3].col = 0;     //上

    offset[0].row = 0; offset[0].col = 1;     //右
    offset[1].row = 1; offset[1].col = 1;     //右下 
    offset[2].row = 1; offset[2].col = 0;     //下
    offset[3].row = -1; offset[3].col = -1;   //左下 
    offset[4].row = 0; offset[4].col = -1;    //左
    offset[5].row = -1; offset[5].col = -1;   //左上 
    offset[6].row = -1;offset[6].col = 0;     //上
    offset[7].row = -1; offset[7].col = 1;    //右上 
 
    
    position here;
    here.row = 1; here.col = 1; here.option = 0;
    maze[1][1] = 1;                           //防止回到入口
//    int option = 0;                           //下一步 
    int lastOption = 7;                       //最后一步
    
    //寻找一条路径
    while (here.row != row - 2 || here.col != col - 2)
    {//没有找到出口
        //找到要移动的相邻一步
        int r, c;
        while (here.option <= lastOption) {
            r = here.row + offset[here.option].row;
            c = here.col + offset[here.option].col;
            if (maze[r][c] == 0) break;      //如果是是通路，就一直超着该通路方向. 
            here.option++;                   //否则，选择下一个方向 
        }
        //相邻的一步是否找到 ? 
        if (here.option <= lastOption) 
        {//移到maze[r][c] 
            path->push(here);                //将(x,y)入栈 
            here.row = r; here.col = c;      //求新点坐标，得新(x,y) 
            maze[r][c] = 1;                  //设置1，以防止重复访问
            here.option = 0;  
        }
        else { //没有邻近的一步可以走,返回 
            if (path->empty()) return false; //如果没有路径，则返回 
//            position next = path->top();     //here(当前位置) 和 next(退一步)相邻，next-->here(最后一次移动) 
            here = path->top();
            path->pop();                     //往回走一步
            here.option++;                   //换一个方向走 
        }
    } 
    path->push(here);
    return true;          //到达出口 
     
}

void outputPath(stack<position> *&path)
{
    HANDLE console;
    console = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleTextAttribute(console, 14);
    int len = path->size(), row = 0, col = 0;
    for (int i = 1; i <= len - 1; i++) {
        row = path->top().row , col = path->top().col;
        cout  << "(" << row << " , " << col << ")" << " <- " ;
        if (i % 7 == 0) cout << endl;
        path->pop();
    }
    row = path->top().row , col = path->top().col;
    cout << "(" << row << " , " << col << ")"; path->pop();
    cout << endl;
}

int main()
{
    welcome();
    HANDLE console;
    console = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleTextAttribute(console, 13);
        
    stack<position> *path = new stack<position>;
    int row, col;
    Pos(7, 20);
    cout << "Enter the maze size(row and col): ";
    cin >> row >> col;
    int **m = NewDArray(row, col);           //返回动态申请的二维数组
    if (!m) {
        cout << "out of Memory! 
";
        return 1;
    }
    Pos(9, 20);
    cout << "输入迷宫: 
";
    MazeGenerator(m, row, col);         //随机生成迷宫 
    MazeDisplay(m,row,col);             //显示迷宫 
    
    if (findPath(path, m, row, col)) {
        outputPath(path);
//        MazeDisplay(m,row,col);             //显示迷宫 
    }
    else {
        cout << "No Path " << endl;
    }
    
    system("pause");
    return 0;
}



void welcome() {
    char pause;
    HANDLE console;
    console = GetStdHandle(STD_OUTPUT_HANDLE);
    char mp[] = "F:\KuGou\薛之谦_绅士.mp3";
    play_mp3(mp);
    Pos(7,33);
    SetConsoleTextAttribute(console, 15);
    cout << " Welcome To 
"; 
    Pos(9,31);
    cout << "↖RAT IN A MAZE↗
";
    Pos(11,31);
    cout << "by 一念永恒, 2016
";
    Pos(13, 0);
    SetConsoleTextAttribute(console, 11);
    cout << "加载ing...	";
    for(int i = 0; i<101; ++i)
    {
        printf("%2.0f%%", i/100.0 * 100 ); 
        Sleep(20);
        printf("");
    }
    cout << "
			";
    for(int i = 0; i<5; ++i)
    {
        Sleep(500); cout << "@。@	";
    }
    cout << endl;
    SetConsoleTextAttribute(console, 11);
    cout << endl; 
    cout << "===============================按回车键进入游戏=========================================
";
    cin.get(pause);
    system("cls");
}

void play_mp3(char *ps)  // 歌曲的名字 
{
    char str[100] = "play ";
    strcat(str,ps);
    mciSendString(str,NULL,0,NULL);
}