triangle
来源:互联网 发布:mac os最新版本下载 编辑:程序博客网 时间:2024/05/18 22:54
题目描述
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 is11(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.
面试的时候注意几个问题:
1\路径和是否会越界
2\考虑从底层到上层构建可以避免讨论边界;
3\能否修改原数组,可以的话可以直接传递.
class Solution {public: int minimumTotal(vector<vector<int> > &triangle) { if(triangle.size()<1) return -1; for(int i=triangle.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]; }};
0 0
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- Triangle
- 使用百度地图
- 七、虚拟机类加载机制
- C# 静态构造函数(类型构造器)的要点
- linux中CURL的安装
- "对象不支持此属性或方法"之表单的action赋值
- triangle
- Android中的SurfaceTexture
- PhotoView图片缩放控件源码浅析(一)
- Ubuntu16.04.1如何在终端启动eclipse neon
- 使用CPN Tools工具做简单的登录模型(初学者)
- Play框架常用命令
- webservice接口开发和调用
- Ubuntu 14.04.3 安装 opencv 3.0.0
- 12.1.0.2已弃用catbundle.sql