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.length()==0) return 0;
if(haystack.length()==0 ) return -1;
char[] haystack_char=haystack.toCharArray();
char[] needle_char=needle.toCharArray();
for(int i=0;i<haystack_char.length;i++){
a:
if(haystack_char[i]==needle_char[0]){
if(haystack_char.length-i>=needle_char.length){
for(int j=0;j<needle_char.length;j++){
if(haystack_char[i+j]!=needle_char[j]){
break a;
}
}
return i;
}
else{
return -1;
}
}
}
return -1;
}
}
/********************************
* 本文来自博客 “李博Garvin“
* 转载请标明出处:http://blog.csdn.net/buptgshengod
******************************************/
【LeetCode从零单排】No28 Implement strStr()
原文地址:http://blog.csdn.net/buptgshengod/article/details/43764229