
字符串
文章平均质量分 50
orzzzzzzzz
人生就是发现错误和改正错误,以追求一种完美为终极目标
展开
-
Timus 1723 Sandro's Book
DescriptionIt's been quite a number of years since Lich Sandro retired. Sometimes in the evenings, when he feels especially lonely, he takes a book that was presented to him by his student原创 2016-07-22 11:31:28 · 413 阅读 · 0 评论 -
【kmp算法】 水一水珍藏
DescriptionChen, Adrian (November 7, 2013). “Doge Is An Ac- tually Good Internet Meme. Wow.”. Gawker. Retrieved November 22, 2013. Doge is an Internet meme that became popular in 2013. T原创 2016-08-27 23:15:37 · 589 阅读 · 0 评论 -
【KMP算法】
字符串匹配的KMP算法http://blog.youkuaiyun.com/maotianwang/article/details/34466483[转载处]字符串匹配是计算机的基本任务之一。举例来说,有一个字符串"BBC ABCDAB ABCDABCDABDE",我想知道,里面是否包含另一个字符串"ABCDABD"?许多算法可以转载 2016-08-19 10:37:11 · 224 阅读 · 0 评论 -
【KMP算法】KMP统计子串出现次数
A - KMP统计子串出现次数Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 3461DescriptionThe French author Georges Perec (1936–1982) o原创 2016-08-21 17:15:50 · 8571 阅读 · 0 评论 -
【kmp算法】求一个串的重复子串
B - KMP求一个串的重复子串Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 1961DescriptionFor each prefix of a given string S with N c原创 2016-08-21 17:34:56 · 843 阅读 · 0 评论 -
【kmp算法】KMP找子串第一次出现的位置
hdu1711题意:kmp水题思路:只需要第一次匹配成功时标记一下当前位置,输出开始匹配成功的开始匹配的位置即可。【套路】#includeusing namespace std;const int Max=1000001,Lar=10001;int tem[Max];int mar[Lar];int next[Lar];void getnext(int n)原创 2016-08-21 17:52:29 · 1573 阅读 · 0 评论