https://leetcode-cn.com/problems/triangle/
思路:逆向计算
int minimumTotal(vector<vector<int>>& triangle) {
if (triangle.size() == 0) {
return 0;
}
for (int i = triangle.size() - 2; i >= 0; i--) {
for (int j = 0; j < triangle[i].size();j ++) {
triangle[i][j] = min(triangle[i + 1][j], triangle[i + 1][j + 1]) + triangle[i][j];
}
}
return triangle[0][0];
}