Leetcode-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 is11(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.

这个题目最大的难点在于：下一行中选的数必须是上一行选的数的邻居。比如，上个例子中，第一行选2，第二行只能在2的邻居即3,4中选择，选择了3，则第三行只能在6,5中选，选择了5，第四行只能在1,8中选，选择了1。

这个题目的解答方法是：动态规划。

dp[i][j]表示从最后一行到第i+1行第j+1个数最小路径和。

import java.util.*;
public class Solution {
    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
        int row = triangle.size();
        int col = triangle.get(row-1).size();
        int[][] dp = new int[row][col];
        for(int i=0; i<col; i++) {
            dp[row-1][i] = triangle.get(row-1).get(i);
        }
        for(int i=row-2; i>=0; i--) {
            ArrayList<Integer> list = triangle.get(i);
            for(int j=0; j<list.size(); j++) {
                dp[i][j] = list.get(j) + Math.min(dp[i+1][j], dp[i+1][j+1]);
            }
        }
        return dp[0][0];
    }
}