weixin_42165786的博客

展开字符串 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3132    Accepted Submission(s): 1510   Problem Description 在纺织CAD系统开发...

#include<bits/stdc++.h>using namespace std;void getnext(int len);int kmp(int len1,int len2);char p[10005],t[100005];int nnext[10005];int main(){ int t1; scanf("%d",&t1); ...

只列出求最小循环节部分for(int i=1;i<=n;i++) { int temp=i-next[i]; if(i%temp==0 && i/temp>1) printf("%d %d\n",i,i/temp); }其中i是求前i个字符，i/te...

poj2406DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, ex...

①注意求串长度时不要每次都算，直接记录下来len=strlen(s);否则会造成超时②求出现的次数就是在求是否匹配的基础上加上判断 if(j==len1)            {                ++sum;                j=next[j];  //子串回到下一个可以匹配的位置            }③kmp时注意 if(j==-1...

方法一 j 0 1 2 3 4 5 6 7 8 9   P[j] a b a b a b a b c a   f(j) -1 -1 0 1 2 3 4 5 -1 0  ...