i
nt strStr( string haystack, string needle){
//先抛出两个 字符串都为空和被比较字符串haystack为空的情况
if(haystack.size() == 0 && needle.size() != 0) return -1;
if(haystack == " " && needle == " ") return 0;
int nHlength = haystack.size();
int nNlength = needle.size();
if(nHlength == nNlength)
{
if(haystack != needle)
return -1;
else
return 0;
}
if(nHlength< nNlength)
{
return -1;
}
for(int i=0;i<=nHength - nNlength; i++)
{
int flag =1;
for(int j =0; j<nNlength; j++)
{
if(haystack[i+j] != needle[j])
{
flag = 0;
break;
}
}
if(flag) return i;
}
return -1;
}