leetcode 120 Triangle（难易度：Medium）

最新推荐文章于 2020-07-14 11:51:01 发布

zhutianyu_123

最新推荐文章于 2020-07-14 11:51:01 发布

阅读量348

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/zhutianyu_123/article/details/48681771

版权

leetcode 专栏收录该内容

45 篇文章 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).

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.

代码：

#define min(a,b) (((a) < (b)) ? (a) : (b))

int minimumTotal(int** triangle, int triangleRowSize, int *triangleColSizes) {
	int maxlen = triangleColSizes[triangleRowSize - 1];
	
	int *minlen = (int *)malloc(maxlen * sizeof(int));
	for (int i = 0; i < maxlen; i++) // 最后一行的原数据
		minlen[i] = triangle[triangleRowSize - 1][i];

	for (int i = triangleRowSize - 2; i >= 0; i--) //从倒数第二行开始
		for (int j = 0; j < i + 1; j++)
			minlen[j] = min(minlen[j], minlen[j + 1]) + triangle[i][j];

	return minlen[0];  
}

原题地址： https://leetcode.com/problems/triangle/