LeetCode | 28. Implement strStr()

28. Implement strStr()

Description

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

Solution: (Java)

class Solution {
    public int strStr(String haystack, String needle) {
        if (needle.equals(""))
            return 0;

        int needleLen = needle.length();
        for (int i = 0; i < haystack.length(); i++) {
            if (i + needleLen > haystack.length())
                break;
            if (haystack.charAt(i) == needle.charAt(0)) {
                int flag = 1;
                for (int j = 0; j < needleLen; j++) {
                    if (haystack.charAt(i+j) != needle.charAt(j)) {
                        flag = 0;
                        break;
                    }
                }
                if (flag == 1)
                    return i;
            }
        }
        return -1;
    }
}

思路

本题是求子串在字符串中第一次出现的位置，遍历字符串时，需要注意处理剩余长度小于给定子串的情况。