当比对每个字串时从右边开始匹配...# stdlib.h# stdio.h# .h/*Show usage*/void usage(char * prog){ prf(\"Usage: %s text pattern\\n\", prog); exit(123);}/*Get dist for \'a\' to \'z\'*/void bm_dist(char... [阅读全文]

这是个有个性算法他两位提出者都是Turing奖获得者.:)基本思想就是把串映射成个值指纹Hash...但是text太大时候预处理时间也是得考虑进来~不过最坏时候也就和平凡算法样了(还可能更坏吗...)# stdlib.h# stdio.h# .hvoid usage(char * prog){ prf(\"Usage: %s text pattern\\n\",... [阅读全文]