![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
KMP
文章平均质量分 65
CODE_BALL
SDUT 计院学生一球
展开
-
KMP简单应用
KMP简单应用 Time Limit: 1000MS Memory limit: 65536K 题目描述 给定两个字符串string1和string2,判断string2是否为string1的子串。 输入 输入包含多组数据,每组测试数据包含两行,第一行代表string1(长度小于1000000),第二行代表string2(长度小于1000000),str原创 2014-02-11 16:36:13 · 670 阅读 · 0 评论 -
KMP——Period
Period Time Limit: 1000MS Memory limit: 65536K 题目描述 For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to k原创 2014-02-11 16:38:23 · 736 阅读 · 0 评论 -
Power Strings
Power Strings Time Limit: 1000MS Memory limit: 65536K 题目描述 Given 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"原创 2014-02-11 16:34:04 · 712 阅读 · 0 评论 -
KMP——总结
KMP算法是用于字符串的匹配。原创 2014-06-05 21:34:17 · 531 阅读 · 0 评论