用动态规划实现矩阵链乘的java代码-Dynamic Programming matrix chain by the java code.

matrix chain Multiplication is perhaps the quintessential example of dynamic programming. The problem can be stated as follows: given a chain <A1, A2,..., An> of n matrices, where for i = 1, 2,...,n, matrix Ai has dimension pi-1 x pi, fully par

矩阵链乘法，采用动态规划，使用java编写。-matrix-chain Question