C++ kmp代码

kmp简洁代码：

#include "cstdio"
#include "iostream"
#include "cstring"
using namespace std;

int _next[20];
void getNext(string p)
{
     int len = p.size();
     int i = 0, j = -1;//前后缀
     _next[0] = -1;
     while(i < len)
     {
          if(j == -1 || p[i] == p[j])
          {
              i++;
              j++;
              if(p[i]!=p[j])
                _next[i] = j;
               else
                _next[i]=_next[j];//不能出现p[j] = p[ next[j ]]，所以当出现时需要继续递归，k = next[k] = next[next[k]]
          }
          else
            j = _next[j];
     }
}
int kmp(string s, string p)
{
     int lena = s.size();
     int lenb = p.size();
     int i = 0, j = 0;
     while (i < lena && j < lenb)
     {
          if(j == -1 || s[i] == p[j])
          {
               i++;
               j++;
          }
          else
               j = _next[j];
     }
     if(j == lenb)
          return i-j+1;
     else
          return -1;
}
int main()
{
     string s,p;
     cin>>s>>p;
     getNext(p);
     cout << kmp(s,p) << endl;
     return 0;
}