暴力解法
class Solution {
public:
int strStr(string haystack, string needle) {
if(!needle.size())
return 0;
if(needle.size()>haystack.size())
return -1;
int i=0;
for(;i<haystack.size()-needle.size()+1;i++)
{
int j=0;
while(j<needle.size())
{
if(needle[j]==haystack[i+j])
++j;
else
break;
}
if(j==needle.size())
return i;
}
if(i<haystack.size()-needle.size())
return i;
else
return -1;
}
};