资源列表
cengcibianli
- 运用层次遍历的方法输出从根节点到每个叶子节点的逆-The method of using traverse the level output the root to each leaf node inverse
hafumanshu
- 构造哈弗曼树，输出对应哈夫曼编码和平均查找长度-Huffman tree structure, the output of the corresponding Huffman coding and the average length
calculator-2.1
- 利用堆栈实现的计算器，支持各级运算、sin、cos、阶乘、括号等。-Use the stack to achieve the calculator, support, sin, cos, operation at all levels, such as factorial brackets
ggggg
- 01背包算法的仿真与动态演示，非常好，对数据结构的理解有帮助。-01 knapsack algorithm simulation and dynamic demonstration, very good, to understand the data structure help.
morphology-analysis
- 词法分析器，将我们编写的文本代码解析为一个个记号，分析得到的记号供后续语法分析使用-morphology analysis，transform text to mark,and the mark can be used for subsequent grammer analysis
yufafenxi
- 在词法分析的基础上将单词序列组合成各类语法短语-word will be combined into grammer phrase on the basis of morphology analysis
PreOrderTree
- 数据结构树的初步实现 写了迭代器 还有树的先序遍历 但是iterator 的operator 没有实现-Preliminary data tree also wrote a tree traversal iterator iterator s operations but did not realize operator
LeetCode
- LeetCode题解（java版） 包含toi，strstr，add two num，括号匹配，字符串乘法，通配符匹配，文件路径简化，Text Justification，反转单词-LeetCode solution to a problem (java version) contains toi, strstr, add two num, bracket matching, string multiplication, wildcard matching, simplify file pa
carparar
- car parking in c/c-car parking in c/c++
Floyd
- Floyd算法又称为，插点法，是一种用于寻找给定的加权图中多源点之间最短路径的算法。C++实现-Floyd algorithm is also known, interpolation point method for finding the shortest path is a weighted figure given between multiple source algorithm. C++ achieve
uart-PWM
- MSP430的串口调试PWM，通过UART接口调试PWM输出任意波形的演示程序。-MSP430 UART PWM
electron-make-future
- In the next example, TEX would process the /mycat/mypgm file searching for the !hello2 label(*). TEX would continue processing until an exit statement or end of file was reached. An error would be thrown if a return statement was d and there were no