Introduction - If you have any usage issues, please Google them yourself
The longest common subsequence algorithm LCS. Any two input strings, this algorithm can be found in the length of the longest common subsequence, and output the longest common subsequence.