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.
所以可以用DP的方法,而从上往下方法需要暂存上一层的数据,在空间上是O(n^2)的,因此采用自下而上的方式
public class Solution {
public int minimumTotal(List<List<Integer>> triangle) {
if(triangle==null) return 0;
int len = triangle.size();
int[] dp = new int[len];
for(int i=len-1; i>=0; i--){
for(int j=0; j<i+1; j++){
if(i==len-1){
dp[j] = triangle.get(i).get(j);
}else{
dp[j] = triangle.get(i).get(j) + Math.min(dp[j], dp[j+1]);
}
}
}
return dp[0];
}
}