leetcode -- 120. Triangle

题目描述

题目难度：Medium
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.

AC代码

class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        if(triangle == null || triangle.size() == 0) return 0;
        int[] array = new int[triangle.size()];
        array[0] = triangle.get(0).get(0);
        if(triangle.size() == 1) return array[0];
        array[1] = array[0] + triangle.get(1).get(1);
        array[0] += triangle.get(1).get(0);
        if(triangle.size() == 2) return Math.min(array[0], array[1]);
        int n1 = 0, n2 = 0;
        for(int i = 2;i < array.length;i++){
            n1 = array[0];
            n2 = array[1];
            for(int j = 0;j <= i;j++){
                if(j == 0) array[j] += triangle.get(i).get(0);
                else if(j == i) array[j] = n1 + triangle.get(i).get(i);
                else{
                    array[j] = Math.min(n1, n2) + triangle.get(i).get(j);
                    n1 = n2;
                    n2 = array[j + 1];
                }
            }
        }
        int min = array[0];
        for(int i = 1;i < array.length;i++) if(array[i] < min) min = array[i];
        return min;
    }
}