关于使用Next数组求连续字符串个数

题目地址：Power Strings

个人博客地址: http://icharles.top/2018/01/19/KMP/

题目大体意思就是求连续字符串个数
由于刚学习完KMP，就想到了利用Next数组来求连续字符串的个数，发现存在以下关系： N = len / (len - next[len] ）

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn = 1E6 + 5;
char str[maxn];
int nex[maxn], len;

void getnext()
{
    int i = 0, j = -1;
    memset(nex, 0, sizeof(nex));
    nex[0] = -1;
    while(i < len) {
        if(j == -1 || str[i] == str[j]) {
            nex[++i] = ++j;
        }
        else {
            j = nex[j];
        }
    }
}

int main()
{
    while(scanf("%s", str) != EOF) {
        if(str[0] =='.') break;
        len = strlen(str);
        getnext();
    //例如 aaaaa len = 4, len - nex[len] = 1
        if(len % (len - nex[len]) == 0) cout << len / (len - nex[len]) << endl;
        else cout << "1" << endl;
    }
    return 0;
}