最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列-Longest common subsequence, also known as the longest common strings (does not require continuous), the English abbreviation for the LCS (Longest Common Subsequence). Defined as a sequence S, if two or more were sub-sequence of known sequence, and is consistent with this condition all the longest sequence, then S is called the known sequence of the longest common subsequence