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.
public class Solution {
public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
// Start typing your Java solution below
// DO NOT write main() function
int[] sum = new int[triangle.size()];
if (triangle.size() < 1)
return 0;
int min = sum[0], pre_sum = 0;
for (int i = 0; i < triangle.size(); i++) {
for (int j = 0; j <= i; j++) {
if (j == 0){
pre_sum = sum[j];
sum[j] = sum[j] + triangle.get(i).get(j);
min = sum[0];
}
else if(j == i)
sum[j] = pre_sum + triangle.get(i).get(j);
else {
int temp = pre_sum;
pre_sum = sum[j];
sum[j] = temp < sum[j] ?
temp + triangle.get(i).get(j)
: sum[j] + triangle.get(i).get(j);
}
if (sum[j] < min)
min = sum[j];
}
}
return min;
}
}