算法导论学习--动态规划--最佳二叉搜索树

“

public class 最佳二叉搜索树 {

public static void main(String[] args) {

    double[] p = {0.15, 0.10, 0.05, 0.10, 0.20};
    double[] q = {0.05, 0.10, 0.05, 0.05, 0.05, 0.10};
    int plen = p.length;
    double[][] e = new double[plen+2][plen+2];
    double[][] w = new double[plen+2][plen+2];
    int[][] x = new int[plen+2][plen+2];
    for (int i = 1; i <= plen + 1; i++) {
        w[i][i - 1] = q[i - 1];
        e[i][i - 1] = q[i - 1];
    }
    int size = p.length;
    for (int len = 1; len <= size; len++) {
        for (int i = 0; i < size - len + 1; i++) {
            int j = i + len - 1;
            w[i + 1][j + 1] = w[i + 1][j - 1 + 1] + p[j] + q[j+1];//index要加一
            e[i + 1][j + 1] = Double.MAX_VALUE;
            for (int r = i; r <= j; r++) {
                double cost = e[i + 1][r - 1 + 1] + e[r + 1 + 1][j + 1] + w[i + 1][j + 1];
                if (cost < e[i + 1][j + 1]) {
                    e[i + 1][j + 1] = cost;
                    x[i + 1][j + 1] = r + 1;
                }
            }
        }
    }

    System.out.println("根为" + x[1][6]);
    System.out.println("根为" + "k" + x[1][plen]);
    printf(x, 1, plen, x[1][plen]);
}

private static void printf(int[][] x, int i, int j, int count) {
    if (count - 1 >= i) {
        System.out.println("k" + count + "的左孩子为 k" + x[i][count - 1]);
    }
    if (count + 1 <= j) {
        System.out.println("k" + count + "的右孩子为 k" + x[count + 1][j]);
    }
    if (count - 1 >= i) {
        printf(x, i, count - 1, x[i][count - 1]);
    }
    if (count + 1 <= j) {
        printf(x, count + 1, j, x[count + 1][j]);
    }
}
}

“