思想之后再补,先看看实现效果:
Java代码:
public class MatrixChain {
public static void main(String[] args) {
int p[] = {
30, 35, 15, 5, 10, 20, 25, 30, 40};
// 30×35 35×15 15×5 5×10 10×20 20×25 25×30 30×40
int n = p.length - 1; // 矩阵个数
int[][] arr = new int[n + 1][n + 1];
int[][] d = new int[n + 1][n + 1];
StringBuffer sb = new StringBuffer();
for (int i = 65; i < 65 + n; i++) {
sb.append((char)i);
}
String s = "";
//第一个
System.out.println("方法1:由下至上:");
func1(n, arr, p