两种写法都在,欢迎点赞
2024-09-29 20:53:34
发布于:广东
1阅读
0回复
0点赞
#include<bits/stdc++.h>
using namespace std;
int dx[4] = {1,-1,0,0},dy[4] = {0,0,1,-1},a[45][45],vis[45][45],n,m;
struct node{
int x,y;
};
void BFS(int x,int y){//广搜写法
queue<node> q;
q.push({x,y});
while(!q.empty()){
int ix = q.front().x;
int iy = q.front().y;
q.pop();
for(int i = 0;i < 4;i ++){
int nx = ix + dx[i];
int ny = iy + dy[i];
if(nx >= 0 and ny >= 0 and nx < n and ny < m and vis[nx][ny] == 0 and a[nx][ny] == 0){
vis[nx][ny] = 1;
q.push({nx,ny});
}
}
}
}
void DFS(int x,int y){//深搜写法
for(int i = 0;i < 4;i ++){
int nx = x + dx[i];
int ny = y + dy[i];
if(nx >= 0 and ny >= 0 and nx < n and ny < m and vis[nx][ny] == 0 and a[nx][ny] == 0){
vis[nx][ny] = 1;
DFS(nx,ny);
}
}
}
int main(){
cin >> n >> m;
for(int i = 0;i < n;i ++){
for(int j = 0;j < m;j ++){
cin >> a[i][j];
}
}
DFS(0,0);
//BFS(0,0);
if(vis[n - 1][m - 1] == 1){
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
这里空空如也
有帮助,赞一个