代码随想录第二十六天

字符串-实现strstr()

题目链接

暴力破解

class Solution {
public:
    int strStr(string haystack, string needle) {
         int n = haystack.size();
         int m = needle.size();
        for(int i = 0; i <= n - m; i++){
            int j = i, k = 0; 
            while(k < m && haystack[j] == needle[k]){
                j++;
                k++;
            }
            if(k == m) return i;
        }
        return -1;

    }
};