LeetCode 120 Triangle

最新推荐文章于 2024-10-01 05:04:32 发布

seawade

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量470

点赞数

分类专栏： LeetCode 文章标签：面试笔试 leetcode

本文链接：https://blog.csdn.net/xift810/article/details/38682217

版权

LeetCode 专栏收录该内容

138 篇文章 0 订阅

订阅专栏

题目

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.

思路

1 首先要发现规律，到达下一行某点x的值只与上一行坐标x和x-1的值相关

2 在头和尾的坐标要特殊处理，特别头和尾的坐标处理还不一样。

代码

public class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        int rows = triangle.size();
        
        for(int i=1;i<rows;i++){
            List<Integer> prerow = triangle.get(i-1);
            List<Integer> currow = triangle.get(i);
            int number = currow.size();
            for(int j=0;j<number;j++){
                if(j==0){
                    currow.set(j,prerow.get(0)+currow.get(0));
                }
                else if(j==number-1){
                    currow.set(j,prerow.get(number-2)+currow.get(number-1));
                }
                else{
                    currow.set(j,Math.min(prerow.get(j),prerow.get(j-1))+currow.get(j));
                }
            }
        }
        int min =Integer.MAX_VALUE;
        for(int i=0;i<triangle.get(rows-1).size();i++){
            int cur = triangle.get(rows-1).get(i);
            if(cur<min){
                min = cur;
            }
        }
        return min;
    }
}