Sharing my very neat C++ solution


  • 0
    B
    class Solution {
    public:
        int minimumTotal(vector<vector<int>>& triangle) {
            for(int i=triangle.size()-1;i>0;i--) {
                for(int j=0;j<triangle[i].size()-1;j++) {
                    triangle[i-1][j] = triangle[i-1][j] + min(triangle[i][j], triangle[i][j+1]);
                }
            }
            return triangle[0][0];
        }
    };
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.