[Leetcode] 120. Triangle
来源:互联网 发布:淘宝宝贝介绍图拉伸了 编辑:程序博客网 时间:2024/05/09 06:22
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, where n is the total number of rows in the triangle.
import java.util.ArrayList;public class Solution { public int minimumTotal(List<List<Integer>> triangle) { if(triangle == null || triangle.size() == 0) return 0; int n = triangle.size(); int[][] sum = new int[n][n]; for(int i = 0; i < n; i++){ sum[n - 1][i] = triangle.get(n - 1).get(i); } for(int i = n - 2; i >= 0; i--){ for(int j = 0; j <= i; j++){ sum[i][j] = Math.min(sum[i + 1][j], sum[i + 1][j + 1]) + triangle.get(i).get(j); } } return sum[0][0]; }}
0 0
- LeetCode 120. Triangle
- [LeetCode]120.Triangle
- [Leetcode] 120. Triangle
- [leetcode] 120.Triangle
- Leetcode 120. Triangle
- <LeetCode OJ> 120. Triangle
- 120. Triangle LeetCode
- leetcode 120. Triangle
- leetcode-120. Triangle
- LeetCode#120. Triangle
- LeetCode 120. Triangle
- [LeetCode]120. Triangle
- LeetCode *** 120. Triangle
- LeetCode-120.Triangle
- [leetcode] 120. Triangle
- [leetcode]120. Triangle
- LeetCode - 120. Triangle
- Leetcode题解 120. Triangle
- 【Android开发经验】Android开发相关的Blog推荐——跟随大神的脚步才能成长为大神
- LeetCode - Longest Palindromic Substring
- 黑马程序员—StringBuffer
- [Leetcode] 119. Pascal's Triangle II
- ajax的原理和运行机制
- [Leetcode] 120. Triangle
- [Leetcode] 121. Best Time to Buy and Sell Stock
- 黑马程序员—集合部分
- Mac:当iPhone连接苹果电脑时,自动弹出照片的解决方案
- [Leetcode] 122. Best Time to Buy and Sell Stock II
- [Leetcode] 123. Best Time to Buy and Sell Stock III
- Oracle字符集的查看查询和Oracle字符集的设置修改
- 黑马程序员—Map集合
- oracle数据库字符集、服务器字符集、客户端字符集