算法分析与设计 矩阵连乘问题幻灯片.ppt

public static void lcs(int i,int j,char [] x,int [][] b) { if (i ==0 || j==0) return; if (b[i][j]== 1){ lcs(i-1,j-1,x,b; System.out.print(x[i]; } else if (b[i][j]== 2) lcs(i-1,j,x,b; else lcs(i,j-1,x,