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).
class Solution {
public:
int minimumTotal(vector<vector<int> > &triangle) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (triangle.empty()) {
return 0;
}
if (triangle.size() == 1) {
return triangle[0][0];
}
int size = triangle.size();
for (int i = 1; i < size; ++i) {
for (int j = 0; j < triangle[i].size(); ++j) {
if (j == 0) {
triangle[i][j] += triangle[i-1][j];
} else if (j == triangle[i].size() - 1) {
triangle[i][j] += triangle[i-1][j-1];
} else {
triangle[i][j] += triangle[i-1][j] < triangle[i-1][j-1] ? triangle[i-1][j] : triangle[i-1][j-1];
}
}
}
int min = triangle[size-1][0];
for (int i = 1; i < triangle[size-1].size(); ++i) {
if (min > triangle[size-1][i]) {
min = triangle[size-1][i];
}
}
return min;
}
};