有这样一个数组;
9 | ||||
12 | 15 | |||
10 | 6 | 8 | ||
2 | 18 | 9 | 5 | |
19 | 7 | 10 | 4 | 16 |
求从数塔顶端至底端和最大的最优路径。
(自底向顶)解析:
对每一层的每两个相邻数据而言;最优路径从他们的父节点值会达到他们其中一个,例如如果最优路径经过第三层的2;
那么第4层他的两个子节点19,7中必然选择19;
对于2来讲,如果最优路径经过他,他选择了19以后就能为路径贡献21;相邻点18选择了10以后贡献28;则他们的父节点10就会选择10对应的这条路径;
依次向上可以得到下图所示的一个数组:
59 | ||||
50 | 49 | |||
38 | 34 | 29 | ||
21 | 28 | 19 | 21 | |
19 | 7 | 10 | 4 | 16 |
从第一层开始向下找到最大子节点即最优路径经过点。
(自底向顶)代码:
package dynamicProgramming;
public class TowerOfNumbers {
public static void tpWalk(int[][] tower) {
int[][] dpTower = new int[tower.length][];
dpTower[tower.length - 1] = tower[tower.length-1];
for(int i = tower.length - 2;i >= 0;i--) {
dpTower[i] = tower[i].clone();
for(int j = 0;j<dpTower[i].length;j++) {
if(dpTower[i+1][j] > dpTower[i+1][j+1])
dpTower[i][j] += dpTower[i+1][j];
else {
dpTower[i][j] += dpTower[i+1][j+1];
}
}
}
System.out.println("最优路径长度:" + dpTower[0][0]);
System.out.println("最优路径:");
int j=0;//路径节点
for(int i = 0;i<dpTower.length-1;i++) {
if(j<dpTower[i].length-1 && dpTower[i][j] < dpTower[i][j+1])
j =j+1;
System.out.print(tower[i][j] + "->");
}
if(j<dpTower[dpTower.length-1].length-1 && dpTower[dpTower.length-1][j] < dpTower[dpTower.length-1][j+1])
j =j+1;
System.out.println(tower[dpTower.length-1][j]);
}
public static void main(String[] args) {
int[][] tower = {{9},{12,15},{10,6,8},{2,18,9,5},{19,7,10,4,16}};
for(int i = 0;i<tower.length;i++) {
for(int j = 0;j<tower[i].length-1;j++) {
System.out.print(tower[i][j] + " ");}
System.out.println(tower[i][tower[i].length-1]);
}
tpWalk(tower);
}
}
自顶向底则是一个子节点选择父节点;
9 | ||||
21 | 24 | |||
31 | 30 | 23 | ||
33 | 49 | 39 | 28 | |
54 | 55 | 59 | 43 | 44 |
示例数据图表来源