KMP算法，这是我在课后编的，能查找到所有的子串，并标记其位置，使用DEVCPP,也可以载入VC6.0工程中。先输入要查找的子串，再输入任意串，将从任意串中找到所有子串，包括重叠部分，并一一标号-KMP algorithm, which is a series of after school can find all the substring, and mark its location, use DEVCPP can also load the VC6.0 project. To enter the substring you want to find, and then enter any string, find all substrings from any string, including the overlap, and 11 labels