资源列表
Stack
- 1.使用栈完成一个字符串的逆序输出 2.使用该栈完成表达式的括号是否匹配? 3.对数学表达式求值-1 Using the stack in reverse order to complete a string of output 2. Use the stack to complete the expression in parentheses match? 3. Evaluates mathematical expressions
1
- 数据结构，线性表的基本操作及调试，长度20个字-Data structures, basic operations and commissioning of the linear form, the length of 20 characters
Binary-Tree
- 生成二叉树，前序、中序、后序遍历二叉树。可以使用菜单选择。-Generate binary tree, preorder, inorder, postorder tree traversal. You can use the Select menu.
main
- 动态建立一个哈夫曼树，文件都在一个main文件夹里-Dynamic build a Huffman tree, file in a main folder
stack
- 输入一个从小到大的顺序链表,执行相关操作,然后输出该链表的倒序序列.-The order list to enter a large, implementation of the relevant operation, reverse sequence and then output the list.
Knapsack-problem
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-Knapsack problem
WuBan
- 男士们和女士们各自排成一排 跳舞开始时，依次从男队和女队的队头上各出一人配成舞伴。 若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。-Assuming at the weekend party, men and ladies entering the ballroom, each lined up. When dancing began, followed by men s
suanfa
- 西安电子科技大学软件学院算法导论课件 算法设计 以及理论-algorithem system
BigInt
- 采用数组存储方法来计算大数据的四则运算及乘方-Using an array of large data storage method to calculate the four computing and power
Currency
- 通过学习数据结构实现圆角分的计算规则实现圆角分之间的加减兑换-Fillet of addition and subtraction to achieve conversion between data structure is calculated by learning the rules of the fillet
graph
- 数据结构 有向图的邻接矩阵、度、拓扑算法。无向图的深度优先遍历、广度优先遍历。最小生成树-Adjacency graph data structure to the matrix, the degree of topological algorithms. Undirected graph depth-first traversal, breadth-first traversal. Minimum Spanning Tree
ybl_and_or
- Reverse Polish parenthesis + and + or achieve the realization of the principles of the understanding Reverse Polish helpful-Reverse Polish parenthesis+ and+ or achieve the realization of the principles of the understanding Reverse Polish helpful