LeetCode Triangle

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int i;
        int j;
        int t1;
        int t2;
        for(i=triangle.size()-2;i>=0;i--)
        {
            for(j=0;j<=i;j++)
            {
                t1=triangle[i][j]+triangle[i+1][j];
                t2=triangle[i][j]+triangle[i+1][j+1];
                if(t1<t2)
                {
                    triangle[i][j]=t1;
                }
                else
                {
                    triangle[i][j]=t2; 
                }
            }
            
        }
        return triangle[0][0];
    }
};