搜索资源列表
hafuman
- 输入一个有n个叶结点的权植构造一棵哈夫曼树:(例如:n=8,权植为 5 29 7 8 14 23 3 11)根据哈夫曼树构造哈夫曼编码,用指向字符串的指针数组来存放,用叶子到树根逆向求每个结点的哈夫曼编码.
链表相关编程
- 创建一个链表，逆向输出链表，两个链表的合并的vc程序编程实现代码。-create a linked list, reverse output chain and the two combined Chain vc programming code to achieve.
jose
- jose问题用双向链表实现，可以正向逆向数数，可以控制最后的获胜人数，可以自己定义起始位置，从哪里开始-jose problem with the realization of two-way linked list, you can forward reverse count, you can control the number of final victory, you can define their own starting position, from where to start
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the r
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the roo
PEiDv0.94
- 逆向工程分析利器，主要用与算法解密-Tool for reverse engineering analysis, and algorithm is mainly used to decrypt ~~~~~~~~~~~~~~~~~~
kuaisuzuanzhi
- 利用数据结构的设计思想，来实现转置，将一组数据逆向输出，从而实现快速转置-The use of data structure design concept to achieve transpose, will reverse a set of data output, in order to achieve fast transpose
Huffmancode1
- 按照一定的规则构造哈弗曼树，使得输入的元素都作为叶子节点，然后从叶子到根逆向球每个字符的哈弗曼编码-According to certain rules of construction Havermann tree, making the input element as a leaf node, and then reverse the ball from the leaf to the root code for each character Havermann
program
- 逆向建立了单链表,并用同样方向进行就地倒置-Reverse established single-strand libraries, and use the same direction for on-site inverted..
elevator
- 核心部分为电梯调度控制台。控制台拥有电梯状态及电梯工作任务队列同时负责电梯任务的分配。任务分为二种，外部按钮任务和内部按钮任务。 外部按钮任务需要先寻找最佳来执行这项任务的电梯，根据任务和电梯当前的运行状态来判断，又有以下四类：1、电梯同向可以执行；2、电梯空闲；3、电梯逆向；4、电梯同向不可执行。判断顺序即为1、2、3、4。判断任 务属于哪一种类型，按照该类型特点插入任务队列。 内部按钮已经制定执行电梯，因此需判断执行方向后插入队列即可。 当警报按钮按下时候，清空所有队列任
WordSegment
- 用C++开发的分词系统 运用基于哈希的逆向最大匹配算法 基于词典-Word in C development system uses a hash-based reverse maximum matching algorithm is based on dictionary
060405113519
- 用set容器进行排序的示例函数，可以实现快速的正向，逆向排序，根据类的元素来作为排序依据。-Use the example set containers to sort function, can achieve rapid positive, reverse order, according to the type of element to order as the basis.
huffman
- Huffman编码的关键点是构造一棵Huffman树。其过程是： 1.输入各个叶子节点及其频率，对每个节点的lchild, rchild, parent分别赋初值为0； 2.选择parent为0，且fre最小的两个节点开始建Huffman树，再修改相应节点的lchild, rchild, parent值，如此重复直到Huffman树建立。 3.从叶子到根逆向求每个节点的Huffman编码。 4.解压时，由于Huffman编码是前缀编码，即任一字符的编码都不是
addTwoNumbers
- Leetcode练习，将两个非负整数相加，整数一字符串的形式保存，逆向存储。要求得到的结果也是字符串。-You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a li