LeetCode T28 Implement strStr()

题目地址：

中文：https://leetcode-cn.com/problems/implement-strstr/
英文：https://leetcode.com/problems/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 * 10^4
haystack and needle consist of only lower-case English characters.

思路：

就遍历寻找有没有，当第一个字母相同的时候去比较。

题解：

class Solution {
    public int strStr(String haystack, String needle) {
        if(needle==null||needle.length()==0) return 0;
        int len1=haystack.length();
        int len2=needle.length();
        for(int i=0;i<len1;i++){
            if(haystack.charAt(i)==needle.charAt(0))
                if(i+len2<=len1&&haystack.substring(i,i+len2).equals(needle)) return i;
        }
        return -1;
    }
}