120. Triangle
来源:互联网 发布:js打开浏览器新窗口 编辑:程序博客网 时间:2024/06/07 22:58
Difficulty: Medium
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.
class Solution {public: int minimumTotal(vector<vector<int>>& triangle) { int size=triangle.size(); vector<int> dp(size, 0); for(int i=size-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]; }};
DP: triangle[i][j]+=min(triangle[i+1][j],triangle[i+1][j+1]); 由下到上计算,最后triangle[0][0]即是结果。
0 0
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120.Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 120.Triangle
- 120. Triangle
- 120. Triangle
- 120. Triangle
- 嵌入式Linux ARM汇编(七)——C语言与ARM汇编混合编程
- 欢迎使用CSDN-markdown编辑器
- 堆栈
- 将Java项目打包成windows程序的过程
- 【codeforces 233 B Non-square Equation】+ 思维
- 120. Triangle
- 微信接口调试问题
- 常用正则表达式
- jsp初识
- 浅谈全国大学生智能车竞赛-摄像头组图像处理及控制算法
- Linux文件夹解释大全
- JDBC学习(1)数据库驱动的下载和导入
- 导入Excle
- android 中的layer图层