Leetcode - 28. Implement strStr() - Java

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().

1.不使用任何内置函数，逐个对比， 如果发现不匹配， 回到上一次匹配的字符的后一字符重新比对

class Solution {
    public int strStr(String haystack, String needle) {
        if(needle.length()==0){
            return 0;
        }
        if(haystack.length()<needle.length()) return -1;
        else{
            int count = 0;
            boolean find = false;
            for(int i=0;i<haystack.length();i++){
                if(haystack.charAt(i)==needle.charAt(count)){
                    if(count ==0){
                        find = true;
                    }
                    if(find == true){
                        count++;
                    }
                }
                else if(find== true){i= i-count; count = 0; find = false; }
                if(count==needle.length()) return i-count+1;
            }
        }
        return -1;
    }
}

2.使用 substring

class Solution {
    public int strStr(String haystack, String needle) {
        int h_len=haystack.length();
        int n_len=needle.length();
        if(h_len<n_len)
        {
            return -1;
        }
        else if(n_len==0)
        {
            return 0;
        }
        for(int i=0;i<=h_len-n_len;i++)
        {
            if(haystack.substring(i,i+n_len).equals(needle))
            {
                return i;
            }
        }
        return -1;
    }
}

3.使用 IndexOf()

class Solution {
    public int strStr(String haystack, String needle) {
         return haystack.indexOf(needle);
    }
}