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.

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        vector<int> sums(triangle.size(), 0);
        if(sums.size() == 0) return 0;
        for(int ii = 0; ii < triangle.size(); ii ++) {
            vector<int> current = triangle[ii];
            vector<int> tempsums = sums;
            for(int jj = 0; jj < current.size(); jj ++) {
                if(jj == 0) {
                    tempsums[jj] = sums[jj] + current[jj];
                }
                else if(jj == current.size() - 1) {
                    tempsums[jj] = current[jj] + sums[jj - 1];
                }
                else {
                    tempsums[jj] = current[jj] + min(sums[jj] , sums[jj - 1]);
                }
            }
            sums = tempsums;
        }
        
        int min = 0x7fffffff;
        for(int ii = 0; ii < sums.size(); ii ++) {
            if(min > sums[ii]) {
                min = sums[ii];
            }
        }
        
        return min;
    }
};