LeetCode OJ：Implement strStr()（实现子字符串查找）

Implement strStr().

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

额，当然我用的就是暴力搜索来，没用到KMP之类的算法，有时间再来补上辣，代码如下：

 1 class Solution {
 2 public:
 3     int strStr(string haystack, string needle) {
 4         if(!needle.size()) return 0;
 5         if(haystack.size() < needle.size()) return -1;
 6         for(int i = 0; i <= haystack.size() - needle.size(); ++i){
 7             int start = i;
 8             for(int j = 0; j < needle.size() && start < haystack.size() && haystack[start] == needle[j]; ++j, ++start){
 9             }
10             if(start-i == needle.size()) return i;
11         }
12         return -1;
13     }
14 };

 

转载于:https://www.cnblogs.com/-wang-cheng/p/4943055.html