楠先生

从头到尾彻底理解KMP此文转自神的博客  http://blog.youkuaiyun.com/v_july_v/article/details/7041827#作者：July时间：最初写于2011年12月，2014年7月21日晚10点 全部删除重写成此文，随后的半个多月不断反复改进。后收录于新书《编程之法：面试和算法心得》第4.4节中。1. 引言    本KMP原文最初写于2

OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33539 Accepted: 13568DescriptionThe French author Georges Perec (1936–1982) once wrote a book, L

PeriodTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 15963 Accepted: 7644DescriptionFor each prefix of a given string S with N characters (each charact

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 41689 Accepted: 17335DescriptionGiven two strings a and b we define a*b to be their concate

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16036 Accepted: 8159DescriptionThe little cat is so famous, that many couple