@@ -0,0 +1,476 @@
+public class Solution %7B%0A%0A    public int strStr(String haystack, String needle) %7B%0A%0A        for (int i = 0; i %3C= haystack.length() - needle.length(); i++) %7B%0A%0A            int j = 0;%0A            for ( ; j %3C needle.length(); j++) %7B%0A%0A                if (haystack.charAt(i + j) != needle.charAt(j)) %7B%0A                    break;%0A                %7D%0A%0A            %7D%0A%0A            if (j == needle.length()) %7B%0A                return i;%0A            %7D%0A%0A        %7D%0A%0A        return -1;%0A%0A    %7D%0A%0A%7D%0A

Create : 28 Implement strStr()