LCS和CLCS的java实现

1. LCS in linear space. A program to compute longest common subsequence between two sequences but in linear space. 2. Constrained LCS. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest s