LeetCode 120

class Solution {
public:
    int minimumTotal(vector<vector<int>>& triangle) {
        const int N=210;
        int dp[N][N];
        memset(dp,0x3f,sizeof dp);
        dp[0][0]=triangle[0][0];
        int n=triangle.size();
        for(int i=1;i<n;i++)
        {
            for(int j=0;j<=i;j++)
            {
                if(i-1>=0&&i-1<n)
                dp[i][j]=min(dp[i-1][j],dp[i][j]);
                if(i-1>=0&&i-1<n&&j-1>=0&&j-1<n)
                dp[i][j]=min(dp[i-1][j-1],dp[i][j]);
                dp[i][j]+=triangle[i][j];
            }
        }
        int ans=0x3f3f3f3f;
        for(int i=0;i<n;i++)
        {
            ans=min(ans,dp[n-1][i]);
        }
        return ans;
    }
};