package com.ltcode.ds;
import java.util.Scanner;
/**
* @author LT
* @github [https://github.com/ltcodes] [https://gitee.com/fltcode]
* @date 2021/4/21 - 12:39
* @description 矩阵连乘问题的动态规划算法设计过程与实现
*/
public class Matrix {
static int MAX = 100;
// p用来记录矩阵的行列
static int[] p = new int[MAX+1];
// m[i][j]用来记录第i个矩阵至第j个矩阵的最优解
static int[][] m = new int[MAX][MAX];
// s[][]用来记录从哪里断开的才可得到该最优解
static int[][] s = new int[MAX][MAX];
// 矩阵个数
static int n;
public static void matrixChain(){
// m初始化赋值,即对交线位置赋值为0
for (int i = 1; i <= n; i++) {
m[i][i] = 0;
}
// 对角线循环
for (int r = 2; r <= n; r++) {
// 控制行循环
for (int i = 1; i <= n-r+1; i++) {
// 控制列
int j = i+r-1;
// 令当前的值为最小值
// 此处省略了m[i][k]是因为,i=k时,m[i][k]=m[i][i]=0
m[i][j] = m[i+1][j] + p[i-1]*p[i]*p[j];
// 记录当前断开位置
s[i][j] = i;
// k从i+1到j-1循环找m[i][j]的最小值
for (int k = i+1; k < j; k++) {
int temp = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j];
if (temp < m[i][j]) {
m[i][j] = temp;
s[i][j] = k;
}
}
}
}
}
public static void traceBack(int i, int j){
if (i == j){
System.out.printf("A%d", i);
return;
}
System.out.printf("(");
traceBack(i, s[i][j]);
System.out.printf(" x ");
traceBack(s[i][j]+1, j);
System.out.printf(")");
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入矩阵个数:");
n = sc.nextInt();
System.out.println("请输入连乘矩阵的维数:");
for (int i = 0; i <= n; i++) {
p[i] = sc.nextInt();
}
matrixChain();
System.out.printf("最优计算次序为:");
traceBack(1, n);
System.out.println();
System.out.println("乘法次数为:" + m[1][n]);
/**
* 测试数据可以设为六个矩阵分别为:
* A1[30*35],A2[35*15],A3[15*5],A4[5*10],A5[10*20],A6[20*25]
* 则p[0-6]={30,35,15,5,10,20,25}
* 输入:6 30 35 15 5 10 20 25
*
* 输入与输出结果:
* 请输入矩阵个数:6
* 请输入连乘矩阵的维数:30 35 15 5 10 20 25
* 最优计算次序为:((A1 x (A2 x A3)) x ((A4 x A5) x A6))
* 乘法次数为:15125
*/
}
}
05-15
3168
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-23
411
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
04-28