摘要： 一，基本模式匹配算法#include#include using namespace std;int main(){ char str1[] = "abchelloefg"; char str2[] = "hello"; int i = 0, j = 0, flag = 0, len1 = strlen(str1), len2 = strlen(str2); for (i = 0; i using namespace std;const int N = 100;void setNext(char *str, int len, int *next){ ne 阅读全文