Simple DP problem. Accepted on the first try. Here is the code:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
classSolution{public:intminimumTotal(vector<vector<int>>&triangle){// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
for(inti=triangle.size()-2;i>=0;i--){for(intj=0;j<triangle[i].size();j++){if(triangle[i][j]+triangle[i+1][j]<triangle[i][j]+triangle[i+1][j+1]){triangle[i][j]=triangle[i][j]+triangle[i+1][j];}else{triangle[i][j]=triangle[i][j]+triangle[i+1][j+1];}}}returntriangle[0][0];}};