(1)问题描述
求俩个数组S1和S2的最长公子序列。
(2)基本思路 ![在这里插入图片描述](https://img-blog.csdnimg.cn/20200124194344204.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDcyMTUzNw==,size_16,color_FFFFFF,t_70)
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200124194434664.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDcyMTUzNw==,size_16,color_FFFFFF,t_70)
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200124194516518.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDcyMTUzNw==,size_16,color_FFFFFF,t_70)
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200124194548750.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDcyMTUzNw==,size_16,color_FFFFFF,t_70)
(3)代码实现
public class fuck {
public static void main(String[] args) {
char []x = {
'A','B','C','B','D','A','B'};
char []y = {
'B','D','C','A','B','A'};
int [][]b = new int[x.length+1][y.length+1];
int lcslength = lcsLength(x,y,b);
System.out.println(lcslength)