leetcode_120. Triangle
来源:互联网 发布:oa办公系统java源代码 编辑:程序博客网 时间:2024/06/05 21:12
题目:
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).
从下到上,第一层得到的就是到第2层的最短路的最小值加第一层的数。
代码如下:
class Solution {public: int minimumTotal(vector<vector<int>>& triangle) { int rows = triangle.size(); vector<int>minm = triangle[triangle.size()-1]; for(int row = rows - 2; row >= 0; --row){ for(int i = 0; i <= row; ++i){ minm[i] = min(minm[i], minm[i+1])+triangle[row][i]; } } return minm[0]; }};
0 0
- leetcode_120. Triangle
- leetcode_120 Triangle_动态规划
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- const的常见用法
- stm32的printf重定向
- windows7 安装python +nltk
- 拦截导弹 蓝桥杯算法训练 Java
- thinkphp的SQL八大查询方式
- leetcode_120. Triangle
- linux shell 流程控制
- 顺序栈的完整实现
- JavaScript中格式化Date类型
- 入坑CSDN
- Unity3D游戏学习笔记2
- zoj 3778 Talented Chef (思维)
- 惰性求值和yield-Python
- Java基础知识总结(二)