LeetCode || Pascal's Triangle II

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> result;
        result.push_back(1);
        
        for(int i = 0;i<rowIndex;i++)
        {
            if(i == 0)
            {
                result.push_back(1);
                continue;
            }
            
            int tmp1 = 1, tmp2 = 1;
            for(int j = 1;j<result.size();j++)
            {
                tmp1 = tmp2;
                tmp2 = result[j];
                result[j] = tmp1 + result[j];
                
            }
            result.push_back(1);
        }
        return result;
    }
};