给你A,B两个字符串，检查B串是否是A串的子串，类似于Java的String.indexOf("")。找到匹配失败时的最合适的回退位置，而不是简单的回退到子串的第一个字符（常规的枚举查找方式，是简单的回退到子串的第一个字符，KMP算法的性能分析Java实现实例）*此仅供大家参考、交流，希望对大家有所帮助！-Here you are A, B two strings to check whether string B is a sub-string A string, similar to Java' s String.indexOf (" " )。 Match fails to find the most appropriate position back, rather than simply return back to the first sub-string of characters (the enumeration of conventional search methods are easy return back to the first substring of characters, KMP algorithm Analysis of examples of Java implementation)* This is for your information, communicate, and they hope to be helpful to everyone!