资源列表
LIST2
- 更能很强大的链表模板，注释非常详细，对学习很有帮助-More very strong list template, comments are very detailed, very helpful
ACM
- ACM(Association for Computing Machinery )中文：美国计算机协会是一个世界性的计算机从业员专业组织，创立于1947年，是世界上第一个科学性及教育性计算机学会。ACM每年都出版大量计算机科学的专门期刊，并就每项专业设有兴趣小组。-ACM (Association for Computing Machinery) Chinese: Association for Computing Machinery is a worldwide computer practi
GrapeDeep
- 图的深度优先遍历，数据结构的很重要的一个内容，也很有难度，与大家分享-Graph depth-first traversal of the data structure is an important content, but also very difficult to share with you
GraphPackage
- JAVA数据结构图的遍历，和一些图的接口-JAVA data structure traversal, and some map interfaces
treasure
- 寻宝问题 动态规划算法 原理同0/1背包问题-Treasure Hunt with the principles of dynamic programming algorithm problems 0/1 knapsack problem
princess_1
- 骑士救公主（问题本质为迷宫问题） 地图由‘.’ ，‘#’，n(0≤n≤9)三种符号构成，‘.’表示平地骑士可以进入，‘#’表示陷阱骑士不能进入，n表示该方格有一个生命力为n的怪物，骑士需要花费n秒时间才能消灭它。 -Knight rescue the princess (nature of the problem for the maze problem) map by the ' .' ,' #' , N (0 ≤ n ≤ 9) constitute the
text_match
- 常用字符串匹配算法的C语言实现，KMP、KR、BM等-String matching algorithms used C language, KMP, KR, BM, etc.
1
- 利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi，它的总价值为Pi，假定M、Wi、Pi均为整数。设计程序给出装货方法，使装入背包的货物总价值达到最大。-Greedy strategy to solve the knapsack problem using. Current load of M kg backpack and n kinds of goods. First i kind of cargo weight Wi, its total value of
406109070313
- 行编辑器，数据结构课程设计，通过串实现基本操作，插入删除等-Line editor, data structures, curriculum design, implement basic operations through the string, insert and delete
Heaps
- a heap class + program wriitten in c++. it implements a max heap
BST-Iterative
- a binary search treee impplementation using c++. it is implemented in iterative way
transform_matrix
- 是数据结构中常用的程序，这个程序能够实现稀疏矩阵的快速转置-Data structure is commonly used procedures, which enables fast sparse matrix transpose