参考:http://topic.youkuaiyun.com/t/20051001/17/4305285.html
const char *strstr(const char *src, const char *needle);
输入src, 寻找里面是否有子串needle
const char * _strstr(const char *src, const char *needle)
{
const char *p1, *p2;
p1 = src;
p2 = needle;
while (*src != '\0' && *needle != '\0')
{
if (*src++ != *needle++) {
needle = p2;
src = ++p1; //从下一个字符开始搜索needle
}
}
if (*needle == '\0')
return p1;
return NULL;
}
改进上面的:
const char * _strstr(const char *src, const char *needle)
{
const char *p1, *p2;
p1 = src;
p2 = needle;
while (*src != '\0' && *needle != '\0')
{
if (*src++ != *needle++) {
needle = p2;
p1 =src; //从当前字符开始搜索needle
}
}
if (*needle == '\0')
return p1;
return NULL;
}
调用:
_strstr("abcdefcdfetsk", "cdfe");
int i=0,j=0;
if (strlen(src) <strlen(needle)) return NULL;
while(*(src+i) && *(needle+j))
{
if(*(src+i)==*(needle+j))
{
i++;j++;
} else {
i=i-j+1;j=0;
}
}
return (j> 0)? (src+i-j) : NULL;