120. Triangle [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).

动态规划，采用自底向上的更新方法，若是从上往下则麻烦很多，每一层的路径数可达2^n多。

 

int minimumTotal(int** triangle, int triangleSize, int* triangleColSize){
    if (triangleSize == 0) return 0;
    if (triangleSize == 1) return triangle[0][0];
    for (int i = triangleSize - 2; i >= 0; i--) 
        for (int j = 0; j < triangleColSize[i]; j++) 
            triangle[i][j] = triangle[i][j] + fmin(triangle[i+1][j], triangle[i+1][j+1]);
    return triangle[0][0];
}