[LeetCode] Triangle

int minimumTotal(vector<vector<int> > &triangle) {int n = triangle.size();if(n < 1){return 0;}int* min = new int[n];for(int col = 0; col < n; col++){min[col] = triangle[n-1][col];           }for(int row = n-2; row >= 0; row--){for(int col = 0; col <= row; col++){int minNum = min[col] < min[col+1] ? min[col] : min[col+1];min[col] = triangle[row][col] + minNum; }}return min[0];}

自底向上计算最小和。