https://leetcode.com/problems/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().
int strStr(char * haystack, char * needle){
char* ch1, *ch2;
int i=0,j=0,len_needle;
len_needle=strlen(needle);
ch1=haystack;
ch2=needle;
while((*ch1 != '\0') && (*ch2 != '\0')){
if((*ch1) == (*ch2)){
ch2++;
j++;
}
else{
ch2=needle;
ch1=ch1-j;
i=i-j;
j=0;
}
ch1++;
i++;
}
if(*ch2=='\0'){
return (i-len_needle);
}
return -1;
}