65,211
社区成员
发帖
与我相关
我的任务
分享#include<iostream>
using namespace std;
int maze[10][10]={ {0,0,0,0,0,0,0,0,0,0},
{0,1,1,0,1,1,1,0,1,0},
{0,1,1,0,1,1,1,0,1,0},
{0,1,1,1,1,0,0,1,1,0},
{0,1,0,0,0,1,1,1,1,0},
{0,1,1,1,0,1,1,1,1,0},
{0,1,0,1,1,1,0,1,1,0},
{0,1,0,0,0,1,0,0,1,0},
{0,0,1,1,1,1,1,1,2,0},
{0,0,0,0,0,0,0,0,0,0}};
bool search(int *p){
if(p < &maze[0][0] || p > &maze[9][9]) return false;
if(*p == 2) return true;
if(*p == 0) return false;
return search(p-1)+search(p+1)+search(p-10)+search(p+10);
}
int main(void){
int *p = & maze[1][1];
if(search(p)) cout<<"exist exit"<<endl;
else cout<< "not exist exit"<<endl;
system("pause");
}