public class Solution {

    public int strStr(String haystack, String needle) {

        for (int i = 0; i <= haystack.length() - needle.length(); i++) {

            int j = 0;
            for ( ; j < needle.length(); j++) {

                if (haystack.charAt(i + j) != needle.charAt(j)) {
                    break;
                }

            }

            if (j == needle.length()) {
                return i;
            }

        }

        return -1;

    }

}

Create : 28 Implement strStr()
Create : 28 Implement strStr()
