题目链接这里
public class Solution {
public int strStr(String haystack, String needle) {
out:for(int i=0;i<haystack.length()-needle.length()+1;i++)
{
for(int j=0;j<needle.length();j++)
{
if(haystack.charAt(i+j)!=needle.charAt(j))
{
continue out;
}
}
return i;
}
return -1;
}
}