28. Implement strStr()
题目描述:
Implement strStr().
Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Example 1:
Input: haystack = "hello", needle = "ll"
Output: 2
Example 2:
Input: haystack = "aaaaa", needle = "bba"
Output: -1
Clarification:
What should we return when needle is an empty string? This is a great question to ask during an interview.
For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C’s strstr() and Java’s indexOf().
简单翻译:
模拟实现strStr()函数,在haystack中找needle,若能找到返回相匹配的第一个索引值,找不到的话就返回-1,若needle为空,则返回0。
思路:
因为昨天刚刚查询了string的库函数,读完题发现这完全跟find函数一样呀,所以投机的话,一行代码就可以解决了。。。
class Solution {
public:
int strStr(string haystack, string needle) {
return haystack.find(needle);
}
};
但毕竟是让自己重新实现么,这么写还是有点小尴尬,正常思路就是两层循环,然后对字符串进行操作。
class Solution {
public:
int strStr(string haystack, string needle) {
int l1,l2;
l1 = haystack.size();
l2 = needle.size();
if(l2 == 0) return 0;
if(l1<l2) return -1;
for(int i=0;i<l1-l2+1;i++){
int j=0;
for(;j<l2;j++){//这里有个小剪枝,剩余的数量不够匹配needle时,直接结束
if(haystack[i+j]!=needle[j]){
break;
}
}
if(j==l2) return i;
}
return -1;
}
};
总结:
也不知道自己做简单题的思路对不对,反正先把前50道里面的简单题做了再说把,,,