Triangle

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(List<List<Integer>> triangle) {
                List<Integer> path = new ArrayList<Integer>();
        for (int i = triangle.size() - 1; i >= 0; i--) {
			for (int j = 0; j <= i; j++) {
				if (i == triangle.size() - 1) {
					//初始化
					path.add(triangle.get(i).get(j));
				} else {
					//相邻元素最小和
					path.set(j, triangle.get(i).get(j)+
							Math.min(path.get(j), path.get(j+1)));
				}
			}
		}
        return path.get(0);
    }
}