本题是一种树形思想的转化
解法和树中DFS的遍历方式想象
题目地址:https://leetcode.com/problems/triangle/#/description
题目: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.
值得注意的是本题规定了时间复杂度是O(ROW)
由于从上之下的搜索路径必定会超出时间复杂度,因此会选择从下至上
解法如下(被注释的部分是我作死写的递归时间复杂度太高惹= =):
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
if(triangle.size() == 0)return 0;
vector<int> mini = triangle[triangle.size() - 1];
cout<<mini[1];
for(int i = triangle.size() - 2; i >= 0; i--){
for(int j = 0; j < triangle[i].size(); j++){
mini[j] = triangle[i][j] + min(mini[j], mini[j + 1]);
}
}
return mini[0];
// return minPath(triangle, 0, 0);
}
/*
int minPath(vector<vector<int>>& tr, int row, int col){
if(row + 1== tr.size())return tr[row][col];
return tr[row][col] + min(minPath(tr, row + 1, col), minPath(tr, row + 1, col + 1));
}
*/
};