Leetcode--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<vector<int>> v(triangle); v[i][j]表示从v[0][0]到v[i][j]的最小路径和

这样最后的结果就是数组v[triangle.size()-1]的最小值

class Solution {
public:
#define MIN(a,b)    ((a)<(b))?(a):(b)
    int minimumTotal(vector<vector<int> > &triangle) {
        if(triangle.size()<=0) 
            return 0;
        else if(triangle.size()==1)
            return triangle[0][0];
        for(int i=1;i<triangle.size();i++)
        {
            int len=triangle[i].size();
            for(int j=0;j<len;j++)
            {
                if(j==0)
                {
                    triangle[i][j]=triangle[i-1][j]+triangle[i][j];
                }
                else if(j==len-1)
                    triangle[i][j]=triangle[i-1][j-1]+triangle[i][j];
                else
                    triangle[i][j]=MIN(triangle[i-1][j-1],triangle[i-1][j])+triangle[i][j];
            }
        }
        vector<int>res(triangle[triangle.size()-1].begin(),triangle[triangle.size()-1].end());
        sort(res.begin(),res.end());
        return  res[0];
    }
};

很奇怪的是这个代码并没有AC，显示输出了错误的值。

原因在哪儿呢？ 

宏定义修改为#define MIN(a,b)    (((a)<(b))?(a):(b))