文件名称:4
介绍说明--下载内容来自于网络,使用问题请自行百度
1. 一条通路的二元组(i, j)数据序列,(i, j)表示通路上某一点的坐标。
2. 用一种标志(如数字8)在二维数组中标出该条通路,并在屏幕上输出二维数组。
3. 可以利用一个二维数组maze[i][j]表示迷宫,其中1<=i<=m,1<=j<=n。数组元素值为0表示该位置是墙壁,不能通行;元素值为1表示该位置是通路。假定从maze[1][1]出发,出口位于maze[m][n],移动方向可以是8个方向(东,东南,南,西南,西,西北,北和东北。(1. the two tuple (I, J) data sequence of a path (I, J) indicating the coordinates of a point on the path.
2. mark the path in a two-dimensional array with a sign (such as number 8) and output a two-dimensional array on the screen.
3. can use a two-dimensional array maze[i][j] represents the maze, where 1<=i<=m, 1<=j<=n. The element value of the array is 0, indicating that the location is a wall and cannot pass; the element value is 1, indicating that the location is the path. Assuming departure from maze[1][1], the exit is located at maze[m][n], and the moving direction can be in 8 directions (East, Southeast, South, southwest, West, northwest, North and northeast).)
2. 用一种标志(如数字8)在二维数组中标出该条通路,并在屏幕上输出二维数组。
3. 可以利用一个二维数组maze[i][j]表示迷宫,其中1<=i<=m,1<=j<=n。数组元素值为0表示该位置是墙壁,不能通行;元素值为1表示该位置是通路。假定从maze[1][1]出发,出口位于maze[m][n],移动方向可以是8个方向(东,东南,南,西南,西,西北,北和东北。(1. the two tuple (I, J) data sequence of a path (I, J) indicating the coordinates of a point on the path.
2. mark the path in a two-dimensional array with a sign (such as number 8) and output a two-dimensional array on the screen.
3. can use a two-dimensional array maze[i][j] represents the maze, where 1<=i<=m, 1<=j<=n. The element value of the array is 0, indicating that the location is a wall and cannot pass; the element value is 1, indicating that the location is the path. Assuming departure from maze[1][1], the exit is located at maze[m][n], and the moving direction can be in 8 directions (East, Southeast, South, southwest, West, northwest, North and northeast).)
相关搜索: 迷宫游戏
(系统自动生成,下载前可以参看下载内容)
下载文件列表
4.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.