矩阵连乘算法

Austinu

已于 2023-02-23 18:44:13 修改

阅读量329

点赞数

分类专栏：算法设计与分析（java语言实现）文章标签：算法矩阵 java

于 2019-06-09 21:53:54 首次发布

本文链接：https://blog.csdn.net/Austin_/article/details/91357970

版权

算法设计与分析（java语言实现）专栏收录该内容

24 篇文章 3 订阅

订阅专栏

package 动态规划;

public class 矩阵连乘 {
    //两个矩阵相乘算法
    public static void matrixMultiply(int[][]a,int[][]b,int[][]c,int ra,int ca,int rb,int cb) throws IllegalAccessException {
        if (ca != rb){
            throw new IllegalAccessException("矩阵不可乘");
        }
        for (int i=0; i < ra; i++){
            for (int j=0; j < cb; j++){
                int sum=a[i][0]*b[0][j];
                for (int k=1; k<ca; k++){
                    sum += a[i][k]*b[k][j];
                }
                c[i][j]=sum;
                System.out.print(c[i][j]+" ");
            }
            System.out.println();
        }
    }
    //计算最优值
    public static void matrixChain(int[]p,int[][]m,int[][]s){
        int n = p.length-1;
        for (int i=0;i<n; i++)
        {
            m[i][i]=0;
        }
        for (int r=2;r<=n;r++)
        {
            for (int i=0;i<=n-r;i++)
            {
                int j=i+r-1;
                m[i][j] = m[i+1][j]+p[i]*p[i+1]*p[j+1];
                s[i][j] = i;
                for (int k=i+1; k<j; k++)
                {
                    int t = m[i][k]+m[k+1][j]+p[i]*p[k+1]*p[j];
                    if (t<m[i][j])
                    {
                        m[i][j]=t;
                        s[i][j]=k;
                    }
                }
            }
        }
    }
    //构造最优解
    public static void traceback(int[][]s ,int i,int j){
        if (i==j) return;
        traceback(s,i,s[i][j]);
        traceback(s,s[i][j]+1,j);
        if(i==s[i][j] && (s[i][j]+1)==j){
            System.out.println("把A"+(i+1)+"到A"+(j+1)+"括起来");
        }else if(i==s[i][j] && (s[i][j]+1)!=j){
            System.out.println("把A"+((s[i][j]+1)+1)+"到A"+(j+1)+"括起来,在把A"+(i+1)+"到A"+(j+1)+"括起来");
        }else if(i!=s[i][j] && (s[i][j]+1)==j){
            System.out.println("把A"+(i+1)+"到A"+(s[i][j]+1)+"括起来,在把A"+(i+1)+"到A"+(j+1)+"括起来");
        }else{
            System.out.println("把A"+(i+1)+"到A"+(s[i][j]+1)+"括起来，在把A"+((s[i][j]+1)+1)+"到A"+(j+1)+"括起来，然后把A"+(i+1)+"到A"+(j+1)+"括起来");
        }
    }

    public static void main(String[] args) throws IllegalAccessException {
        int[][] a = {{1, 2}, {4, 5}, {7, 8}};
        int[][] b = {{0, 3, 4, 6}, {3, 4, 8, 9}};
        int[] p ={5,3,4,7,2,3,6};
        int[][] d =new int[6][6];
        int[][] s = new int[6][6];
        int n = 0;
        int m = a.length;

        for (int i = 0; i < b.length; i++) {
            n = b[i].length;
        }
        int[][] c = new int[m][n];
//        System.out.println("矩阵相乘结果：");
//        matrixMultiply(a,b,c,3,2,2,4);

        System.out.println("最优值计算结果：");
        matrixChain(p,d,s);

        traceback(s,0,5);
    }
}