1.前缀蛮力匹配算法(linux内核string.h)
char* strstr(const char *s, const char *wanted) { const size_t len = strlen(wanted); if (len == 0) return (char *)s; while (*s != *wanted || strncmp(s, wanted, len)) if (*s++ == '
1.前缀蛮力匹配算法(linux内核string.h)
char* strstr(const char *s, const char *wanted) { const size_t len = strlen(wanted); if (len == 0) return (char *)s; while (*s != *wanted || strncmp(s, wanted, len)) if (*s++ == '