Triangle

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