资源列表
shuzu
- 这是一个实现二位数组存储的小程序，可以帮助大家学习数据结构
prim1
- 最小生成树 采用C程序编程实现的PRIM算法-Minimum spanning tree using C programming algorithm to achieve the PRIM
backpack
- 0/1背包问题（附注释）：不可拆分的0/1背包问题-0/1 knapsack problem (with Notes): non-split 0/1 knapsack problem
BiTree
- 输入一个字符串，并建成一棵二叉树，满足左子树的字符都要小于根结点的字符，右字树的字符都要大于根结点的字符，每个结点值有字符和字符的出现次数，并用三种遍历方法打印，比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。 （补充：对二叉树实现所有左右子树的交换并中序输出结果） -Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must b
bin-tree
- 二叉树类及其实现以二叉链表为存储结构实现二叉树类和成员函数， 设计计算二叉树结点、将二叉树每个结点的左右子树交换、求二叉树高度的算法-Binary tree class and its implementation to the list for the storage structure of the binary classes and member functions to achieve a binary tree, binary tree node design calculati
Bubble-method-to-improve
- 简单的冒泡法改进算法，很容易理解，可能还需要进一步完善-Simple bubble method improved algorithm, it is easy to understand, may still need further improvement
cPP
- 求解方程各种方法 迭代法 牛顿迭代 二分法 都有 c++源文件 绝对正确-Solving the equation of a variety of methods iterative method Newton iterative dichotomy has C++ source file is absolutely correct
pi
- 用概率（随机在半径为R的圆上打点，计算点在圆中和外接矩形的比值）求π的值-calculate the value of π by Probability and Statistics
helper
- 用数据结构实现文学助手，可以删除打错字符- Data structures to achieve literary assistant, you can delete the wrong character
main
- 计算闭包完全最短路径，可自由输入闭包的顶点个数-fLOYD，Calculate the complete shortest path path, the number of vertices of the free input closure
AVLTree-X
- 给出结点的插入序列，构造AVL Tree。-Given node insertion sequence, structure AVL Tree.
4Sum
- leetcode 4 Sum leetcode 4 Sum-leetcode 4 Sum leetcode 4 Sum leetcode 4 Sum