资源列表
zhan
- 1) 建立栈并进行一些元素入栈，实现链栈的建立及入栈的基本操作； (2)实现某些元素的出栈，实现链栈的出栈的操作；(1) set up the stack and carry out some elements into the stack, to achieve the establishment of the chain stack and the basic operation of the stack; (2) the stack of some elements can be re
数据结构
- (1)建立链队列，并实现一些元素入队，实现链队列的建立和入队的基本操作； (2)实现某些元素出队，实现链队列的出队的基本操作((1) the establishment of the chain queue, and realize some basic elements into the team, and the team operation to achieve the establishment of the chain queue; (2) to realize some elem
tingchechang
- 问题描述： 设停车场是一个可停放n 辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆达到时间的先后顺序，依次由北向南排列（大门在最南端，最先达到的第一辆车停放在车场的最北端），若车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后进入的车辆必须先退车车场为它让路，待赶辆车开出大门外，其它车辆在按原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短叫纳费用。试为停
shu
- 大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)
哈弗曼树6.0
- Huffman编码及译码。 1．掌握二叉树的二叉链表存贮结构。 2．掌握Huffman算法。(Huffman tree building, encoding and decoding)
07 - Linked Lists
- As we saw in the previous unit, one way to implement the list ADT was with an array. An alternate approach is what's called a linked list, a.k.a. a pointer-based list
10 - Stacks
- the ADT we have come up with is a well known ADT called a stack, which is defined by our four operations
20163311_李颖__16计科2班_数据结构与算法实验2
- 数据结构链表的8个实验，约瑟夫环，一元稀疏多项式计算器，将元素X插入到链表中的适当位置，删除链表中所有大于mink且小于maxk的元素，就地逆置，删除线性表A中同时出现在表B和表C中的结点，构造三个循环链表，长整数的四则运算(8 experiments, data structure of Joseph ring, one dollar sparse polynomial calculator, the X element into the appropriate location in the
Huffman
- 实现哈夫曼编码,C语言实现，单文件直接编译运行。注册开通用，垃圾作品，课程作业(huffman coding The realization of Huffman encoding, C language, single file directly compile and run. Registered with the opening, trash, course work)
newOne
- 数据结构的p267-10,p272-1,p278-4,p287-2,p296-1,p301-4,p323-5可能有用的一个解法(DataStructure Page 267 subject 6)
StudentList
- 基于VS的一个简单的单向链表算法，可以添加、删除节点(A simple linked list algorithm based on Visual Studio)
josephus
- 通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and final