迷宫问题（深度优先搜索）

深度优先求解迷宫问题:

#include<iostream>
using namespace std;
int n=10;
char Maze[10][10]={
{'O','X','X','X','X','X','X','X','X','X'},
{'O','O','O','O','O','X','X','X','X','X'},
{'X','O','X','X','O','X','O','O','O','X'},
{'X','O','X','X','O','X','O','X','X','X'},
{'X','O','X','X','X','X','O','O','O','X'},
{'X','O','X','X','X','X','O','X','O','X'},
{'X','O','X','X','X','X','O','X','O','X'},
{'X','O','X','X','X','X','O','X','O','X'},
{'X','O','O','O','O','O','O','X','O','X'},
{'X','O','X','X','X','X','X','X','O','O'}
};
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void print(){//打印路径（空格就是路径）
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cout << Maze[i][j] <<" ";
		}
		cout << endl;
	}
}


void DFS(int x,int y){
	if(x==n-1 && y ==n-1){ //到达终点 直接输出
		Maze[x][y] = ' ';
		print();
		return;
	}
	else{
		for(int i=0;i<4;i++){
			if(x>=0 && y>=0 && x<n && y<n && Maze[x][y]=='O'){//没超过边界且能走
				Maze[x][y] = ' ';
				DFS(x+dx[i],y+dy[i]);//往四个方向走
				Maze[x][y] = 'O';//走不下去就返回到这行 让不能走的再便会'O'
			}
		}
	}
}


int main(){
	
	DFS(0,0);
	
	return 0;
}