资源列表
bellman
- 贝尔曼算法，可以看看，这是我的课程设计的作品呢，有问题可以指导我下-Bellman algorithm, you can look at my course design work, the problem can guide me to the next
Dijkstra
- 迪特斯特拉算法，课程设计的作品，主要计算站点距离的吧，可以-Dieter Stella algorithm, distance course design work, the main computing sites can look
hash.tar
- 一个简单的 hash 算法的源代码，很实用，可以用在很多地方。-A simple hash algorithm source code, very practical and can be used in many places.
java_linker
- java链表操作：查找、删除和插入。 自己写的，编译已经通过-java linked list operations:search, delete and insert. Write it by my own, the compiler has passed.
222
- 学生管理系统，使用二叉树，使用广度优先遍历-Student management system
DeleateSubList
- 自行设计随机生成n=30的S串；实现删除子串算法Deletestr（sqstr s，sqstr sub）；分析T（n）；讨论s=’aaa….abbb….b’，sub=’ab’的执行结果。-Design their own randomly generated n = 30 S-string Delete the substring the algorithm Deletestr (sqstr s, sqstr sub) analysis of T (n) discussion s =
ZeroOnePack
- 分支界限法求解0-1背包问题。有N件物品和一个容量为V的背包，第i件物品的费用是c[i]，价值是w[i]，求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。-Branch and bound method for solving 0-1 knapsack problem. N items and a capacity V of the backpack, the cost of items i C [i], the value of W [i], the sum of
MultidimensionalPointer
- C中通过指针和数组名操作二维数组的区别与联系详细说明-Describe operating differences and relations of the two-dimensional array by pointer and array name in C
shujujiegou
- 数据结构的一些讲义和示例源码，适合初学者系统学习-Some of the data structure handouts and sample source code
Link
- 本例提供了一个单链表操作，可实现单链表的就地逆转和排序-This example provides a single linked list operation, can achieve a single linked list situ reversal and sorting
ZJUACMQandA
- ZOJ上的一些题目的问答整理，方便想要学习的人-Questions and answers of some of the topics on the ZOJ, finishing the convenience of people who want to learn
json
- JSON 编码解码,实现各大网站的JSON 返回数据处理-JSON encoding and decoding