KMP算法

来源：互联网发布：淘宝规则有哪些编辑：程序博客网时间：2024/06/05 15:30

#include <iostream>  #include <string>  #include <vector>  using namespace std;  void getNext(const string &substr, vector<int> &next)  {      next.clear();      next.resize(substr.size());      int j = -1;      next[0] = -1;      for(int i = 1; i < substr.size(); ++i)      {          while(j > -1 && substr[j + 1] != substr[i])              j = next[j];          if(substr[j + 1] == substr[i])              ++j;          next[i] = j;      }  }  void kmp(const string &str, const string &substr, vector<int> &next)  {      int cnt = 0;      getNext(substr, next);      int j = -1;      for(int i = 0; i < str.size(); ++i)      {          while(j > -1 && substr[j + 1] != str[i])              j = next[j];          if(substr[j + 1] == str[i])              ++j;          if(j == substr.size() - 1)          {              cout << "find in position" << i << endl;              ++cnt;              j = next[j];          }      }      if(cnt == 0)          cout << "not find" << endl;  }  int main()  {      string str, substr;      cin >> str >> substr;      vector<int> next;      kmp(str, substr, next);      return 0;  }

转载自http://blog.csdn.net/a363344923/article/details/41788015

阅读全文

0 0