LeetCode118 Pascal's Triangle

class Solution {
public:
    vector<vector<int> > generate(int numRows) {
        
        
        vector<vector<int> > resultVec;
        vector<int> tempVec;
        int i=0;
        for(int i=0;i<numRows;i++)
        {
            tempVec.clear();
            for(int k=0;k<=i;k++)
            {
                if(k==0)
                {
                    tempVec.push_back(1);
                    continue;
                }
                if(k==i)
                {
                    tempVec.push_back(1);
                    continue;
                }                   
                tempVec.push_back(resultVec[i-1][k-1]+resultVec[i-1][k]);
            }
            resultVec.push_back(tempVec);
        }
        return resultVec;
    }
};