#include<stdio.h>
char maze[8][8];
int n, m, t;
bool success;
int go[][2] = {
1, 0, -1, 0, 0, 0, 0, -1 };
void DFS(int x, int y, int time){
for (int i = 0; i < 4; i++)
{
int nx = x + go[i][0]
王道机试6.5:深度优先遍历(DFS)
最新推荐文章于 2023-03-18 11:46:25 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)