Comparison of Two Types of Solution of Seeking the Longest Common Substring
In the string operations,it's an important algorithm which to find the longest common substring in two strings,it has a broad application.Generally believes it has two categories altogether,because each category can be classified.Former is easy to understand,lower complexity,but it takes up big memory,the latter is more complex,it would be best combined with the KMP.