Leetcode_c++:Triangle (120)
来源:互联网 发布:pure music mac 编辑:程序博客网 时间:2024/05/16 15:58
题目
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).
算法
O(N^2)
设状态为
//原数组上修改
// LeetCode, Triangle// 时间复杂度O(n^2),空间复杂度O(1)class Solution {public: int minimumTotal (vector<vector<int>>& triangle) { for (int i = triangle.size() - 2; i >= 0; --i) for (int j = 0; j < i + 1; ++j) triangle[i][j] += min(triangle[i + 1][j], triangle[i + 1][j + 1]); return triangle [0][0]; }};
0 0
- Leetcode_c++:Triangle (120)
- Leetcode_c++:Pascal's Triangle(118)
- [120]Triangle
- 120Triangle
- 120-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
- CSS学习记录——表格
- BUN16 51640 dp
- android性能优化实战前篇
- NFS服务器配置
- search-a-2d-matrix
- Leetcode_c++:Triangle (120)
- document.cookie.indexof的解释
- Node.js基本语法简介
- 将ivy.xml中的elastisearch版本改成2.3.1然后ant编译后报错解决方案
- 实习杂记(21):ArrayList的toArray
- eclipse maven install报错解决
- 获取到当前点击的程序(例如添加程序锁,需要当前知道点击的程序是哪个)
- Android 实现可以自由移动缩放的图片控件
- U-BOOT 移植过程详解:添加一块新板子的支持