Leetcode 120 Triangle（DP）

题目连接：Leetcode 120 Triangle

解题思路：dp[i][j] += min(dp[i+1][j], dp[i+1][j+1])。

class Solution {
	public:
		int minimumTotal(vector<vector<int>>& triangle) {
			int m = triangle.size();
			for (int i = m-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];
		}
};