"Leetcode" 28. Implement StrStr ()

Title:

Implement strStr ().

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

Tips:

This topic can use brute force search methods. Of course, there are other advanced methods such as Rabin-karp, KMP, and so on. These algorithms plan to wait for them to understand later, write some articles to summarize them. So here's just a brute-force search method.

Code:

classSolution { Public:    intSTRSTR (stringHaystackstringneedle) {    intHay_len =haystack.size (); intNeedle_len =needle.size (); if(Needle_len = =0)return 0; if(Hay_len = =0)return-1; inti =0, j =0, p;  for(i =0; I <= Hay_len-needle_len; ++i) { for(P = i, j =0; J < Needle_len; ++j, + +p) {if(haystack[p]! = Needle[j]) Break; }        if(j = = Needle_len)returni; }    return-1;}};

"Leetcode" 28. Implement StrStr ()