资源列表
vijos-1180
- vijos 1180 动态规划。欢迎各种交流讨论。-dynamic programming vijos 1180. Welcome to the various exchanges and discussions.
UVA-5002
- UVA 5002 动态规划。欢迎各种交流讨论。-UVA 5002 dynamic programming. Welcome to the various exchanges and discussions.
UVA-4996
- UVA 4996 非常好的一道动态规划题目。欢迎各种交流讨论。-Very good UVA 4996 a dynamic programming topics. Welcome to the various exchanges and discussions.
POJ-1170
- POJ 1170 动态规划。欢迎各种交流讨论。-POJ 1170 dynamic programming. Welcome to the various exchanges and discussions.
traver
- 编写算法完成下列操作：无重复地输出以孩子兄弟链表存储的树T中所有的边（这里的边是指树T本身的分支，而不是孩子兄弟链表所形成的二叉树的分支）。输出的形式为（k1, k2）, ..., (ki, kj), ..., 其中，ki和kj为树结点中的结点标识。-Write an algorithm to do the following: no repeat output to all sides in children the brothers linked list storage tree T (
delet1
- 编写递归算法：对于二叉树中每一个元素值为x的结点，删去以它为根的子树，并释放相应的空间。-Write a recursive algorithm: the value for each element in the binary tree node x, by deleting sub-tree root and release the appropriate space.
The-data-structure
- 一个数据结构的课件加上一个习题集，对学习数据结构的同学有帮助。-A data structure courseware with a problem sets, students learning data structures.
hunhegaosi
- 针对智能交通系统中运动目标检测阶段存在的不足，提出了一种基于自适应混合高斯模型（ＧＭＭ）的改进算法。-For the deficiencies of the intelligent transportation system moving target detection stage, an improved algorithm based on adaptive Gaussian mixture model (GMM).
Large-integer-factorial
- 采用visualC++实现大整数阶乘算法,适合参加ACM和蓝桥杯的同志学习-Learn from Comrade large integer factorial algorithm visualC++ suitable to participate in the ACM and Blue Bridge Cup
json
- JSON 编码解码,实现各大网站的JSON 返回数据处理-JSON encoding and decoding
ZJUACMQandA
- ZOJ上的一些题目的问答整理，方便想要学习的人-Questions and answers of some of the topics on the ZOJ, finishing the convenience of people who want to learn
Link
- 本例提供了一个单链表操作，可实现单链表的就地逆转和排序-This example provides a single linked list operation, can achieve a single linked list situ reversal and sorting