原创 KMP算法 2203 親和串

kmp算法 背景:已知字符串a和字符串b,求字符串b在字符串a中首次出現的位置 kmp算法的核心精髓在於求next數組 next數組含義:next[i] 以 i 結尾(不包括 i)的字符串中前綴和後綴最長相等的長度 比如:s = aabc

原创 3374 String Problem

String Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(

原创 2087 剪花布條

剪花布條 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14793  

原创 1358 Period

Period Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5990 

原创 2609 How many

How many Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 216

原创 3336 Count the string

Count the string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission

原创 1711 Number Sequence

Number Sequence Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission

原创 1867 A + B for you again

A + B for you again Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submiss