基础字符串kuangbin题单
我不是手机
这个作者很懒,什么都没留下…
展开
-
字符串主题 KMP,next数组问题,哈希,Manacher,暴力匹配,尺取,ac自动机,kuangbin题单
kmp 子串在母串出现的次数,解决字符串匹配的问题 char a[maxn],b[maxn]; ll lena,lenb; int next1[maxn]; void getnext(){ next1[0]=-1; int i=0,j=-1; while(i<lena){//子串 if(j==-1||a[i]==a[j]){//子串 i++;j++; if(a[i]==a[j]) next1[i]=next1[j]; else next1[i]=j; } else{原创 2020-10-16 19:51:04 · 107 阅读 · 0 评论 -
Number Sequence HDU - 1711 数组kmp匹配(字符串专题)
Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], … , a[K + M - 1] = b[M]. If there are more than one K原创 2020-10-16 20:00:37 · 80 阅读 · 0 评论