[LeetCode] 120. Triangle

题目难度：medium

题目：

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

题解：比较经典的一个动态规划问题申请一个大小为n*n的数组dp[n-1][n-1]，

  初始状态：dp[n-1][i]=triangle[n-1][i]，dp的最后一行的值为triangle最后一行的值

  迭代公式：dp[i][j]=min(dp[i+1][j],dp[i+1][j+1])+triangle[i][j]

代码：

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        
        for(int i=triangle.size()-2;i>=0;i--)
            for(int j=0;j<i+1;j++){
                triangle[i][j]=min(triangle[i+1][j],triangle[i+1][j+1])+triangle[i][j];
            }
        return triangle[0][0];
    }
};