资源列表
BiTree
- 二叉树，输入先序和中序，输出后序，比较简单，适合初学者-Binary tree, the first input sequence and in sequence, the output sequence, is relatively simple, suitable for beginners
JAVA-experiment-5
- 1、编写一个名为“复数”的类，包含复数的实部和虚部(数据成员），以及复数之间的基本算术运算：加、减（方法成员），并要求复数加减运算，程序运行中能对给定的复数进行运算，并打印运算的结果。-1, the preparation of a " plural" , contains the real part and imaginary part (data members), as well as the complex between the basic arithmetic ope
The-experiment-input-output-stream
- (1) 掌握一般类型数据的输入输出格式控制方法。 (2) 掌握重载“<<”和“>>”的方法。 (3) 掌握对文件的输入输出操作方法。 -(1) to grasp the general types of data input and output format control methods. (2) master overloaded " < < " and " > > " . (3) master file
The-experiment
- 某学校对教职工每月工资的计算规定如下：专职教师固定工资2000，再加上课时补贴20元/课时；行政人员只有固定工资3000元/每月；兼职教师只有课时补贴50元/课时。-A school staff monthly wage calculation rules are as follows: fixed salary of full-time teachers, plus a subsidy of 20 yuan/class class administrative staff a fixed s
Data-structure.pdf
- 北京大学，数据结构问题集，为数据结构与算法学习有困难的学生提供一个很好的学习材料-Peking University, data structures, problem sets, data structures and algorithms with learning difficulties of students with a good learning materials
NYOJ.290.DictionaryTree
- 字典树，Trie树，查找插入效率都很高的一种高级数据结构。-Dictionary tree, Trie, an advanced data structures to find the insertion efficiency high.
keshe
- 家族二叉树的相关操作，可以很好的管理家谱-Family of binary tree operation can be well managed family tree
diannaoshu
- 电老鼠走迷宫程序，可以完整的跑下来，大家可以试一试-Electric mouse maze procedure, a complete run down, we can try
004
- 关于回溯算法的程序实现，也是解决连续邮资问题的代码实现-this is gbout Program on the backtracking algorithm, it also solves the problem of continuous postage code
003
- 贪心算法的应用，以及哈夫曼编码的计算实现。-Greedy algorithm applications, as well as the calculation of the Huffman coding.
haxbiao
- 哈希表的应用举例，包括哈希表的在几种程序的的应用-Examples of the application of the hash table, including the hash table in several programs
Bag
- 0-1背包问题的解答,0-1背包问题的一个简单的解答，算法不是很好，蛮力算法-0-1 knapsack problem answers to the 0-1 knapsack problem with a simple answer, the algorithm is not very good, the brute force algorithm