LeetCode 120. Triangle 题解

最新推荐文章于 2020-07-31 11:23:23 发布

daqiang95

最新推荐文章于 2020-07-31 11:23:23 发布

阅读量257

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/daqiang95/article/details/53306002

版权

leetcode 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

120. Triangle

My Submissions

Total Accepted: 87816
Total Submissions: 273424
Difficulty: Medium
Contributors: Admin

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.

解题思路：

设triangle共有n行，找到一个从上到下的最小路径可等效为找到一个从下到上的最短路径。假设输入为一个二维数组（二维vector同理）。令dp[i][j]为从triangle底部到triangle[i][j]的最小值。则有

dp[n-1][j]=triangle[n-1][j];

dp[i][j]=min(dp[i+1][j],dp[i+1][j+1])+triangle[i][j] ;(0<=i<=n-2,0<=j<=i)

由此可得从上到下最小路径为dp[0][0];

代码展示：

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