My java solution using substring


  • 1
    X
    public class Solution {
        public int strStr(String haystack, String needle) {
            
            if(haystack == null || needle == null || needle.length() > haystack.length()){
                return -1;
            }
            for(int i = 0; i < haystack.length() - needle.length() + 1; 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.