Introduction - If you have any usage issues, please Google them yourself
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.