Brackets in Matrix Chain Multiplication

//User function Template for Java

class Solution
{
    public static String result(int[][] s, int i, int j) 
    {
        if (i == j) 
        {
            return String.valueOf((char)('A' + i - 1)); 
        } 
        else 
        {
            return "(" + result(s, i, s[i][j]) + result(s, s[i][j] + 1, j) + ")";
            
            
        }
    }



    public static String matrixChainOrder(int p[], int n)
    {
        // code here
        
        
        int[][] m = new int[n][n];
        int[][] s = new int[n][n];


        for (int L = 2; L < n; L++) 
        {
            for (int i = 1; i < n - L + 1; i++) 
            {
                int j = i + L - 1;
                m[i][j] = Integer.MAX_VALUE;
                
                
                for (int k = i; k < j; k++) 
                {
                    int cost = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
                    
                    
                    if (cost < m[i][j]) 
                    {
                        m[i][j] = cost;
                        s[i][j] = k;
                    }
                    
                }
                
            }
            
        }


        return result(s, 1, n - 1);

        
        
        
    }
    
    
}