class Solution { public int strStr(String haystack, String needle) { if (needle.equals("")) return 0; if (haystack.equals("")) return -1; for (int i = 0; i < haystack.length();){ int temp = i; int neadleIndex= 0; while(i < haystack.length() && neadleIndex < needle.length() && haystack.charAt(i) ==needle.charAt(neadleIndex)){ neadleIndex++; i++; } if(neadleIndex-1 == needle.length() -1) return temp; else { i = temp+1 ; } } return -1; } }