资源列表
Binary-tree
- 用C语言实验数据结构中的二叉树的建立，先序排列，及统计叶子节点数-Experiments with the C language data structures in the establishment of a binary tree, the first order arrangement, leaf nodes and statistics
stack
- 用C语言实现了数据结构中栈的有关算法，包括初始化顺序栈，插入元素，删除栈顶元素，取栈顶元素-In C language to implement the stack data structure algorithms, including the initialization sequence stack, insert elements, remove the top element, take the top element
Node
- 用C语言描述数据结构中单链表的有关算法，包括建立，插入，删除，销毁链表-In C language to describe the data structure in a single linked list of the algorithms, including the establishment, insert, delete, destroy list
the-problem-of-stones-combined
- 用动态规划方法解决了石子合并问题 在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。-Using dynamic programming methods to solve the problem in a circular stone consolidation around the playground placed n heap stones. Stones are to be comb
stones-combined
- 动态规划法是求解最优化问题的一种方法，该文主要研究其求解问题的基本思想及具体步骤，详细分析其用于石子合并问题上的算法设计，并给出其算法实现。-Dynamic programming to solve optimization problems is a method of solving the problem of its major research paper the basic ideas and concrete steps, a detailed analysis of the me
Huffman_code
- 霍夫曼编码实现，实现了8位数据输入的霍夫曼编码-Huffman coding to achieve, to achieve the 8-bit data input Huffman coding
mi
- 控制迷宫，输迷宫的矩阵，输入从第几行开始，从第几行结束-Control of the maze, the maze of transmission matrix, enter the first few lines from the beginning, the first few lines from the end of
freebook-Ullman
- 《Mining of Massive Datasets》，作者：Anand Rajaraman-《Mining of Massive Datasets》，作者：Anand Rajaraman.........
AD
- algorithms and data structures = programs
KMP
- 串的匹配KMP算法，模式串的Next函数值-KMP string matching algorithm, mode string function value of Next
Order-circular-queue
- 数据结构支持的顺序循环队列，包含入队出队，取队头，清队，显示队列-The order cycle data structures to support queues, including a team into the team, take the first team, clean team, display the queue
Chain-queue
- 数据结构支持的链式栈，包含入栈，出栈，取栈顶，显示栈，清空栈-Queue data structure to support the chain, including into the team, a team, take the team first, display the queue, the queue empty