动态规划之矩阵连乘问题java

矩阵连乘问题是一个经典的动态规划问题，可以使用动态规划算法来解决。下面是使用Java实现矩阵连乘问题的代码：

public class MatrixChainMultiplication {
    public static int matrixChainOrder(int[] p) {
        int n = p.length - 1;
        int[][] m = new int[n][n];
        for (int i = 0; i < n; i++) {
            m[i][i] = 0;
        }
        for (int L = 2; L <= n; L++) {
            for (int i = 0; i < n - L + 1; i++) {
                int j = i + L - 1;
                m[i][j] = Integer.MAX_VALUE;                for (int k = i; k < j; k++) {
                    int q = m[i][k] + m[k + 1][j] + p[i] * p[k + 1] * p[j + 1];
                    if (q < m[i][j]) {
                        m[i][j] = q;
                    }
                }
            }
        }
        return m[0][n - 1];
    }

    public static void main(String[] args) {
        int[] p = {10, 30, 5, 60};
        System.out.println("Minimum number of multiplications is " + matrixChainOrder(p));
    }
}