leetcode 28. Implement strStr() Javasubstring 实现

Implement strStr().

Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Example 1:

Input: haystack = “hello”, needle = “ll”
Output: 2
Example 2:

Input: haystack = “aaaaa”, needle = “bba”
Output: -1
Clarification:

What should we return when needle is an empty string? This is a great question to ask during an interview.

For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C’s strstr() and Java’s indexOf().

class Solution {
    public int strStr(String haystack, String needle) {
        int index=0;
        if(needle.length() == 0){
            return 0;
        }
        
        for(int i=0; i<haystack.length(); i++){
            // 判断如果haystack 剩下的字符串长度小于needle的长度，直接返回-1
            if( needle.length() > (haystack.length()-i) ){
                return -1;
            }
                           
            for(int j=0; j <needle.length(); j++){
                if(haystack.charAt(i+j) != needle.charAt(j) ){
                //不相等直接break
                    break;
                }

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