1
2
3
4
5
6
7
8
9
10
11
12
13
| class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
int n = triangle.size();
for (int i = 1; i < n; ++i) {
triangle[i][0] += triangle[i - 1][0];
triangle[i][i] += triangle[i - 1][i - 1];
for (int j = 1; j < i; ++j)
triangle[i][j] += min(triangle[i - 1][j - 1], triangle[i - 1][j]);
}
return *min_element(triangle[n - 1].begin(), triangle[n - 1].end());
}
};
|