Rosalind编程问题之计算错误矩阵（failure array）输出前后缀检索匹配。 Speeding Up Motif Finding Problem： A prefix of a length n string s is a substring s[1:j]; a suffix of s is a substring s[k:n]. The failure array of s is