队列1（迷宫问题）

#include"iostream"
#include"windows.h"
#include"time.h"
#include"queue"
using namespace std;

void gotoxy(int x, int y) //goto语句  
{  
    COORD pos;  
    pos.X = x;  
    pos.Y = y;  
    SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos);  
}

class Point{
public:
    int x;
    int y;
    int k;                    //转弯次数
    int dire;                //当前方向，上0，下1，左2，右3, -1 表示4个方向（起点）
    Point(int y,int x,int k,int dire){
        this->x = x;
        this->y = y;
        this->k = k;
        this->dire = dire;
    }
};
class Maze{
private:
    char **map;
    int w;
    int h;
public:
    friend void task();
    Maze(int w = 0,int h = 0);
    void deleteMap();
    void initialization();
    int move(int x,int y,int x1,int y1,int k1);
    void show();
    
};

int main(){
    void randMaze();
    randMaze();
//    task();
    return 0;
}
void Maze::initialization(){
    srand(time(NULL));
    for(int i = 0;i < h;i++){
        for(int j = 0;j < w;j++){
            map[i][j] = ‘.‘;
        }
    }
    for(i = 0;i < h;i++){
        for(int j = 0;j < w;j++){
            if(rand()%4 == 0){
                map[i][j] = ‘*‘;
            }
        }
    }
    map[0][0] = ‘.‘;
    map[h - 1][w - 1] = ‘.‘;
}
void Maze::deleteMap(){
    for(int i = 0;i < h;i++){
        delete[] map[i];
    }
}
Maze::Maze(int w,int h){
    map = new char*[h];
    for(int i = 0;i < h;i++){
        map[i] = new char[w];
    }
    this->w = w;
    this->h = h;
}
void Maze::show(){
    for(int i = 0;i < h;i++){
        for(int j = 0;j < w;j++){
            cout<<map[i][j];
        }
        cout<<endl;
    }
}
int Maze::move(int x,int y,int x1,int y1,int k1){
    queue<Point> q;
    q.push(Point(x,y,0,-1));
    while(!q.empty()){
        Point p = q.front();
        gotoxy(p.x,p.y);cout<<‘+‘;Sleep(1);            //动画效果
        if(p.x == w - 1 && p.y == h - 1||p.x == x1&&p.y == y1){
            return p.k;
        }
        if(p.x + 1<w&&map[p.y][p.x + 1]==‘.‘){        //右走
            int k = p.k;
            if(p.dire!=3&&p.dire!=-1){
                k++;
            }
            if(k <= k1){
                map[p.y][p.x + 1] = ‘+‘;
                q.push(Point(p.y,p.x + 1,k,3));
            }
        }
        if(p.y + 1<h&&map[p.y + 1][p.x]==‘.‘){        //下走
            int k = p.k;
            if(p.dire!=1&&p.dire!=-1){
                k++;
            }
            if(k <= k1){
                map[p.y + 1][p.x] = ‘+‘;
                q.push(Point(p.y + 1,p.x,k,1));
            }
        }
        if(p.x > 0&&map[p.y][p.x - 1]==‘.‘){        //左走
            int k = p.k;
            if(p.dire!=2&&p.dire!=-1){
                k++;
            }
            if(k <= k1){
                map[p.y][p.x - 1] = ‘+‘;
                q.push(Point(p.y,p.x - 1,k,2));
            }
        }
        if(p.y > 0&&map[p.y - 1][p.x]==‘.‘){        //上走
            int k = p.k;
            if(p.dire!=0&&p.dire!=-1){
                k++;
            }
            if(k <= k1){
                map[p.y - 1][p.x] = ‘+‘;
                q.push(Point(p.y - 1,p.x,k,0));
            }
        }
        q.pop();
    }
    return -1;
}
void randMaze(){
    int w = 90;
    int h = 20;
    void task();
    Maze m(w,h);
    m.initialization();
    m.show();
    system("pause");
    int n = m.move(0,0,w - 1,h - 1,100);
    gotoxy(0,22);
    cout<<n<<endl;
    m.deleteMap();
}

void task(){
    int h = 5,w = 5,n;
    int k = 1,x1 = 1,x2 = 1,y1 = 1,y2 = 3;
    cin>>n;
    while(n--){
        cin>>w>>h;
        Maze m(w,h);
        for(int i = 0;i < h;i++){
            for(int j = 0;j < w;j++){
                cin>>m.map[i][j];
            }
        }
        cin>>k>>x1>>x2>>y1>>y2;
        if(m.move(x1 - 1,y1 - 1,x2 - 1,y2 - 1,k) != -1){
            cout<<"yes"<<endl;
        }
        else{
            cout<<"no"<<endl;
        }
        m.deleteMap();
    }
}

/*
2
5 5
...**
*.**.
.....
.....
*....
1 1 1 1 3
5 5
...**
*.**.
.....
.....
*....
2 1 1 1 3

*/