Triangle 分类： Leetcode（动态规划） 2015-04-14 09:33 27人阅读 评论(0) 收藏

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

最简单的动态规划题目

状态方程： A[i-1][j]  = min(A[i+1][j] ,A[i+1][j+1])

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        for ( int i =triangle.size() -2; i >=0; --i) {
            for (int j = 0; j < i+1; ++j) {
                triangle[i][j] += min(triangle[i+1][j], triangle[i+1][j+1]);
            }
        }
        return triangle[0][0];
        
    }
};

版权声明：本文为博主原创文章，未经博主允许不得转载。