KMP算法的具体实现，能够在O(n+m)时间内找出字串在父串中的位置，n为父串长度，m为字串长度-KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length