GZipDemo

java的课程实验，适合初学者。 都是上java专业课时候的实际实验内容，有源码。这是第三部分(完结)(java course experiments, suitable for beginners. When specialized courses are on the java content of the actual experiment, there is source code. This is the third part (End))

Structs2+Spring+Ibatis入门(Structs2+Spring+Ibatis new study)

远程系统界面原型basic版本,后续的版本会继续上传。这是一个单机版的(Prototype code project)

说明：  Java development related books

网络爬虫小程序 有命令行版和GUI版本 （Crawler.java为命令行版本，CrawlerUI.java为GUI版本） 界面使用swing 需要Mysql数据库(Web crawler applet command line version and GUI version (Crawler.java the command line version, CrawlerUI.java GUI version) requires Mysql database interface using swing)

Test the class {@code com.android.dx.util.Bits} for Java.

说明：  CH430驱动程序,USB驱动程序，单片机串口(CH430This depends on the implementation and the device)

Andorid 5 for beginer devlopers.

Wicked Cool Java contains 101 fun, interesting, and useful ways to get more out of Java. This isn’t intended as a Java tutorial–it’s targeted at developers and system architects who have some basic Java knowledge but may not be familiar with the wide range of libraries available. Full of example code and ideas for combining them in useful projects, this book is perfect for hobbyists, and professionals will find tips and open-source projects to enhance their code and make their jobs easier. Topics include converting a non-XML text structure into XML using a parser generator, experimenting with a Java simulator for the Cell Matrix, creating dynamic music and sound in Java, working with open-source class libraries for scientific and mathematical applications, and many more.

直接运行compile.bat和run.bat即可 使用了3种分词方法： 1.正向最大匹配(ForwardMatch.java) 2.逆向最大匹配(ForwardMatch.java) 3.最大频率匹配(FrequencyMatch.java)(默认) 取频率最高的词，然后两端递归，构建二杈树存储句子中的词语，显示的时候使用中序遍历二杈树 由于极有可能单个字的使用频率比整个词还高，筛选的时候进行了处理 若单个字不处于当前句子开头，先忽略， 若单个的字处在开头，临时mostFrequency仍为0，且单词长度为1，则加入到二杈树中(Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree)