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.

一个典型的动态规划问题，自底向上添加，即可找到最小和。Accepted代码如下：

class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        int l = triangle.size();
        if (l == 0) {
            return 0;
        } else if (l == 1) {
            return triangle.get(0).get(0);
        } else {
            for (int i = l - 2; i >= 0; i--) {
                for (int j = i; j >= 0; j--) {
                    int min = Math.min(triangle.get(i).get(j) + triangle.get(i + 1).get(j), triangle.get(i).get(j) + triangle.get(i + 1).get(j + 1));
                    triangle.get(i).set(j, min);
                }
            }
            return triangle.get(0).get(0);
        }
    }
}