1
class Solution {
2
  public int minimumTotal(List<List<Integer>> triangle) {
3

4
    int n = triangle.get(triangle.size() - 1).size();
5
    int dp[] = new int[n + 1];
6

7
    for (int i = triangle.size() - 1; i >= 0; i--) {
8
      for (int j = 0; j < triangle.get(i).size(); j++)
9
        dp[j] = triangle.get(i).get(j) + Math.min(dp[j], dp[j + 1]);
10
    }
11

12
    return dp[0];
13
  }
14
}