迷宫

void MazeInit(Maze* maze)//初始化地图
{
  if(maze == NULL) {
    return;
  }

  int map[ROW][COL] = {
    {0,1,0,0,0,0},
    {0,1,1,1,0,0},
    {0,1,0,1,1,0},
    {1,1,0,0,1,0},
    {0,0,0,0,0,0},
    {0,0,0,0,0,0}
  };

  size_t i = 0;
  size_t j = 0;
  for(; i < ROW; ++i) {
    for(j = 0; j < COL; ++j) {
      maze->map[i][j] = map[i][j];
    }
  }

  return;
}

void MazeMapPrint(Maze* maze)//打印地图
{
  if(maze == NULL) {
    return;
  }

  printf("\n");
  size_t i = 0;
  size_t j = 0;
  for(; i < ROW; ++i) {
    for(j = 0; j < COL; ++j) {
      printf("%2d ",maze->map[i][j]);
    }
    printf("\n");
  }
}

int CanStay(Maze* maze, Point cur)//是否能够落脚
{
  if(maze == NULL) {
    return 0;
  }

  if(cur.col < 0 || cur.col >= COL || \
     cur.row < 0 || cur.row >= ROW) {
    return 0;
  }

  if(maze->map[cur.row][cur.col] == 1) {
    return 1;
  }
  return 0;
}

void MarkStay(Maze* maze, Point cur)//标记落脚点
{
  if(maze == NULL) {
    return;
  }
  maze->map[cur.row][cur.col] = 2;
}

int isExit(Maze* maze, Point cur, Point entry)//判断是否是出口点
{
  if(maze == NULL) {
    return 0;
  }
  if((cur.row == 0 || cur.row == ROW - 1 || \
     cur.col == 0 || cur.col == COL - 1) && \
     (cur.col != entry.col || cur.row != entry.row)) {
    return 1;
  }
  return 0;
}

int _GetPathMaze(Maze* maze, Point cur, Point entry)
{
  printf("(%d,%d)\n",cur.row, cur.col);
  if(maze == NULL) {
    return 0;
  }
  //判断是否能落脚
  if(!CanStay(maze, cur)) {
    return 0;
  }
  //标记落脚点
  MarkStay(maze, cur);
  //判断是否是出口点
  if(isExit(maze, cur, entry)) {
    printf("找到一条路径\n");
    return 1;
  }
  //如果不是出口点那么就判断它的四周
  //预定顺序为上、右、下、左
  Point up = cur;  
  up.row -= 1;
  _GetPathMaze(maze, up, entry);

  Point right = cur;  
  right.col += 1;
  _GetPathMaze(maze, right, entry);

  Point down = cur;  
  down.row += 1;
  _GetPathMaze(maze, down, entry);

  Point left = cur;  
  left.col -= 1;
  _GetPathMaze(maze, left, entry);

  return 1;
}

void GetPathMaze(Maze* maze,Point entry)//查找路径
{
  if(maze == NULL) {
    return;
  }
  entry.row = 0;
  entry.col = 1;

  _GetPathMaze(maze, entry, entry);
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值