120. Triangle（dp）

题目：

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,状态方程为： f(i, j) = min  f(i + 1, j), f(i + 1, j + 1)  + (i, j)

代码：

public class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        int n= triangle.size();

        int[][] dp= new int[n][n];
        for(int i=0;i<n;i++)
        {
        	for(int j=0;j<=i;j++){
        		dp[i][j]=triangle.get(i).get(j);
        	}
        }
        for(int i=n-2;i>=0;i--)
        {
        	for(int j=0;j<=i;j++)
        	{
        		dp[i][j]+=Math.min(dp[i+1][j], dp[i+1][j+1]);
        	}
        }
        return dp[0][0];
    }
}