leetCode刷题归纳-Dynamic Programming(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, where n is the total number of rows in the triangle.

解题思路

---

求从金字塔塔尖到塔底的加权最短路径的问题，很明显在这里我们很容易根据上一行的状态得到本行的状态方程，所以选择的方法依然是动态规划

这一题要注意边缘状态的处理，例如：
       1.塔高为1
        2.走到每层的最左端或者最右端的判断

class Solution {
public:
    int minimumTotal(vector<vector<int>>& triangle) {
        int n=triangle.size();
        int res=INT_MAX;
        vector<int> nRow(n,0);
        for(int i=0;i<n;i++){
            vector<int> tmp=nRow;
            for(int j=0;j<i+1;j++){
                int Jl=max(j-1,0),Jr=j;
                if(j==i) Jr=max(j-1,0);
                nRow[j]=triangle[i][j]+min(tmp[Jl],tmp[Jr]);//状态方程
            }
        }
        for(int i=0;i<n;i++) res=min(nRow[i],res);
        return res;
    }
};