【LEETCODE】120- Triangle [Python]
来源:互联网 发布:软件测试自学视频 编辑:程序博客网 时间:2024/06/04 17:45
题目:
https://leetcode.com/problems/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.
题意:
Given a triangle, and this problem is to find the minimum sum from top to down layer, at each layer, for each point, it can only sum with its adjacent point.
分析:
Since that when we move to the next layer, the sum depends on the previous layer’s choice, and each choice maybe called more than once, so it’s better to use Dynamic Programming to deal with it.
If we solve it from top to down, it may require to build 2D matrix.
So we can try from down to top.
Suppose the triangle has n layers.
We firstly initiate dp as equal to the last layer of triangle, so dp has 1*n dimension.
Then we move from (n-1)th layer upward, for each movement, we will compare and store the minimum choice for each point in this layer. That is:
At (n-1)th layer, for each i in this layer, find min(triangle[i]+dp[i], triangle[i]+dp[i+1]), then refresh dp[i] with the result.
So dp[i] denote that, till current time, when we move from down to current layer, the minimum so far for each point i in this layer.
[Python]
class Solution(object): def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ n = len(triangle) dp = triangle[n-1] for i in range(n-2,-1,-1): for j in range(i+1): dp[j] = min( dp[j], dp[j+1] ) + triangle[i][j] return dp[0]
- 【LEETCODE】120- Triangle [Python]
- Triangle Leetcode Python
- [Leetcode][python]Triangle
- Leetcode 120 Triangle
- LeetCode 120: Triangle
- LeetCode(120)Triangle
- LeetCode: Triangle [120]
- LeetCode 120 Triangle
- LeetCode 120 Triangle
- [leetcode 120] Triangle
- [Leetcode 120, Medium] Triangle
- leetcode || 120、Triangle
- Triangle - LeetCode 120
- Leetcode[120]-Triangle
- LeetCode(120) Triangle
- Leetcode #120 Triangle
- [leetcode-120]Triangle(c++)
- leetcode 120: Triangle
- HDU 5651 xiaoxin juju needs help
- poj 2955 Brackets 区间DP
- 听韩老师的CSS部分简写文档
- Java并发编程:Thread类的使用
- 关于视频随机拖动的原理分析
- 【LEETCODE】120- Triangle [Python]
- bzoj 2119: 股市的预测 (后缀数组+差分+st表)
- 自定义滑动开关
- 使用java getter/setter方法配置apache shiro
- 洛谷 P2040 打开所有的灯
- 插入排序之 直接插入 法二
- Scanner 类
- 跟我学Redis(17)—Redis事务详解及实例
- 环境变量的介绍与设置