参考2015年深圳杯数学建模B题，在给定DNA序列的情况下，为k-mer建立索引，表头为顺序表，每个结果用链表存储，查找速度极快，但是比较消耗内存-Reference 2015 Shenzhen B cup mathematical modeling problems, in the case of a given DNA sequence, established as a k-mer indexing, the first table of the order form, each result using chain store, find fast, but more memory consumption