▍1. maxmatch
通过对词库进行降序排序,提出窗口的思想,按正向最大匹配的方式进行分词,实现了长词优先。(By thesaurus descending order, proposed the idea of the window, according to the way forward maximum matching word, to achieve a long-term priority.)
通过对词库进行降序排序,提出窗口的思想,按正向最大匹配的方式进行分词,实现了长词优先。(By thesaurus descending order, proposed the idea of the window, according to the way forward maximum matching word, to achieve a long-term priority.)
退火算法实现0/1背包问题求解,java编写,eclipse中编写,工程文件齐全,界面清楚,运行结果正确(Annealing algorithm to achieve the 0/1 knapsack problem solving, writing java eclipse write engineering documents, clear interface, the results are correct)
说明: The famous Collatz sequence is generated by a method decribed as follows. Given a positive integer N, if it is odd, then replace it with 3*N+1. For even number N, use N/2 instead. You can get a sequence of number by this method. It is conjectured that the algorithm above will terminate at 1 for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.) (Input The first line contains a single integer T tells that there are T cases in the problem. Then for each case, there is an integers N. Output For each number N, output the sequence generated in a line, using coma as its separator. )
自定义链表,实现入队、出队、新建、判断是否为空(Custom linked list into the team, the team, the new, the judge is empty)
简单快速排序实现,采用Junit框架进行测试,保留了一些必要的注释(Utilize a unit testing framework of your choice to test your code. Submit a copy of the code to test, the test cases generated and an output report (screen shot from the tool).)
实现哲学家算法模拟,出现死锁和不会出现死锁的情况(Philosophers algorithm simulation)
本代码实现了最简单的走迷宫算法,迷宫是一个二维数组,暂时没实现自动生成迷宫,只是实现了自动找到出口的一个算法,感兴趣的可以下载下来研究,说不定会带给你一些灵感。(The source implementation of the easiest maze algorithm, the maze is a two-dimensional array, temporarily not automatically generated maze, just an algorithm to automatically find the export interested can download the study, and could give you some inspiration.)
java版的数据结构,主要介绍了java中一些常见的数据结构,如链表,堆,栈还有Map等等(data struct)
哈夫曼树,即通过哈夫曼方法生成最小权值数的树,(Huffman tree, that is generated by the Huffman method the number of minimum weight tree)
数据挖掘需要用到的一些waka资料和代码(Data mining need to use some of the information and code waka)
棋盘覆盖问题 设一个n*n棋盘,n=2k,用L 型条块覆盖棋盘中除一个指定方格外的所有方格,每个L型条块可恰好覆盖3 个方格。 实验内容:设计分治算法实现棋盘覆盖,要求图形化。(Board covering the establishment of a n* n chessboard, n = 2k, with the L-slice coverage for a specified board, in addition to all the extra square grid, each slice can be exactly covered by L-3 grid. Experiment: Design of the board covering the partition algorithm to require graphic.)
可计算理论与逻辑,详细描述了可计算理论,对于数据结构的把握有更深了解(computability and logic)
分布式系统停车场问题:某停车场共有TOTAL-NUM个车位, ENTRY-NUM个入口, EXIT-NUM个出口. 现需要一个用于停车场控制汽车进出的分布式系统, 在该系统中没有集中的管理者(central server), 每个进(出)口通过通信平等协商保存当前车库的状态信息(如空闲车位数UNOCCUPIED-NUM等), 并据此决定是否允许车辆进入, 为简便计, 假定通信是可靠的.(Parking issues distributed systems: A total of TOTAL-NUM parking spaces, ENTRY-NUM entrance, EXIT-NUM export. Is the need for a used car out of the car park of the distributed control system, the system does not focus on manager (central server), for each import (export) through consultations on an equal footing Communication garage to preserve the current status information (such as the number of free parking spaces UNOCCUPIED-NUM, etc.), and, accordingly, whether or not to allow vehicles to enter, for the simple, the assumed that the communication is reliable.)
自己编写的一个小算法 用于weka中,数据预处理(I have written for a small weka algorithm, the data pre-processing)