Description: This is a dynamic planning, seeking the longest common sub-sequence (Longest common string) the source code. The preparation of the implementation of their own. Procedure is simple, there are notes.
File list (Check if you may need any files):