zoukankan      html  css  js  c++  java
  • leetcode[120]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 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.

    class Solution {
    public:
        int minimumTotal(vector<vector<int> > &triangle) {
            int m=triangle.size();
            if(m==0)return 0;
            int n=triangle[0].size();
            if(n==0)return 0;
            vector<int> f=triangle[m-1];
            for(int i=m-2;i>=0;i--)
            {
                for(int j=0;j<i+1;j++)
                {
                    f[j]=(f[j]<f[j+1]?f[j]:f[j+1])+triangle[i][j];
                }
            }
            return f[0];
        }
    };
  • 相关阅读:
    关于codeblocks插件(持续更新)
    自定义gvim配色方案qiucz.vim的源码
    mark it
    poj 1032
    poj 1028
    最小公倍数是lcm
    problems
    hdu 1067
    某些题的做法。。。
    突然明白了什么
  • 原文地址:https://www.cnblogs.com/Vae1990Silence/p/4281286.html
Copyright © 2011-2022 走看看