首页 > 代码库 > Problem Triangle
Problem Triangle
Problem Description:
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
Solution:
1 public int minimumTotal(List<List<Integer>> triangle) { 2 for (int i = triangle.size()- 1; i >= 0; i--) { 3 minimumTriangle(triangle, i); 4 } 5 return triangle.get(0).get(0); 6 } 7 8 public void minimumTriangle(List<List<Integer>> triangle, int row) { 9 if (row == triangle.size() - 1)10 return;11 int min = Integer.MAX_VALUE;12 for (int i = 0; i < triangle.get(row).size(); i++) {13 triangle.get(row).set(i, triangle.get(row).get(i) + Math.min(triangle.get(row+1).get(i), triangle.get(row+1).get(i+1)));14 }15 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。