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

Note:
Bonus point if you are able to do this using only O(n) extra space, wheren is the total number of rows in the triangle.

分析：

dpdpdp！！恢复状态之后写代码都是一次过的感觉真爽。。

代码：

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