用动态规划的方法计算矩阵连乘的最少次数: public class MatrixChainOrder { int[] p; int[][] m; int[][] s; int length; public MatrixChainOrder(int[] p,int[][] m,int[][] s){ this.p = p; this.length = p.length/2; this.m = m; this.s = s; init(); clac(); printM(); } public void init(){ for (int i=0;i temp){ t = temp; m[j][r] = temp; } } } } } public void printM(){ for (int i=0;i