leetcode1039 minimum score triangulation of polygon

class Solution {
    public int minScoreTriangulation(int[] A) {

        int n = A.length;
        int[] a  = new int[n*2];
        for(int i=0;i<n*2;i++){
            a[i] = A[i % n];
        }
        int[][] f = new int[n*2][n*2];
        for(int i=0;i<n*2;i++)
            for(int j=0;j<n*2;j++){
                f[i][j] = 50000000;
            }
        for(int i=0;i<n*2-1;i++){
            f[i][i+1] = 0;
        }
        for(int len=3;len<=n;len++)
            for(int i=0;i<n*2-len+1;i++){
                int j= i+len-1;
                for (int k=i+1;k<j;k++) {
               
                    f[i][j] = min(f[i][k]+f[k][j]+ a[i]*a[j]*a[k],f[i][j]);

                }
            }
     
        int m = 50000000;
        for(int i=0;i<n;i++){
            m = min(m,f[i][i+n-1]);
        }
        return m;
    }

    private int min(int a,int b){
        if (a>b){
            return b;
        }
        return a;
    }
}