Brassica_的菜园

LeetCode 0010 Regular Expression MatchingThe General SolutionI think we better understand the general solution for string matching problem.The general solution is Nondeterministic Finite Automate (NFA) and Deterministic Finite Automate (DFA).If you don

GT and stringsTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 277    Accepted Submission(s): 52Problem DescriptionYou are give

题目地址：HDU 2459 PKU 3696题意：给一个长度不超过1e51e5的字符串，找出其中一个子串，要求该子串能够被分割成尽可能多的相同的字符串，若有多个符合要求的子串，输出字典序最小的那个。思路：图片不看也没关系，但这个是罗穗骞大佬在他的论文《后缀数组——处理字符串的有力工具》里的原话，然后这是他的spoj687的代码：http://paste.ubuntu.com/23923746/，本