triangle problem of dp

class Solution {
public:
int minimumTotal(vector<vector>& triangle) {
int last=triangle.size();
for(int i=last-2;i>=0;i--)
{
for(int j=0;j<=i;j++)
triangle[i][j]+=min(triangle[i+1][j],triangle[i+1][j+1]);
}
return triangle[0][0];
}
};

Comments (0)