矩阵连乘问题（备忘录）--算法设计与分析

public class memoizedmatrixChain {
   //备忘录
	//定义一个存储矩阵维度的数组
			static int p[]= {1,2,3,4,5,6,7};
			static int n=p.length-1;
		
			static int [][]s=new int[n+1][n+1];
			static int [][]m=new int [n+1][n+1];
			
			
			public static void main(String[] args) {
				// memoizedmatrixChain(n);
				 System.out.println(memoizedmatrixChain(n));
	            Traceback(s,1,2);
			}
			
	public static int memoizedmatrixChain(int n) {
		for(int i=1;i<=n;i++) {
			for(int j=i;j<=n;j++) {
				m[i][j]=0;
				
			}
		}
		return lookupChain(1,n);
	}

	private static int lookupChain(int i, int j) {
		if(m[i][j]>0) return m[i][j];
		if(i==j)return 0;
		int u=lookupChain(i+1,j)+p[i-1]*p[i]*p[j];
		s[i][j]=i;
		for(int k=i+1;k<j;k++) {
			int t=lookupChain(i,k)+lookupChain(k+1,j)+p[i-1]*p[i]*p[j];
			if(t<u) {
				u=t;
				s[i][j]=k;
				
			}
			m[i]