纯c,回溯法,使用链栈求解迷宫问题
这是主函数:
#include "link_stack.h"
#define m 6
#define n 8
void find(int maze[m + 2][n + 2], int start_x, int start_y, int end_x, int end_y, int direction[4][2]);
int main()
{
int maze[m + 2][n + 2] = {
{1,1,1,1,1,1,1,1,1,1},
{1,0,0,1,1,0,1,1,1,1},
原创
2020-10-17 20:22:09 ·
284 阅读 ·
0 评论