Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[ [2], [3,4], [6,5,7], [4,1,8,3] ]
The minimum path sum from top to bottom is 11
(i.e., 2 + 3 + 5 + 1 = 11).
Note:
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.
Basic dp problem.
思路:
我们倒过来思考,总下往上想。对于最后一行来说,其每个位置往上生长的最小sum都是其本身。对于倒数第二行来说,其每个位置网上生长的最小sum都是其本身加上每个位置相邻的倒数第二行种元素的较小者。比如用题中示例,6位置的最小sum是6+4和6+1中的较小者,也就是6+1.可以更新6为6+1=7.这并不会影响后续生长计算最小sum,因为我们知道总的最小路径和肯定是包含每一小段的最小路径和的。这就利用了bottom-top的动态规划原理。
public int minimumTotal(List<List<Integer>> triangle) {
int n = triangle.size();
for (int i = n - 2; i >= 0; i--)
for (int j = 0; j < triangle.get(i).size(); j++) {
triangle.get(i).set(j, triangle.get(i).get(j) + Math.min(triangle.get(i + 1).get(j), triangle.get(i + 1).get(j + 1)));
}
return triangle.get(0).get(0);
}