LeetCode-Triangle

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/38983329

时间：2014-9-1

题目

Triangle

  Total Accepted: 16827  Total Submissions: 62834 My Submissions

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.

思路

解法

代码

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

结果

Submit Time	Status	Run Time	Language
3 minutes ago	Accepted	436 ms	java

参考

http://blog.csdn.net/worldwindjp/article/details/18302041

返回

LeetCode Solution(持续更新，java>c++)