[String][2]Leetcode28. Implement strStr()

Implement strStr().

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

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

Example 1:

Input: haystack = "hello", needle = "ll"
Output: 2

Example 2:

Input: haystack = "aaaaa", needle = "bba"
Output: -1

Example 3:

Input: haystack = "", needle = ""
Output: 0

Constraints:

• 0 <= haystack.length, needle.length <= 5 * 104
• haystack and needle consist of only lower-case English characters.

Solution1: Need Improve, shorter codes

• Time Complexity: O(n^2)

1.Concern case:
2.for loop: start index, and end index
3.this one has many concern case!!!
4.we could use substring
5.Rabin-Karp Solution

class Solution {
    public int strStr(String haystack, String needle) {
        int lenMain = haystack.length();
        int lenFind = needle.length();
        
        //java.lang.StringIndexOutOfBoundsException: String index out of range: 0
        //"a",""
        if((lenFind == 0 && lenMain == 0)||(needle == "" && haystack == "" ))
            return 0;
        if(needle == "" || lenFind == 0) return 0;
        if(lenMain == 0 || haystack == "") return -1;
        
        int len = 0;
        
        for(int i = 0; i < lenMain - lenFind + 1 ; ++i){//to control the start Index
            len = 0;
            for(int j = i; j < lenFind + i; ++j){// to control the end Index
                if(j > lenMain) break;
                if(haystack.charAt(j) != needle.charAt(len))
                    continue;
                len++;
                if(len == lenFind ) return j - len + 1;
            }
        }
        
        return -1;
    }
}

Incorrect Solution:

Reason:
eg: mississippi to find issip
when the i = 5, s!=p, len=0;
If we use just one loop. the start cannot before i=5.
However, we need to find the start before i=5;

class Solution {
    public int strStr(String haystack, String needle) {
        int lenMain = haystack.length();
        int lenFind = needle.length();
        
        //java.lang.StringIndexOutOfBoundsException: String index out of range: 0
        //"a",""
        if((lenFind == 0 && lenMain == 0)||(needle == "" && haystack == "" ))
            return 0;
        if(needle == "" || lenFind == 0) return 0;
        if(lenMain == 0 || haystack == "") return -1;
        
        int len = 0;
        
        for(int i = 0; i < lenMain; ++i){
            if(haystack.charAt(i) == needle.charAt(len)){
                ++len;
            }
            else{
                len = 0;
            }
            if(len == lenFind) return i-len+1;
        }
        
        return -1;
    }
}