Short and understandable JAVA solution, 2ms


  • 1
    S
    public static int strStr(String haystack, String needle) {
        	
        	if(needle.length() > haystack.length()) return -1;
            for (int i = 0; i <= haystack.length() - needle.length(); i++) {
    			if(haystack.substring(i, i + needle.length()).equals(needle)) return i;
    		}
            return -1;
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.