迷宫问题
唐家·威少
中二病晚期
展开
-
数据结构-顺序栈解决迷宫问题
#include #include #include #define MaxSize 100 using namespace std; int M=4,N=4; int mg[6][6]= { {1,1,1,1,1,1}, {1,0,0,0,1,1}, {1,0,1,0,0,1}, {1,0,0,0,1,1}, {1,1,0,0,0,1}, {原创 2017-06-01 20:38:09 · 1449 阅读 · 2 评论 -
数据结构-顺序队列解决最短迷宫路径问题
#include #include #include using namespace std; #define MaxSize 100 int M=8,N=8; int mg[10][10]={ {1,1,1,1,1,1,1,1,1,1}, {1,0,0,1,0,0,0,1,0,1}, {1,0,0,1,0,0,0,1,0,1}, {1,0,0,0,0,1,1,0,0,1}, {1,0,1,1,原创 2017-06-01 20:45:25 · 1218 阅读 · 0 评论 -
YTU OJ-1085: Maze Problem
1085: Maze ProblemTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 23 Solved: 5[Submit][Status][Web Board]DescriptionGiven a maze, find a shortest path from start to goal.InputInput consists serveral t...原创 2018-03-21 10:47:59 · 416 阅读 · 0 评论 -
YTU OJ-1006: Hero In Maze
1006: Hero In MazeTime Limit: 1000 Sec Memory Limit: 64 MBSubmit: 344 Solved: 59[Submit][Status][Web Board]Description500年前,Jesse是我国最卓越的剑客。他英俊潇洒,而且机智过人...原创 2018-03-08 13:46:39 · 249 阅读 · 0 评论