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().
class Solution {
public:
int strStr(string haystack, string needle) {
int len1=haystack.length(),len2=needle.length(),i,j,k;
if(len2==0){
return 0;
}
// if(len1<len2){
// return -1;
// }
for(i=0;i<=len1-len2;i++){
k=i;
for(j=0;j<len2;j++,k++){
if(haystack[k]!=needle[j]){
break;
}
}
if(j==len2){
return i;
}
}
return -1;
}
};