leetcode120 triangle

最新推荐文章于 2020-04-22 19:29:37 发布

ld851

最新推荐文章于 2020-04-22 19:29:37 发布

阅读量239

点赞数

分类专栏：编程题文章标签： LeetCode 数组

本文链接：https://blog.csdn.net/ld851/article/details/77387873

版权

编程题专栏收录该内容

49 篇文章 0 订阅

订阅专栏

题目来源：leetcode

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

思路：数塔问题（直接给二维数组不就得了）

class Solution {
   public int minimumTotal(List<List<Integer>> triangle) {
        //int [][]dp=new int[triangle.size()][triangle.get(0).size()];
        //int i=0;
        int N=0;
        int [][] data=new int [triangle.size()][triangle.size()];
        for(int val:triangle.get(triangle.size()-1)){
            data[triangle.size()-1][N]=triangle.get(triangle.size()-1).get(N);
            N++;
        }
    for (int i=triangle.size()-1;i>=0;i--){
            for(int j=0;j<i;j++)
            data[i-1][j]=Math.min(data[i][j],data[i][j+1])+triangle.get(i-1).get(j);
    }
    return data[0][0];
    }
}

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.

leetcode节省空间复杂度

用一维数组只记录当前行的最小值

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