首页 > 代码库 > leetcode. Triangle
leetcode. 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.
下一层的值
minPath[i][j] += min(minPath[i - 1][j - 1], minPath[i - 1][j]);
1 int minimumTotal(vector<vector<int> > &triangle) 2 { 3 vector<vector<int> > minPath(triangle); 4 int min_path = INT_MAX, i, j; 5 6 for (i = 1; i < triangle.size(); i++) 7 { 8 for (j = 0; j <= i; j++) 9 {10 if (j == 0)11 minPath[i][j] += minPath[i - 1][j];12 else if (j == i)13 minPath[i][j] += minPath[i - 1][j - 1];14 else 15 minPath[i][j] += min(minPath[i - 1][j - 1], minPath[i - 1][j]);16 }17 }18 19 for (j = 0; j < i; j++)20 min_path = min(min_path, minPath[i - 1][j]);21 22 return min_path;23 }
leetcode. Triangle
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。