题解 | #三角形最小路径和#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param triangle int整型vector<vector<>> 
     * @return int整型
     */
    int minTrace(vector<vector<int> >& triangle) {
        // write code here
        int m = triangle.size();
        vector<vector<int>> dp(m, vector<int>(m, 0));
        dp[0][0] = triangle[0][0];
        
        for(int i=1; i<m; i++){
            for(int j=0; j<=i; j++){
                if(j == 0){
                    dp[i][j] = dp[i-1][j] + triangle[i][j];
                }
                else if(j == i){
                    dp[i][j] = dp[i-1][j-1] + triangle[i][j];
                }
                else{
                    dp[i][j] = min(dp[i-1][j-1], dp[i-1][j]) + triangle[i][j];
                }
            }
        }
        
        int res = INT_MAX;
        for(int i=0; i<m; i++){
            res = min(res, dp[m-1][i]);
        }
        
        return res;
    }
};