-
《编程之美》随书源代码(第四部分,完)第4章
数学之趣
――数学游戏的乐趣...
《编程之美》随书源代码(第四部分,完)第4章
数学之趣
――数学游戏的乐趣
-" The Beauty of Programming," With the source code for the book (Part IV, End) Chapter 4 Math Fun- Fun Math Games
- 2022-03-19 05:22:38下载
- 积分:1
-
Learning, in learning to learn the source code vb
学习,在学习vb学习源代码-Learning, in learning to learn the source code vb
- 2023-03-28 06:50:04下载
- 积分:1
-
Based on asp.net under the C# development skills, application development highli...
基于asp.net下的C#开发技巧,应用开发集锦。-Based on asp.net under the C# development skills, application development highlights.
- 2022-08-09 08:44:24下载
- 积分:1
-
这是一本美国计算机专业研究生必修的计算机网络课的电子书。...
这是一本美国计算机专业研究生必修的计算机网络课的电子书。-This is the textbook of Computer Networks, especially for master students whose major is Computer Science.
- 2023-07-23 05:10:05下载
- 积分:1
-
GNU make Version 3.79中文版,方便进行linux源码阅读和Linux下的编程...
GNU make Version 3.79中文版,方便进行linux源码阅读和Linux下的编程-GNU make Version 3.79 version. facilitate reading and linux-source Linux Programming
- 2022-05-08 00:00:56下载
- 积分:1
-
j2me polish教程,谢谢关注
j2me polish教程,谢谢关注-j2me polish tutorial
- 2023-03-15 00:05:04下载
- 积分:1
-
This is a beginners C for good material. Book is the third edition of the Englis...
这是一本对于C++初学者的好教材。书本是第三版,英文版的教材-This is a beginners C for good material. Book is the third edition of the English-language teaching
- 2023-08-25 20:35:03下载
- 积分:1
-
聊天程序,很好的,大家可以多多学习啊,
聊天程序,很好的,大家可以多多学习啊,-chatting procedures, very good, we can learn more ah that the word
- 2022-01-22 15:55:07下载
- 积分: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
-
Free BSD
free BSD
- 2023-01-06 10:45:04下载
- 积分:1