@@ -0,0 +1,270 @@
+public class Solution %7B%0A  public int strStr(String haystack, String needle) %7B%0A    for (int i = 0; i %3C haystack.length() - needle.length(); i++) %7B%0A      if (haystack.substring(i, i + needle.length()).equals(needle)) %7B%0A        return i;%0A      %7D%0A    %7D%0A    return -1;%0A  %7D%0A%7D%0A

solved strStr