leetcode 120. Triangle
2018-02-07 10:49
309 查看
代码如下:
int minimumTotal(int** triangle, int triangleRowSize, int *triangleColSizes) {
int* min;
min=(int*)malloc(sizeof(int)*(triangleColSizes[triangleRowSize-1]));
memset(min,0,sizeof(int)*triangleColSizes[triangleRowSize-1]);
for(int n=triangleRowSize-1;n>=0;n--)
{
for(int m=0;m<triangleColSizes
;m++)
{
min[m]=(min[m]>min[m+1]?min[m+1]:min[m])+triangle
[m];
}
}
return min[0];
}
int minimumTotal(int** triangle, int triangleRowSize, int *triangleColSizes) {
int* min;
min=(int*)malloc(sizeof(int)*(triangleColSizes[triangleRowSize-1]));
memset(min,0,sizeof(int)*triangleColSizes[triangleRowSize-1]);
for(int n=triangleRowSize-1;n>=0;n--)
{
for(int m=0;m<triangleColSizes
;m++)
{
min[m]=(min[m]>min[m+1]?min[m+1]:min[m])+triangle
[m];
}
}
return min[0];
}
相关文章推荐
- Leetcode 120. Triangle (Medium) (cpp)
- LeetCode120. Triangle
- [LeetCode] 120. Triangle
- [leetcode]120. Triangle(Java)
- Leetcode 120. Triangle
- LeetCode 120. Triangle 动态规划
- Leetcode 120. Triangle
- Leetcode-120. Triangle
- leetcode 120. Triangle
- LeetCode 120. Triangle
- LeetCode 120. Triangle 题解
- 【LeetCode】120. Triangle (3 solutions)
- LeetCode 120. Triangle
- leetcode 120. Triangle
- Leetcode-120. Triangle
- LeetCode 120. Triangle 动态规划
- 【LeetCode】120. Triangle 基于C++和Java的分析及解法,动态规划
- LeetCode 120. Triangle
- LeetCode *** 120. Triangle
- LeetCode -- 120. Triangle