triangle(三角形）

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).

Note:
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.

本题是求从第一层vector到最后一层的最短路径，直接在每一层做修改即可。
上例中修改为

[
     [2],
    [5,6],
   [11,10,13],
  [15,11,18,16]
]

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