搜索资源列表
CircularQueueHeapArray
- circular queue by heap array
queue
- 数据结构实现:队列(环形数组、链式实现)的基类实现。-Data structure implementation: queue (circular array, chain to achieve) is the base class implementation.
huli
- 围绕着山顶有10个圆形排列的洞,狐狸要吃兔子,兔子说:“可以,但必须找到我,我就藏身于这十个洞中,你先到1号洞找,第二次隔1个洞(即3号洞)找,第三次隔2个洞(即6号洞)找,以后如此类推,次数不限。”但狐狸从早到晚进进出出了1000次,仍没有找到兔子。问兔子究竟藏在哪个洞里?-Peak around the circular array of 10 holes, the fox eat the rabbit, the rabbit said: " Yes, but you find me
1111
- 数组实现循环链表 准备: 1. 队列空间的大小 maxsize 2.队首指针 front 3.队尾指针 rear 4.存储方式 动态数组 运算 出队,入队,初始化队列,创建队,释放队 5.a 动态数组的首地址-Prepared to achieve an array of circular linked list: 1. Queue space the size of the maxsize 2. Team first pointer front 3. Tail
rabit
- 围绕着山顶有10个圆形排列的洞,狐狸要吃兔子,兔子说:“可以,但必须找到我,我就藏身于这十个洞中,你先到1号洞找,第二次隔1个洞(即3号洞)找,第三次隔2个洞(即6号洞)找,以后如此类推,次数不限。”但狐狸从早到晚进进出出了1000次,仍没有找到兔子。问兔子究竟藏在哪个洞里 ? -Peak around the circular array of 10 holes, the fox eat the rabbit, the rabbit said: " Yes, but you fin
CDataStruct
- 用VC实现的数据结构模板类 包括数组,普通链表,双向循环链表,哈希表,二叉搜索树,AVL 树-With VC data structure includes an array of template class, general list, two-way circular linked lists, hash tables, binary search trees, AVL trees
test12
- 约瑟夫问题,用数据结构的循环链表实现约瑟夫问题的解答-Joseph problems,30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain
polynomial
- 链式队列是不同于循环数组的另一种队列的实现形式。队列中的元素以Node形式存储。节点Node中存有此节点存于队列中的元素以及指向下一个元素的指针。链式队列的需要保存指向队头和队尾的指针的数据成员。 -Chain queue is different from the circular array queue forms. Elements in the queue to the Node form of storage. Stored in the node Node element of th
conway
- Conway宇宙模型演化模型,解决细胞分化过程,用的hash数组带删除节点回收以及头尾相连的循环链表。-Conway model of the universe evolution model to solve the cell differentiation process, using hash array delete nodes recovered with head and tail attached circular list.