Leetcode题解 120. Triangle

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).

牢记：从下往上推，用DP即可。

public class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        int len=triangle.size();
        int row=triangle.size();
        int col=triangle.get(len-1).size();
        int[][] dp=new int[row][len];
        for(int i=0;i<col;i++){
            dp[row-1][i]=triangle.get(row-1).get(i);
        }
        for(int i=row-2;i>=0;i--){
            for(int j=0;j<triangle.get(i).size();j++){
                dp[i][j]=Math.min(dp[i+1][j],dp[i+1][j+1])+triangle.get(i).get(j);
            }
        }
        return dp[0][0];
    }
}