LeetCode:Triangle
来源:互联网 发布:删除卷会删除数据吗 编辑:程序博客网 时间:2024/06/15 14:38
题目描述:
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).
思路:经典的动态规划题目。自底向上遍历给定的数组,依次算出每点到底部的最短路径,当遍历到第一层时即得到结果。
代码:
int minimumTotal(vector<vector<int> > &triangle){ int length = triangle.size(); vector<int> min_total; for(int i = 0;i < length;i++) min_total.push_back(triangle[length-1][i]); for(int i = length-2;i >= 0;i--) for(int j = 0;j <= i;j++) { min_total[j] = min(min_total[j],min_total[j+1]) + triangle[i][j]; } return min_total[0];}
0 0
- LeetCode : Triangle
- [LeetCode] Triangle
- [Leetcode] Triangle
- [LeetCode] Triangle
- 【leetcode】Triangle
- LeetCode - Triangle
- [LeetCode]Triangle
- [Leetcode]Triangle
- [leetcode]Triangle
- Leetcode: Triangle
- [LeetCode] Triangle
- LeetCode-Triangle
- [leetcode] Triangle
- [LeetCode] Triangle
- LeetCode - Triangle
- 【Leetcode】Triangle
- LeetCode | Triangle
- [leetcode]Triangle
- JSP页面出现同名类包import冲突的解决办法 collides with another import statement
- 再识web_custom_request之post(Jmeter VS Loadrunner)
- Makefile之wildcard
- XCode发布App到调试机
- 李濟馬 送日本軍書
- LeetCode:Triangle
- 傅里叶变换库FFTW的安装配置(VS2010)
- HDU 2825 Wireless Password (AC自动机,DP)
- Binary Tree Preorder, Inorder, Postorder Traversal,Flatten Binary Tree to Linked List
- intent 的URI功能示例总汇
- java实现UDP广播数据报
- jQueryMobile入门及中文api文档
- ftl提示 eclipse freemarker ide 插件安装
- Android下打印调用栈