LeetCode-28. Implement strStr() [C++][Java]

LeetCode-28. Implement strStr()https://leetcode.com/problems/implement-strstr/

Implement strStr().

Given two strings needle and haystack, 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

Constraints:

• 1 <= haystack.length, needle.length <= 10^4
• haystack and needle consist of only lowercase English characters.

【C++】

class Solution {
public:
    int strStr(string haystack, string needle) {
        int hn = haystack.length(), nn = needle.length(), end = hn - nn + 1;
        for (int i = 0; i < end; i++) {
            int j = 0;
            while (j < nn && haystack[i + j] == needle[j]) {j++;}
            if (j == nn) {return i;}
        }
        return -1;
    }
};

【Java】

class Solution {
    public int strStr(String haystack, String needle) {
        int hn = haystack.length(), nn = needle.length(), end = hn - nn + 1;
        for (int i = 0; i < end; i++) {
            int j = 0;
            while (j < nn && haystack.charAt(i + j) == needle.charAt(j)) {j++;}
            if (j == nn) {return i;}
        }
        return -1;
    }
}

参考文献

【1】【算法图文动画详解系列】KMP 字串匹配搜索算法_东海陈光剑的博客-CSDN博客