LeetCode 120 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.

思路：若想求出第i行的最小和，我们必须求出第i行的每一个的最小和，这样的话就需要求第i-1行的最小和。

public class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        
		if (triangle == null || triangle.size() == 0)
			return 0;
		if (triangle.size() == 1)
			return triangle.get(0).get(0);

		int[] a = new int[triangle.get(triangle.size() - 1).size()];
		a[0] = triangle.get(0).get(0);

		int[] b = new int[triangle.get(triangle.size() - 1).size()];
		int min = 0;

		for (int i = 1; i < triangle.size(); i++) {
			int j = 0;
			b[0] = a[0] + triangle.get(i).get(0);//每行第一个元素的最小和
			for (j = 1; j < triangle.get(i).size() - 1; j++) {
				min = a[j] < a[j - 1] ? a[j] : a[j - 1];
				b[j] = min + triangle.get(i).get(j);
			}
			b[j] = a[j - 1] + triangle.get(i).get(j);//每行最后一个元素的最小和
			
			for (j = 0; j <triangle.get(i).size(); j++) 
				a[j] = b[j];
		}
		//System.out.println(Arrays.toString(a));
		
		min = b[0];
		for (int i = 0; i < b.length; i++) {
			min = min < b[i] ? min : b[i];
		}
		return min;
    }
}