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.
求相邻的最小连续路径
思维:从上往下看,设sum[][]为和的路径,num[][]为数列中数
sum[0][0]肯定有一个最小和路径,
sum[1][0]肯定有一个最小和路径,同时sum[1][1]肯定有一个最小和路径;求两者的较小的那一个,与num[0][0]相加就是sum[0][0]最小和路径
sum[2][0]肯定有一个最小和路径,sum[2][1]肯定有一个最小和路径;求两者的较小的那一个,与num[1][0]相加就是sum[1][0]最小和路径;sum[1][1]最小和路径与sum[1][0]同理
依次向下。。。。。。。
算法实现是从下往上走的,从最后一列求出最小的和一直加到三角形顶点,求出必然是相邻的最小的和
public class Solution {
public int minimumTotal(ArrayList<ArrayList<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];
}
}
不知道你理解了吗?