Compress Words

思路

用kmp把每一个子串和前面已经处理好的答案串进行匹配，答案串从长度等于子串长度的后缀开始匹配即可，最后得到的子串匹配位置，开始接上答案串Compress Words。

代码

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <string.h>
using namespace std;
 
const int maxn = 1e6 + 10;
int nxt[maxn];
char str[maxn];
char ans[maxn];
int lenn,lenm;
signed main() {
	int N;
	scanf("%d",&N);
	scanf("%s",ans);
	lenn=strlen(ans);
	for (int i = 2; i <= N; i++) {
        scanf("%s",str);
        lenm=strlen(str);
        int pos=max(0,lenn-lenm);
        int k = -1, j = 0;
        nxt[0] = -1;
        while(j < lenm){
            if(k == -1 || str[j] == str[k]) nxt[++j] = ++k;
            else k = nxt[k];
        }
    	j = 0;
    	for (int i = pos; i < lenn; i++) {
    		while (j&&ans[i] != str[j])j = nxt[j];
    		if (ans[i] == str[j])j++;
    	}
        for(;j<lenm;j++){
            ans[lenn++]=str[j];
        }
        pos=lenn;
	}
	for(int i=0;i<lenn;i++){
        printf("%c",ans[i]);
	}
	puts("");
	return 0;
}