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).
Bonus point if you are able to do this using only O( n) extra space, where
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
if(triangle.size()==0) return 0;
if(triangle.size()==1) return triangle[0][0];
for(int i=triangle.size()-2;i>=0;--i)
for(int j=0;j<triangle[i].size();++j)
{
int p=triangle[i][j];
triangle[i][j]=min(triangle[i+1][j]+p,triangle[i+1][j+1]+p);
}
return triangle[0][0];
}
};