int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, };
它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。
Input
Output
Sample Input
0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 0
Sample Output
(0, 0) (1, 0) (2, 0) (2, 1) (2, 2) (2, 3) (2, 4) (3, 4)(4, 4)
代码:bfs
#include <iostream> #include <cstdio> #include <cstring> #include <cstdlib> using namespace std; int maze[5][5]; int w[4][2] ={1,0,-1,0,0,-1,0,1}; int front = 0,rear = 0; struct node { int x; int y; int pre;//前驱 }p[100]; void print (int i) { if(p[i].pre !=-1) { print (p[i].pre); cout << "("<< p[i].x<< ", "<< p[i].y << ")"<< endl; } else { cout << "(0, 0)"<< endl; } } void bfs(int x1, int y1) { p[front].x = x1; p[front].y = y1; p[front].pre = -1; rear++;//入队 while (front < rear)//不为空 { //把队列的头结点的周围点入队 for(int i = 0; i < 4; i++) { int a = w[i][0]+p[front].x; int b = w[i][1]+p[front].y; if(a <0 || a >= 5 || b < 0 || b >= 5 || maze[a][b]) { continue; } else { maze[a][b] = 1; p[rear].x = a; p[rear].y = b; p[rear].pre = front; rear++; } if(a == 4 && b== 4) { print(front); cout<< "(4, 4)"<< endl; return ; } } front++; } } int main() { for (int i= 0; i < 5; i++) { for (int j = 0; j < 5; j++) { scanf("%d",&maze[i][j]); } } bfs(0,0); return 0; }
代码:dfs