金字塔最短路径

class Triangle {
private int[][] num;
private int lineNums;
private int[][] lineTotal;


public Triangle(int num) {
this.lineNums = num;
init();
}

private void init() {
System.out.println("请输入金字塔数字:");
Scanner s = new Scanner(System.in);

lineTotal = new int[lineNums][lineNums];
num = new int[lineNums][lineNums];
for (int i = 0; i < lineNums; i++) {

for (int j = 0; j <= i; j++) {
num[i][j] = s.nextInt();
}
}
}

/**
* 从TOP TO BUTTOM进行遍历
*/
public void track() {
lineTotal[0][0] = num[0][0];
int left = 0;
int right = 0;
int leftTotal = 0;
int rightTotal = 0;
int maxIndex = 0;
for (int i = 1; i < 4; i++) {

maxIndex = i - 1;
for (int j = 0; j <= i; j++) {

left = j - 1;
right = left + 1;

if (left <= maxIndex && left > -1) {
leftTotal = lineTotal[i-1][left] + num[i][j];
} else { //如果左结点不在则认为不可达
leftTotal = Integer.MAX_VALUE;
}

if (right <= maxIndex) {
rightTotal = lineTotal[i-1][right] + num[i][j];
} else { //同左结点
rightTotal = Integer.MAX_VALUE;
}

lineTotal[i][j] = leftTotal < rightTotal ? leftTotal : rightTotal;
System.out.println("i=" + i + ", j=" + j + " is " + lineTotal[i][j]);

}
}
}

public void getMinSum() {
int min = Integer.MAX_VALUE;
for (int i = 0; i < 4; i++) {
if (min > lineTotal[3][i]) {
min = lineTotal[3][i];
}
}

System.out.println("top to button 最短路径：" + min);
}
}

控制台输入输出显示：
请输入金字塔数字:
2
3 4
6 5 7
4 1 8 3
i=1, j=0 is 5
i=1, j=1 is 6
i=2, j=0 is 11
i=2, j=1 is 10
i=2, j=2 is 13
i=3, j=0 is 15
i=3, j=1 is 11
i=3, j=2 is 18
i=3, j=3 is 16
top to button 最短路径：11