Triangle

2019独角兽企业重金招聘Python工程师标准>>>

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

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int n  = triangle.size();
    	vector<int> p(n +1,0);
		while( n -- > 0)
		{
			for(int i = 0 ;i <= n ;  ++i)
				p[i] = triangle[n][i] + ((p[i] < p[i+1])?p[i]:p[i+1]);
		}
		return p[0];
    }
};

转载于:https://my.oschina.net/liangxiao/blog/162592