Alex_McAvoy的博客

【问题形式】文本（Text）：长度为 n 的数组 T[1..n] 模式（Pattern）：一个长度为 m 且 m≤n 的数组 P[1..m] 有效位移/匹配点（Valid Shift）：0≤s≤n-m，且 T[s+1..s+m] = P[1..m]，即对 1≤j≤m，有 T[s+j] = P[j]，则模式 P 在文本 T 中出现且有效位移为 s，且称 s 是匹配点单模式匹配问题，就是给出...

【算法流程】朴素的字符串匹配算法即暴风（Brute Force）算法，又称暴力匹配算法（BF 算法），其本质是暴力枚举，主要特点有：没有预处理阶段； 滑动窗口总是后移 1 位； 对模式中的字符的比较顺序不限定，可以从前到后，也可以从后到前； 匹配阶段需要 O((n - m + 1)m) 的时间复杂度； 需要 2n 次的字符比较；很显然，朴素的字符串匹配算法是最原始的算法，它通过循...

【概述】KMP 算法又称Knuth-Morris-Pratt 字符串匹配算法，是由于 D.E.Knuth、J.H.Morris 和 V.R.Pratt 三人共同研究的，用于解决字符串匹配问题。其核心思想是利用已经部分匹配的有效信息，来保持文本串指针不回溯，通过修改模式串指针，让模式串尽量地移动到有效的位置，因此，整个 KMP 的重点就在于当模式串中某个字符与文本串不匹配时，如何移动模式串...

Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pa...

Problem DescriptionCarneginon was a chic bard. But when he was young, he was frivolous and had joined many gangs. Recently, Caneginon was to be crowned, because the king was shocked by his poems an...

Problem DescriptionFor each prefix with length P of a given string S,ifS[i]=S[i+P] for i in [0..SIZE(S)-p-1],then the prefix is a “period” of S. We want to all the periodic prefixs.InputInpu...

Problem DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the ...

Problem DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at...

Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. T...

Problem DescriptionGiven 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". If we think of concatenation as multiplication, ex...

Problem DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and...

Problem DescriptionIt is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. ...

Problem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for example. I want to find out if I hav...

Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见...

Problem DescriptionString matching is a common type of problem in computer science. One string matching problem is as following:Given a string s[0…len−1], please calculate the length of the longe...