我的生活，一个不错的日记本，相信你回喜欢的！

迷宫程序,C++实现 一个用VC写的关于迷宫的程序-maze procedure, C to achieve a VC was on the maze procedure

该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.

报警信息查询系统VB+ACESS 根据某啤酒厂出现故障不同（如系统错误、负亟接地、操作错误等）计算机系统进行报警-alarm information inquiry system VB Acess under a different breweries failure (such as system error, negative urgent grounding, operational errors, etc.) for the police computer system

JavaCJavaCJavaCJavaCJavaCJavaC JavaC-JavaC

rsdfdsfs ergteyhrth trrhyt yujtyjtyjtyu57765yh tryhythtyhtr rty67rtyrt htrhtrh rtretreter tre retertertertre tretretretrey54ytgdt ertert543trdter

这是关于数据结构链表的源程序，用c++程序实现了每一个程序-this is a code of data structure

BabelKit是一个通用多语言数据库代码表的接口。它接收维护使用多语言的多个数据库代码定义集中的所有编程工作。代码管理和翻译页可以让开发人员定义新的虚拟代码表，新语言，输入所有代码和它的描述，再将它们翻译成所有相关的语言。Perl和PHP类可以检索代码描述，并自动地用用户语言生成HTML代码选择元素。这简化了Web站点及数据库的国际化和本地化。 -BabelKit is an general multi- languages databases code page connection. It receives the maintenance to use the multi- languages many databases code to define the centralized all programming work. The code management and the translation page may let the development personnel define the new hypothesized code page, the new language, input all codes and its description, translate again them all correlations the language. Perl and the PHP kind may retrieve the code description, and automatically produces the HTML code choice element with the user language. This simplified the Web stand and the database internationalization and the localization.

常用的hash算法APHash，该hash算法可以实现均衡分布，让数据均匀的分布在hash列表中-Commonly used hash algorithms APHash, the hash algorithm can achieve a balanced distribution, so that uniform distribution of data in the hash list

假设一个文件中出现了8种符号S0，SQ，S2，S3，S4，S5，S6，S7，那么每种符号要编码，至少需要3bit。假设编码成000，001， 010，011，100，101，110，111。那么符号序列S0S1S7S0S1S6S2S2S3S4S5S0S0S1编码后变成 000001111000001110010010011100101000000001，共用了42bit。我们发现S0，S1，S2这3个符号出现的频率比较大，其它符号出现的频率比较小，我们采用这样的编码方案：S0到S7的码辽分别01，11，101，0000，0001，0010，0011， 100，那么上述符号序列变成011110001110011101101000000010010010111，共用了39bit。尽管有些码字如 S3，S4，S5，S6变长了(由3位变成4位)，但使用频繁的几个码字如S0，S1变短了，所以实现了压缩。对于上述的编码可能导致解码出现非单值性：比如说，如果S0的码字为01，S2的码字为011，那么当序列中出现011时，你不知道是S0的码字后面跟了个1，还是完整的一个S2的码字。因此，编码必须保证较短的编码决不能是较长编码的前缀。符合这种要求的编码称之为前缀编码。要构造符合这样的二进制编码体系，可以通过二叉树来实现。-Suppose a file appears in eight kinds of symbols S0, SQ, S2, S3, S4, S5, S6, S7, then each symbol to be encoded, at least 3bit. Suppose encoding 000,001, 010,011,100,101,110,111. Then the symbolic sequence S0S1S7S0S1S6S2S2S3S4S5S0S0S1 encoded into 000001111000001110010010011100101000000001, sharing a 42bit. We found that S0, S1, S2 these three symbols the frequency of relatively large, the other symbols the frequency is relatively smal

数据结构电子书,清华大学出版社,严蔚敏老师-Data Structure e-books, Tsinghua University Press, YAN Wei-min Teachers