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).

解题思路：

1. 这道题显然符合多阶段决策模型，故可以考虑用动态规划的解题思想去解题
2. 注意题目中的信息，每一行可以选择下一行相邻的两个元素，而不是每一行中最小的元素

代码如下：

    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
           
	// 用 sum 来记载每个阶段的变化值
	int [] sum = new int[triangle.size()];

        ArrayList last = triangle.get(triangle.size() - 1);
        for(int i = 0; i < last.size(); i++){
            sum[i] = (int)last.get(i);
        }

        for(int i = triangle.size() - 2; i >= 0; i--){
            for(int j = 0; j < triangle.get(i).size(); j++) {
			
		// 状态转移方程
                sum[j] = triangle.get(i).get(j) + Math.min(sum[j],sum[j + 1]);
            }
        }
        return sum[0];
    }

转载于:https://my.oschina.net/happywe/blog/3079796