数据结构:字符串匹配(KMP算法)

#include<bits/stdc++.h>
using namespace std;
int Next[100];
void get_next(int s2[],int length2)
{
    int i=1,j=0;Next[1]=0;
    while(i<=length2)
    {
        if(j==0||s2[i-1]==s2[j-1]){
            ++i;++j;Next[i]=j;
        }
        else j=Next[j];
    }
}
void Index(int s1[],int  s2[],int length1,int length2) {
    int sum = 0;
    int n, m;
    int i = 1, j = 1;
    while (i <= length1 && j <= length2) {
        if (j == 0 || s1[i - 1] == s2[j - 1]) {
            ++i, ++j;
        } else {
            j = Next[j];
        }
        if (j > length2) {
            if (sum == 0) {
                n = i - length2;
                m = n + length2 - 1;
                j = 1;
            }
            sum++;
        }
    }
    if (sum == 1)
        cout << n << " " << m;
    else
        cout << "-1";
}
 
int main()
{
    int s1[100],s2[100];//s1主串 s2目标串
    int n1,n2;//代表有n个同学
    cin>>n1;
    for(int i=0;i<n1;i++)
        cin>>s1[i];//每个同学的糖果数
    cin>>n2;
    for(int j=0;j<n2;j++)
        cin>>s2[j];
    get_next(s2,n2);
    Index(s1,s2,n1,n2);
}