
kmp
少点多些
这个作者很懒,什么都没留下…
展开
-
hdu1686
OulipoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4152 Accepted Submission(s): 1641Problem DescriptionThe French author G原创 2014-04-30 22:25:25 · 489 阅读 · 0 评论 -
hdu2594
Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2570 Accepted Submission(s): 976Problem DescriptionHo原创 2014-05-02 23:08:16 · 510 阅读 · 0 评论 -
hdu1867
A + B for you againTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3789 Accepted Submission(s): 964Problem DescriptionGeneral原创 2014-05-05 15:56:32 · 394 阅读 · 0 评论 -
hdu1711
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12912 Accepted Submission(s): 5848Problem DescriptionGiven tw原创 2015-04-18 22:58:09 · 418 阅读 · 0 评论 -
KMP算法详解
转自http://www.matrix67.com/blog/archives/115 如果机房马上要关门了,或者你急着要和MM约会,请直接跳到第六个自然段。 我们这里说的KMP不是拿来放电影的(虽然我很喜欢这个软件),而是一种算法。KMP算法是拿来处理字符串匹配的。换句话说,给你两个字符串,你需要回答,B串是否是A串的子串(A串是否包含B串)。比如,字符串A="I'm转载 2015-04-17 20:45:15 · 382 阅读 · 0 评论