public class decooo { public static void main(String[] args) { char[] a={'a','b','c','b','d','c','a'}; char[] b={'d','a','b','d','a'}; int g= find(a,b,a.length-1,b.length-1); System.out.println(g); } public static int find(char[] a,char[] b,int c,int d) { if(c==-1||d==-1)return 0; else {if(a[c]==b[d])return find(a,b,c-1,d-1)+1; else return max(find(a,b,c-1,d),find(a,b,c,d-1));} } public static int max(int a,int b) { return a>b?a:b; } }
1、最长公共子序列长度(java)
于 2022-10-17 21:27:25 首次发布