资源列表
CH7
- 哈希查找方法能在一段数据中以最快的方式找到想要的那个数，这种算法解决的关键就是哈系算法的建立函数。 -Hash method can search a section of data at the fastest way to find that the number of the algorithm to solve the critical line algorithm HA is set up function.
Sparse_Table_algorithm
- RMQ的sparse table算法的实现，对ACM竞赛队员非常有研究价值：）-RMQ the sparse table algorithm implementation, ACM contest for team members have research value is :)
rebuild
- 根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree
22
- 1．定义顺序栈的数据结构 2．编写函数实现的栈的初始化、入栈、出栈、判断栈是否为空的算法，并应用与表达式的括号匹配检测。 3．定义队列的链式数据结构 4．编写函数实现链队列的入队列、出队列算法-1. Stack data structure defined order 2. Write functions for the initialization of the stack, stack, stack, to determine whether the stack is empty
tree
- 该算法实现了树的另一种递归运算。摘自华科复试题。-The algorithm implements a recursive operation of another tree. From China Branch complex questions.
fieldvalues
- 函数fun的功能是计算出链表中各结点数据域中值之和，由于链表单向，利用循环从头结点开始搜索直到最后一个结点，每找到一个结点就把结点的数据域上的数据累加起来。-Function fun feature is calculated in the node list of data field values and, as a one-way linked list, nodes from scratch using loop start searching until the last node,
tree
- 实现了一个简单的二叉树的创建与遍历，包括前序，中序与后序，大家可以参考一下-Implements a simple binary tree creation and traversal
minimum-expansion-of-two-strings
- 算法设计类源代码。使用动态规划的方式计算两个字符串的最小扩展距离。-Algorithm design class source code. Calculated using dynamic programming the minimum expansion of the distance of two strings.
Josephus
- 基础问题，用循环链表实现约瑟夫问题，数据结构作业-Basic problem, the problem with the circular linked list implementation Joseph, the data structure operations
list
- 链表的一个合并算法，通过了编译，链表的合并是找工作编程中常考的内容-A list merging algorithm, through the compilation, the list is the job of merging the content of programming often test
sort
- 任意输入两个大的整数并以Q结尾，然后对输入的数字进行排序，并按从小到大的顺序输出-Enter any two large integers and Q at the end, and then sort of digital inputs, according to the order small to large output
Invest
- 数据结构中解决简单的投资问题，稍微改进即可使用-The simple investment data structure to solve the problem, can use a little improvement