Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
public class Solution {
public int strStr(String haystack, String needle) {
//if(needle.equals(haystack))
//return 0;
int len1=haystack.length();
int len2=needle.length();
if(len2==0)
return 0;
if(len2>len1)
return -1;
int i;
for(i=0;i<=len1-len2;++i){
if(needle.equals(haystack.substring(i,i+len2)))
return i;
}
return -1;
}
}
another
public class Solution {
public int strStr(String haystack, String needle) {
int len1=haystack.length();
int len2=needle.length();
if(len2==0)
return 0;
else if(len2>len1)
return -1;
int i,j;
for(i=0;i<=len1-len2;++i){
int index=i;
for(j=0;j<len2;++j){
if(haystack.charAt(index)==needle.charAt(j)){
index++;
continue;
}
else
break;
}
if(j==len2)
return i;
}
return -1;
}
}