KMP
关注
分享
扫一扫
Tsdmw&5t5
Emmmmmmm
展开
-
KMP简单应用
KMP简单应用Time Limit: 1000MS Memory limit: 65536K 题目描述给定两个字符串string1和string2，判断string2是否为string1的子串。输入 输入包含多组数据，每组测试数据包含两行，第一行代表string1(长度小于1000000)，第二行代表string2（长度小于1000000），string1和str原创 2014-02-15 17:13:37 · 462 阅读 · 0 评论 -
Power Strings
Power StringsTime 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-15 17:10:54 · 367 阅读 · 0 评论 -
Period
PeriodTime Limit: 1000MS Memory limit: 65536K 题目描述For each prefix of a given string S with N characters (each character has anASCII code between 97 and 126, inclusive), we want to kno原创 2014-02-15 17:17:16 · 493 阅读 · 0 评论