LeetCode 28. Implement strStr()

Implement strStr().

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

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

class Solution {

public:

int strStr(string haystack, string needle) {

int len1 = haystack.length();

int len2 = needle.length();

if(len2 == 0)

return 0;

for(int i = 0; i <= len1 - len2; i++) {

for(int j = 0; j < len2 && needle[j] == haystack[i + j]; j++) {

if(j == len2 - 1)

return i;

}

return -1;

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版