class Solution {
public:
int strStr(string haystack, string needle) {
if(needle=="")
return 0;
if(needle.size()>haystack.size())
return -1;
for(int i=0;i<haystack.size()-needle.size()+1;i++)
{
if(haystack[i]==needle[0])
{
int j,k;
int temp=i;
for(j=0,k=i;j<needle.size();k++,j++)
{
if(haystack[k]!=needle[j])
break;
}
if(j==needle.size())
{
return temp;
}
}
}
return -1;
}
};
LeetCode实现strstr的功能
最新推荐文章于 2022-11-05 11:29:21 发布