-
arm 课件,写的十分好,值得一看,第2章
arm 课件,写的十分好,值得一看,第2章-arm courseware, written in a very good, worth a visit, Chapter 2
- 2022-03-13 13:38:43下载
- 积分:1
-
本电子书籍介绍JBOSS4高级配置与管理核心技术
本电子书籍介绍JBOSS4高级配置与管理核心技术-electronic books on the JBOSS4 advanced configuration and management of the core technology
- 2022-03-16 19:28:28下载
- 积分:1
-
matlab教程,比较经典的教材,说什么没有用,不过就是英文的...
matlab教程,比较经典的教材,说什么没有用,不过就是英文的-Matlab Guide, compared to the classic textbook, saying that no use, but English is the
- 2023-05-09 19:10:04下载
- 积分:1
-
关于手臂的几篇文章。每个人的股份,unix_linux。
About arm several articles. . Everybody shares ,Unix_Linux-About arm several articles.. Everybody sh ares, Unix_Linux
- 2022-03-10 16:01:27下载
- 积分:1
-
conquering Ajax/Shi Wei Wei, Zhang Bei compile ISBN : 7
征服Ajax/施伟伟, 张蓓编著
ISBN号: 7-115-14706-X
出版发行项: 北京-人民邮电出版社 2006
-conquering Ajax/Shi Wei Wei, Zhang Bei compile ISBN : 7-115-14706-X-publishing : the Beijing-People"s Posts & Telecommunications Publishing House 2006
- 2022-03-20 20:32:18下载
- 积分:1
-
人事管理系统的源代码,公司人事管理系统源码…
人事管理系统源代码,公司人事管理系统源代码,公司人事管理系统源代码
- 2022-08-08 18:27:34下载
- 积分:1
-
Visual C#高级编程范例
Visual C#高级编程范例-Visual C# high-level programming paradigm
- 2022-03-21 00:36:52下载
- 积分:1
-
labview control and simulation
labview control and simulation-PC control and simulation
- 2022-04-09 01:39:47下载
- 积分:1
-
精彩编程百例1~25例,其中有数学曲线,查看计算机硬件,文件统计程序,hook程序记录鼠标与键盘,透明窗体的设计等等!...
精彩编程百例1~25例,其中有数学曲线,查看计算机硬件,文件统计程序,hook程序记录鼠标与键盘,透明窗体的设计等等!-100 cases a brilliant programming to 25 cases, of which mathematical curve View computer hardware, document statistical procedures, hook procedures record keyboard and mouse and transparent forms of design and so on!
- 2022-07-02 03:57:04下载
- 积分:1
-
用堆栈实现迷宫求解问题
基本思想:
若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。
求解迷宫...
用堆栈实现迷宫求解问题
基本思想:
若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。
求解迷宫问题的简单方法是:从入口出发,沿某一方向进行探索,若能走通,则继续向前走;否则沿原路返回,换一方向再进行探索,直到所有可能的通路都探索到为止。
为避免走回到已经进入的点(包括已在当前路径上的点和曾经在当前路径上的点),凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.
- 2022-03-21 17:16:01下载
- 积分:1