资源列表
MOUSEFINDWAY.rar
- 传统的老鼠走迷宫程序 通过堆栈来实现的 C++ 程序,little mouse find the right way in a maze
Josephus.rar
- 编号为1，2，3，……，n的n个人按顺时针方向围坐一圈。任选一个正整数作为报数上限m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。,Numbered 1,2,3, ... ..., n of n individuals according to a clockwise direction around a circle. Choose a positive integer as the
datasructure.rar
- 严蔚敏的数据结构源码及演示系统，有助于形象直观的学习数据结构,YAN Wei-min source of the data structure and presentation systems, the study will help the image of intuitive data structure
二叉树结点算法源程序
- 根据一棵二叉树结点的先根序列和中根序列构造该二叉树，并输出该二叉树的后序遍历结果。,According to a binary tree the root node of the first sequence and the sequence structure of the tree root and post the output of the binary tree traversal results.
stack.rar
- 顺序栈，应该是正确的，包含他的头文件和cpp,The order of the stack, it should be correct, including his head files and cpp
ACM.rar
- ACM比赛解题报告,包括hdu1880、zoj1010、zoj1015，为原创的报告，算法不一定最优的,ACM problem-solving competition, including hdu1880, zoj1010, zoj1015, for the original report, the algorithm does not necessarily optimal
zoj_1004_Anagrams_by_Stack.rar
- zoj 1004 的题目，这是一个经典的水壶倒水问题，题目中没有要求最少的次数倒满水，所以还可以不用bfs，本题用了bfs,zoj 1004 topics, this is a classic problem of water pouring money down the drain, the title does not require a minimum number of filling water, so it can be bfs, the title used bfs
hugeintplus.rar
- 100位的大整数加减法.输入格式可以任意,要带符号+ -,不带或者只有一个带都可以.允许输入的数前面有多个0(可以超过100).,Big Integer Plus and minus.
List.rar
- 单向链表的标准c++实现范例 数据结构 面向对象 生成函数 复制函数 赋值函数 操作符重载,The standard one-way linked list c++ to achieve an example of object-oriented data structure constructor function Copy function overloaded assignment operator function
sort.rar
- 由C++实现的各种排序算法，包括直接插入排序、希尔排序、冒泡排序、快速排序、选择排序等,By the C++ to achieve a variety of sorting algorithms, including the direct insertion sort, Hill sort, bubble sort, quick sort, selection sort, etc.
MapGuide.rar
- 超强寻找最短路径和全部结点遍历。用了GDI显示。,Super find the shortest path and all nodes traversal.
Prim.rar
- 用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树,With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree