说明：  用线性空间实现最长公共子序列的程序，用C++完成，程序不长，但功能完善，考虑了边界
(Linear space to achieve the longest common sub-sequence of procedures, using C++ Completed, the program is not long, but with perfect functions and taking into account the boundary)