题目链接:https://leetcode-cn.com/problems/implement-strstr/
题目如下:
class Solution {
public int strStr(String haystack, String needle) {
int len=needle.length();
String str="";
if(len==0) return 0;
for(int i=0;i<=haystack.length()-len;i++){
str=haystack.substring(i,i+len);
if(str.equals(needle)) return i;
}
return -1;
}
}