计算Boyer-Moore字符串搜索算法中的第二个（不匹配）表

For the Boyer-Moore algorithm to be worst-case linear, the computation of the mis-match table must be O(m). However, a naive implementation would loop through all suffixs O(m) and all positions in that that suffix could go and check for equality... which is O(mFor the Boyer-Moore algorithm to be worst-case