LeetCode-120. Triangle

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, where n is the total number of rows in the triangle.

题解：

标准DAG模型

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

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。