kmp
少点多些
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
hdu1686
Oulipo Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4152 Accepted Submission(s): 1641 Problem Description The French author G原创 2014-04-30 22:25:25 · 507 阅读 · 0 评论 -
hdu2594
Simpsons’ Hidden Talents Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2570 Accepted Submission(s): 976 Problem Description Ho原创 2014-05-02 23:08:16 · 532 阅读 · 0 评论 -
hdu1867
A + B for you again Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3789 Accepted Submission(s): 964 Problem Description General原创 2014-05-05 15:56:32 · 412 阅读 · 0 评论 -
hdu1711
Number Sequence Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12912 Accepted Submission(s): 5848 Problem Description Given tw原创 2015-04-18 22:58:09 · 439 阅读 · 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 · 406 阅读 · 0 评论
分享